{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:12Z","timestamp":1737097812808,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429128"},{"type":"electronic","value":"9783540456278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45627-9_11","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T15:57:04Z","timestamp":1181663824000},"page":"136-151","source":"Crossref","is-referenced-by-count":0,"title":["How Can Computer Science Contribute to Knowledge Discovery"],"prefix":"10.1007","author":[{"given":"Osamu","family":"Watanabe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"11_CR1","unstructured":"N. Abe and H. Mamitsuka, Query learning strategies using boosting and bagging, in Proc. the 15th Int\u2019l Conf. on Machine Learning (ICML\u201900), 1\u20139, 1998."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01582137","volume":"61","author":"I. Adler","year":"1993","unstructured":"I. Adler and R. Shamir, A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variable ratio, Math. Programming 61, 39\u201352, 1993.","journal-title":"Math. Programming"},{"key":"11_CR3","unstructured":"J. Balc\u00e1zar, Y. Dai, and O. Watanabe, Provably fast training algorithms for support vector machines, in Proc. the first IEEE Int\u2019l Conf. on Data Mining, to appear."},{"key":"11_CR4","unstructured":"J. Balc\u00e1zar, Y. Dai, and O. Watanabe, Random sampling techniques for training support vector machines: For primal-form maximal-margin classifiers, in Proc. the 12th Int\u2019l Conf. on Algorithmic Learning Theory (ALT\u201901), to appear."},{"key":"11_CR5","unstructured":"K.P. Bennett and E.J. Bredensteiner, Duality and geometry in SVM classifiers, in Proc. the 17th Int\u2019l Conf. on Machine Learning (ICML\u20192000), 57\u201364, 2000."},{"key":"11_CR6","unstructured":"P.S. Bradley, O.L. Mangasarian, and D.R. Musicant, Optimization methods in massive datasets, in Handbook of Massive Datasets (J. Abello, P.M. Pardalos, and M.G.C. Resende, eds.), Kluwer Academic Pub., to appear."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1007563306331","volume":"36","author":"L. Breiman","year":"1999","unstructured":"L. Breiman, Pasting small votes for classification in large databases and on-line, Machine Learning 36, 85\u2013103, 1999.","journal-title":"Machine Learning"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"K.L. Clarkson, Las Vegas algorithms for linear and integer programming, J.ACM 42, 488\u2013499, 1995.","journal-title":"J.ACM"},{"key":"11_CR9","unstructured":"M. Collins, R.E. Schapire, and Y. Singer, Logistic regression, AdaBoost and Bregman Distance, in Proc. the 13th Annual Conf. on Comput. Learning Theory (COLT\u201900), 158\u2013169, 2000."},{"key":"11_CR10","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"C. Cortes and V. Vapnik, Support-vector networks, Machine Learning 20, 273\u2013297, 1995.","journal-title":"Machine Learning"},{"key":"11_CR11","unstructured":"N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines, Cambridge Univ. Press, 2000."},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P. Dagum","year":"2000","unstructured":"P. Dagum, R. Karp, M. Luby, and S. Ross, An optimal algorithm for monte carlo estimation, SIAM J. Comput. 29(5), 1484\u20131496, 2000.","journal-title":"SIAM J. Comput."},{"key":"11_CR13","first-page":"1","volume":"32","author":"T.G. Dietterich","year":"1998","unstructured":"T.G. Dietterich, An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting and randomization, Machine Learning 32, 1\u201322, 1998.","journal-title":"Machine Learning"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"C. Domingo, R. Gavald\u00e1, and O. Watanabe, Practical algorithms for on-line selection, in Proc. the first Intl. Conf. on Discovery Science (DS\u201998), Lecture Notes in AI 1532, 150\u2013161, 1998.","DOI":"10.1007\/3-540-49292-5_14"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"C. Domingo, R. Gavald\u00e1, and O. Watanabe, Adaptive sampling methods for scaling up knowledge discovery algorithms, in Proc. the 2nd Intl. Conf. on Discovery Science (DS\u201999), Lecture Notes in AI, 172\u2013183, 1999. (The final version will appear in J. Knowledge Discovery and Data Mining.)","DOI":"10.1007\/3-540-46846-3_16"},{"key":"11_CR16","unstructured":"C. Domingo and O. Watanabe, MadaBoost: A modification of AdaBoost, in Proc. the 13th Annual Conf. on Comput. Learning Theory (COLT\u201900), 180\u2013189, 2000."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"C. Domingo and O. Watanabe, Scaling up a boosting-based learner via adaptive sampling, in Proc. of Knowledge Discovery and Data Mining (PAKDD\u201900), Lecture Notes in AI 1805, 317\u2013328, 2000.","DOI":"10.1007\/3-540-45571-X_37"},{"key":"11_CR18","unstructured":"B. G\u00e4rtner and E. Welzl, A simple sampling lemma: Analysis and applications in geometric optimization, Discr. Comput. Geometry, to appear. (Also available from http:\/\/www.inf.ethz.ch\/personal\/gaertner\/publications.html )"},{"key":"11_CR19","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications (Third Edition), John Wiley & Sons, 1968."},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Y. Freund, Boosting a weak learning algorithm by majority, Information and Computation 121(2), 256\u2013285, 1995.","journal-title":"Information and Computation"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Y. Freund, An adaptive version of the boost by majority algorithm, in Proc. the 12th Annual Conf. on Comput. Learning Theory (COLT\u201999), 102\u2013113, 1999.","DOI":"10.1145\/307400.307419"},{"key":"11_CR22","unstructured":"J. Friedman, T. Hastie, and R. Tibshirani, Additive logistic regression: a statistical view of boosting, Technical Report, 1998."},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Syst. Sci. 55(1), 119\u2013139, 1997.","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR24","unstructured":"B.K. Ghosh and P.K. Sen eds., Handbook of Sequential Analysis, Marcel Dekker, 1991."},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(95)00040-2","volume":"84","author":"R. Greiner","year":"1996","unstructured":"R. Greiner, PALO: a probabilistic hill-climbing algorithm, Artificial Intelligence 84, 177\u2013204, 1996.","journal-title":"Artificial Intelligence"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"P. Haas and A. Swami, Sequential sampling, procedures for query size estimation, IBM Research Report RJ 9101(80915), 1992.","DOI":"10.1145\/130283.130335"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"M. Kearns, Efficient noise-tolerant learning from statistical queries, in Proc. the 25th Annual ACM Sympos. on Theory of Comput. (STOC\u201993), 392\u2013401, 1993.","DOI":"10.1145\/167088.167200"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(93)90224-H","volume":"116","author":"R.J. Lipton","year":"1993","unstructured":"R.J. Lipton, J.F. Naughton, D.A. Schneider, and S. Seshadri, Efficient sampling strategies for relational database operations, Theoret. Comput. Sci. 116, pp.195\u2013226, 1993.","journal-title":"Theoret. Comput. Sci"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/jcss.1995.1050","volume":"51","author":"R.J. Lipton","year":"1995","unstructured":"R.J. Lipton and J.F. Naughton, Query size estimation by adaptive sampling, J. Comput. and Syst. Sci. 51, 18\u201325, 1995.","journal-title":"J. Comput. and Syst. Sci"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"J.F. Lynch, Analysis and application of adaptive sampling, in Proc. the 19th ACM Sympos. on Principles of Database Systems (PODS\u201999), 260\u2013267, 1999.","DOI":"10.1145\/335168.335229"},{"key":"11_CR31","unstructured":"O. Maron and A. Moore, Hoeffding races: accelerating model selection search for classification and function approximation, in Proc. Advances in Neural Information Process. Systems (NIPS\u201994), 59\u201366, 1994."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"J. Platt, Fast training of support vector machines using sequential minimal optimization, in Advances in Kernel Methods \u2014 Support Vector Learning (B. Scholkopf, C.J.C. Burges, and A.J. Smola, eds.), MIT Press, 185\u2013208, 1999.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"issue":"2","key":"11_CR33","first-page":"197","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"R.E. Schapire, The strength of weak learnability, Machine Learning 5(2), 197\u2013227, 1990.","journal-title":"Machine Learning"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"T. Scheffer and S. Wrobel, A sequential sampling algorithm for a general class of utility criteria, in Proc. the 6th ACM Intl. Conf. on Knowledge Discovery and Data Mining (KDD\u201900), 2000.","DOI":"10.1145\/347090.347162"},{"key":"11_CR35","unstructured":"A.J. Smola and B. Scholkopf, A tutorial on support vector regression, NeuroCOLT Technical Report NC-TR-98-030, Royal Holloway College, Univ. London, 1998."},{"key":"11_CR36","unstructured":"A. Wald, Sequential Analysis, John Wiley & Sons, 1947."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2001: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45627-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:36:11Z","timestamp":1737095771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45627-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429128","9783540456278"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-45627-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}