{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:05:53Z","timestamp":1752192353329,"version":"3.41.2"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1013907905629","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T13:55:48Z","timestamp":1041083748000},"page":"189-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces"],"prefix":"10.1007","volume":"48","author":[{"given":"Gunnar","family":"R\u00e4tsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayhan","family":"Demiriz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristin P.","family":"Bennett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"393396_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithm: Bagging, boosting and variants. Machine Learning, 36, 105\u2013142.","journal-title":"Machine Learning"},{"key":"393396_CR2","first-page":"65","volume-title":"Proceedings Seventeenth International Conference on Machine Learning","author":"K. Bennett","year":"2000","unstructured":"Bennett, K., Demiriz, A., & Shawe-Taylor, J. (2000). A column generation algorithm for boosting. In Pat Langley (Ed.), Proceedings Seventeenth International Conference on Machine Learning (pp. 65\u201372). San Francisco: Morgan Kaufmann."},{"key":"393396_CR3","first-page":"343","volume-title":"Proceedings ICANN'97, Int. Conf. on Artificial Neural Networks, Vol. V of LNCS","author":"A. Bertoni","year":"1997","unstructured":"Bertoni, A., Campadelli, P., & Parodi, M. (1997). Aboosting algorithm for regression. In W. Gerstner, A. Germond, M. Hasler, & J.-D. Nicoud (Eds.), Proceedings ICANN'97, Int. Conf. on Artificial Neural Networks, Vol. V of LNCS (pp. 343\u2013348), Berlin: Springer."},{"key":"393396_CR4","volume-title":"Nonlinear programming","author":"D. Bertsekas","year":"1995","unstructured":"Bertsekas, D. (1995). Nonlinear programming. Belmont, MA: Athena Scientific."},{"issue":"1","key":"393396_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1018361916442","volume":"11","author":"P. Bradley","year":"1998","unstructured":"Bradley, P., Mangasarian, O., & Rosen, J. (1998). Parsimonious least norm approximation. Computational Optimization and Applications, 11:1, 5\u201321.","journal-title":"Computational Optimization and Applications"},{"issue":"7","key":"393396_CR6","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman, L. (1999). Prediction games and arcing algorithms. Neural Computation, 11:7, 1493\u20131518. Also Technical Report 504, Statistics Department, University of California, Berkeley.","journal-title":"Neural Computation"},{"key":"393396_CR7","unstructured":"Breneman, C., Sukumar, N., Bennett, K., Embrechts, M., Sundling, M., & Lockwood, L. (2000). Wavelet representations of molecular electronic properties: Applications in ADME, QSPR, and QSAR. Presentation, QSAR in Cells Symposium of the Computers in Chemistry Division's 220th American Chemistry Society National Meeting."},{"key":"393396_CR8","volume-title":"Numerical Mathematics and Scientific Computation","author":"Y. Censor","year":"1997","unstructured":"Censor,Y., & Zenios, S. (1997). Parallel optimization: Theory, algorithms and application. Numerical Mathematics and Scientific Computation. Oxford: Oxford University Press."},{"key":"393396_CR9","unstructured":"Chen, S., Donoho, D., & Saunders, M. (1995). Atomic decomposition by basis pursuit Technical Report 479, Department of Statistics, Stanford University."},{"key":"393396_CR10","unstructured":"Collins, M., Schapire, R., & Singer,Y. (2000). Adaboost and logistic regression unified in the context of information geometry. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory."},{"key":"393396_CR11","doi-asserted-by":"crossref","unstructured":"Cominetti, R., & Dussault, J.-P. (1994). A stable exponential penalty algorithm with superlinear convergence J.O.T.A., 83:2.","DOI":"10.1007\/BF02190058"},{"key":"393396_CR12","unstructured":"Demiriz, A., Bennett, K., Breneman, C., & Embrechts, M. (2001). Support vector machine regression in chemometrics. Computer Science and Statistics. In Proceeding of the Conference on the 32 Symposium on the Interface, to appear."},{"key":"393396_CR13","unstructured":"Dietterich, T. (1999). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40:2."},{"key":"393396_CR14","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1142\/S0218001493000352","volume":"7","author":"H. Drucker","year":"1993","unstructured":"Drucker, H., Schapire, R., & Simard, P. (1993). Boosting performance in neural networks. International Journal of Pattern Recognition and Artificial Intelligence, 7, 705\u2013719.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"393396_CR15","unstructured":"Duffy, N., & Helmbold, D. (2000). Leveraging for regression. In Colt'00 (pp. 208-219)."},{"key":"393396_CR16","unstructured":"Embrechts, M., Kewley, R., & Breneman, C. (1998). Computationally intelligent data mining for the automated design and discovery of novel pharmaceuticals. In C. D. et al. (Ed.), Intelligent engineering systems through artifical neural networks, pp. 391-396. ASME Press."},{"key":"393396_CR17","unstructured":"Fisher, J., D. H. (Ed.). Improving regressors using boosting techniques. In Proceedings of the Fourteenth International Conference on Machine Learning."},{"key":"393396_CR18","unstructured":"Frean, M., & Downs, T. (1998). A simple cost function for boosting. Technical Report, Department of Computer Science and Electrical Engineering, University of Queensland."},{"key":"393396_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/238061.238163","volume-title":"COLT","author":"Y. Freund","year":"1996","unstructured":"Freund, Y., & Schapire, R. (1996). Game theory, on-line prediction and boosting. In COLT. San Mateo, CA: Morgan Kaufman. ACM Press, New York, NY, pp. 325\u2013332."},{"key":"393396_CR20","doi-asserted-by":"crossref","unstructured":"Freund, Y., & Schapire, R. (1994). A decision-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT: European Conference on Computational Learning Theory. LNCS.","DOI":"10.1007\/3-540-59119-2_166"},{"key":"393396_CR21","first-page":"148","volume-title":"Proc. 13th International Conference on Machine Learning","author":"Y. Freund","year":"1996","unstructured":"Freund, Y., & Schapire, R. (1996). Experiments with a new boosting algorithm. In Proc. 13th International Conference on Machine Learning (pp. 148\u2013146). San Mateo, CA: Morgan Kaufmann."},{"key":"393396_CR22","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (1998). Additive logistic regression: A statistical view of boosting. Technical Report, Department of Statistics, Sequoia Hall, Stanford Univerity."},{"key":"393396_CR23","unstructured":"Friedman, J. (1999). Greedy function approximation. Technical Report, Department of Statistics, Stanford University."},{"key":"393396_CR24","volume-title":"The logarithmic potential method of convex programming","author":"K. Frisch","year":"1955","unstructured":"Frisch, K. (1955). The logarithmic potential method of convex programming. Memorandum, University Institute of Economics, Oslo."},{"key":"393396_CR25","unstructured":"Grove, A., & Schuurmans, D. (1998). Boosting in the limit: Maximizing the margin of learned ensembles. In Proceedings of the Fifteenth National Conference on Artifical Intelligence."},{"key":"393396_CR26","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"3","author":"R. Hettich","year":"1993","unstructured":"Hettich, R., & Kortanek, K. (1993). Semi-infinite programming: Theory, methods and applications. SIAM Review, 3, 380\u2013429.","journal-title":"SIAM Review"},{"issue":"4","key":"393396_CR27","first-page":"285","volume":"4","author":"J. A. Kaliski","year":"1997","unstructured":"Kaliski, J. A., Haglin, D. J., Roos, C., & Terlaky, T. (1997). Logarithmic barrier decomposition methods for semi-infinite programming. International Transactions in Operational Research, 4:4, 285\u2013303.","journal-title":"International Transactions in Operational Research"},{"key":"393396_CR28","first-page":"134","volume-title":"Proc. 12th Annual Conference on Computational Learning Theory","author":"J. Kivinen","year":"1999","unstructured":"Kivinen, J., & Warmuth, M. (1999). Boosting as entropy projection. In Proc. 12th Annual Conference on Computational Learning Theory (pp. 134\u2013144). New York: ACM Press."},{"key":"393396_CR29","first-page":"53","volume-title":"Proceedings ICANN'95-International Conference on Artificial Neural Networks","author":"Y. LeCun","year":"1995","unstructured":"LeCun, Y., Jackel, L. D., Bottou, L., Brunot, A., Cortes, C., Denker, J., Drucker, H., Guyon, I., M\u00fcller, U. A., S\u00e4ckinger, E., Simard, P., & Vapnik, V. (1995). Comparison of learning algorithms for handwritten digit recognition. In F. Fogelman-Souli\u00e9, & P. Gallinari (Eds.), Proceedings ICANN'95-International Conference on Artificial Neural Networks (Vol. II, pp. 53\u201360). Nanterre, France. EC2."},{"key":"393396_CR30","unstructured":"Luenberger, D. (1984). Linear and nonlinear programming (2nd edn.). Reading: Addison-Wesley Publishing Co., Reprinted with corrections in May, 1989."},{"key":"393396_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1126\/science.267326","volume":"197","author":"M. C. Mackey","year":"1977","unstructured":"Mackey, M. C., & Glass, L. (1977). Oscillation and chaos in physiological control systems. Science, 197, 287\u2013289.","journal-title":"Science"},{"key":"393396_CR32","unstructured":"Maclin, R., & Opitz, D. (1997). An empirical evaluation of bagging and boosting. In Proc. of AAAI."},{"key":"393396_CR33","unstructured":"Mason, L., Bartlett, P., & Baxter, J. (1998). Improved generalization through explicit optimization of margins. Technical Report, Deparment of Systems Engineering, Australian National University."},{"key":"393396_CR34","first-page":"221","volume-title":"Advances in large margin classifiers","author":"L. Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P., & Frean, M. (1999). Functional gradient techniques for combining hypotheses. In A. Smola, P. Bartlett, B. Sch\u00f6lkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp. 221\u2013247). Cambridge, MA: MIT Press."},{"key":"393396_CR35","unstructured":"Mika, S., R\u00e4tsch, G., & M\u00fcller, K.-R. (2001). A mathematical programming approach to the Kernel Fisher algorithm. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in Neural Information Processing Systems, 13, 591\u2013597."},{"issue":"4","key":"393396_CR36","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1080\/10556780008805787","volume":"13","author":"L. Mosheyev","year":"2000","unstructured":"Mosheyev, L., & Zibulevsky, M. (2000). Penalty\/barrier multiplier algorithm for semidefinite programming. Optimization Methods and Software, 13:4, 235\u2013262.","journal-title":"Optimization Methods and Software"},{"issue":"10","key":"393396_CR37","first-page":"1306","volume":"E78-A","author":"K.-R. M\u00fcller","year":"1995","unstructured":"M\u00fcller, K.-R., Kohlmorgen, J., & Pawelzik, K. (1995). Analysis of switching dynamics with competing neural networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E78-A:10, 1306\u20131315.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"393396_CR38","first-page":"243","volume-title":"Advances in Kernel methods-support vector learning","author":"K.-R. M\u00fcller","year":"1999","unstructured":"M\u00fcller, K.-R., Smola, A., R\u00e4tsch, G., Sch\u00f6lkopf, B., Kohlmorgen, J., & Vapnik, V. (1999). Predicting time series with support vector machines. In B. Sch\u00f6lkopf, C. J. C. Burges, & A. J. Smola (Eds.), Advances in Kernel methods-support vector learning (pp. 243\u2013254). Cambridge, MA: MIT Press. Short version appeared in ICANN'97, Springer Lecture Notes in Computer Science."},{"key":"393396_CR39","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1007\/BFb0020283","volume-title":"Artificial neural networks-ICANN'97","author":"K.-R. M\u00fcller","year":"1997","unstructured":"M\u00fcller, K.-R., Smola, A., R\u00e4tsch, G., Sch\u00f6lkopf, B., Kohlmorgen, J., & Vapnik, V. (1997). Predicting time series with support vector machines. In W. Gerstner, A. Germond, M. Hasler, & J.-D. Nicoud (Eds.), Artificial neural networks-ICANN'97 (pp. 999\u20131004). Berlin: Springer. Lecture Notes in Computer Science, Vol. 1327."},{"issue":"2","key":"393396_CR40","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1162\/neco.1996.8.2.340","volume":"8","author":"K. Pawelzik","year":"1996","unstructured":"Pawelzik, K., Kohlmorgen, J., & M\u00fcller, K.-R. (1996). Annealed competition of experts for a segmentation and classification of switching dynamics. Neural Computation, 8:2, 342\u2013358.","journal-title":"Neural Computation"},{"key":"393396_CR41","volume-title":"Robust boosting via convex optimization","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G. (2001). Robust boosting via convex optimization. Ph.D. Thesis, University of Potsdam, Neues Palais 10, 14469 Potsdam, Germany."},{"issue":"3","key":"393396_CR42","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., & M\u00fcller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42:3, 287\u2013320. also NeuroCOLT Technical Report NC-TR-1998-021.","journal-title":"Machine Learning"},{"key":"393396_CR43","unstructured":"R\u00e4tsch, G., Sch\u00f6lkopf, B., Mika, S., & M\u00fcller, K.-R. (2000a). SVM and boosting: One class. Technical report 119, GMD FIRST, Berlin. Accepted for publication in IEEE TPAMI."},{"key":"393396_CR44","doi-asserted-by":"crossref","first-page":"207","DOI":"10.7551\/mitpress\/1113.003.0016","volume-title":"Advances in large margin classifiers","author":"G. R\u00e4tsch","year":"2000","unstructured":"R\u00e4tsch, G., Sch\u00f6lkopf, B., Smola, A., Mika, S., Onoda, T., & M\u00fcller, K.-R. (2000b). Robust ensemble learning. In A. Smola, P. Bartlett, B. Sch\u00f6lkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp. 207\u2013219). Cambridge, MA: MIT Press."},{"key":"393396_CR45","unstructured":"R\u00e4tsch, G. R., & Warmuth, M. K. (2001). Marginal boosting. Royal Holloway College, NeuroCOLT2 Technical report, 97. London."},{"key":"393396_CR46","first-page":"170","volume-title":"COLT'2000","author":"G. R\u00e4tsch","year":"2000","unstructured":"R\u00e4tsch, G., Warmuth, M., Mika, S., Onoda, T., Lemm, S., & M\u00fcller, K.-R. (2000). Barrier boosting. In COLT'2000 (pp. 170\u2013179). San Mateo, CA: Morgan Kaufmann."},{"key":"393396_CR47","unstructured":"Ridgeway, G. D., & Madigan, T. R. (1999). Boosting methodology for regression problems. In D. Heckerman, & J. Whittaker (Eds.), Proceedings of Artificial Intelligence and Statistics '99 (pp. 152-161). http:\/www.rand.org\/methodology\/stat\/members\/gregr."},{"key":"393396_CR48","first-page":"322","volume-title":"Proc. 14th International Conference on Machine Learning","author":"R. Schapire","year":"1997","unstructured":"Schapire, R., Freund,Y., Bartlett, P., & Lee,W. (1997). Boosting the margin:Anewexplanation for the effectiveness of voting methods. In Proc. 14th International Conference on Machine Learning (pp. 322\u2013330). San Mateo, CA: Morgan Kaufmann."},{"volume-title":"Advances in Kernel methods-support vector learning","year":"1999","key":"393396_CR49","unstructured":"Sch\u00f6lkopf, B., Burges, C., & Smola, A. (Eds.). (1999). Advances in Kernel methods-support vector learning. Cambridge, MA: MIT Press."},{"key":"393396_CR50","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1162\/089976600300015565","volume":"12","author":"B. Sch\u00f6lkopf","year":"2000","unstructured":"Sch\u00f6lkopf, B., Smola, A., Williamson, R. C., & Bartlett, P. L. (2000). New support vector algorithms. Neural Computation, 12, 1207\u20131245.","journal-title":"Neural Computation"},{"key":"393396_CR51","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1007\/BFb0020278","volume-title":"Proc. of the Int. Conf. on Artificial Neural Networks (ICANN'97)","author":"H. Schwenk","year":"1997","unstructured":"Schwenk, H., & Bengio, Y. (1997). AdaBoosting neural networks. In W. Gerstner, A. Germond, M. Hasler, & J.-D. Nicoud (Eds.), Proc. of the Int. Conf. on Artificial Neural Networks (ICANN'97), Vol. 1327 of LNCS (pp. 967\u2013972). Berlin: Springer."},{"key":"393396_CR52","unstructured":"Smola, A. J. (1998). Learning with Kernels. Ph.D. Thesis, Technische Universit\u00a8at Berlin."},{"key":"393396_CR53","volume-title":"Proceedings ICANN'99, Int. Conf. on Artificial Neural Networks","author":"A. Smola","year":"1999","unstructured":"Smola, A., Sch\u00f6lkopf, B., & R\u00e4tsch, G. (1999). Linear programs for automatic accuracy control in regression. In Proceedings ICANN'99, Int. Conf. on Artificial Neural Networks, Berlin: Springer."},{"key":"393396_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V. (1995). The nature of statistical learning theory. New York: Springer Verlag."},{"volume-title":"Time series prediction: Forecasting the future and understanding the past","year":"1994","key":"393396_CR55","unstructured":"Weigend, A., & N. A. Gershenfeld (Eds.) (1994). Time series prediction: Forecasting the future and understanding the past. Addison-Wesley. Santa Fe Institute Studies in the Sciences of Complexity."},{"key":"393396_CR56","first-page":"696","volume-title":"Advances in Neural Information Precessing Systems 13","author":"R. Zemel","year":"2001","unstructured":"Zemel, R., & Pitassi, T. (2001). A gradient-based boosting algorithm for regression problems. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in Neural Information Precessing Systems 13 (pp. 696\u2013702). Cambridge, MA: MIT Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013907905629.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013907905629\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013907905629.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:40:51Z","timestamp":1752147651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013907905629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":56,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["393396"],"URL":"https:\/\/doi.org\/10.1023\/a:1013907905629","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}