{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:15:28Z","timestamp":1725898528458},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438182"},{"type":"electronic","value":"9783540454281"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45428-4_7","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:50:15Z","timestamp":1179607815000},"page":"72-80","source":"Crossref","is-referenced-by-count":3,"title":["Highlighting Hard Patterns via AdaBoost Weights Evolution"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Caprile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesare","family":"Furlanello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Merler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Y. Freund and R. E. Schapire, \u201cA Decision-theoretic Generalization of Online Learning and an Application to Boosting,\u201d Journal of Computer and System Sciences, vol. 55, pp. 119\u2013139, August 1997.","DOI":"10.1006\/jcss.1997.1504"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee, \u201cBoosting the Margin: A New Explanation for the Effectiveness of Voting Methods,\u201d The Annals of Statistics, vol. 26, no. 5, pp. 1651\u20131686, 1998.","journal-title":"The Annals of Statistics"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"J. Friedman, T. Hastie, and R. Tibshirani, \u201cAdditive logistic regression: a statistical view of boosting,\u201c The Annals of Statistics, 2000.","DOI":"10.1214\/aos\/1016218223"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"R. E. Schapire, \u201cThe boosting approach to machine learning: An overview,\u201d in MSRI Workshop on Nonlinear Estimation and Classification, 2002.","DOI":"10.1007\/978-0-387-21579-2_9"},{"key":"7_CR5","unstructured":"J. Quinlan, \u201cBagging, Boosting, and C4.5,\u201d in Thirteenth National Conference on Artificial Intelligence, (Cambridge), pp. 163\u2013175, AAAI Press\/MIT Press, 1996."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T. G. Dietterich","year":"2000","unstructured":"T. G. Dietterich, \u201cAn experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization,\u201d Machine Learning, vol. 40, no. 2, pp. 139\u2013157, 2000.","journal-title":"Machine Learning"},{"key":"7_CR7","unstructured":"A. J. Grove and D. Schuurmans, \u201cBoosting in the limit: Maximizing the margin of learned ensembles,\u201d in AAAI\/IAAI, pp. 692\u2013699, 1998."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"G. R\u00e4tsch, T. Onoda, and K. M\u00fcller, \u201cSoft margins for Adaboost,\u201d Machine Learning, vol. 42, pp. 287\u2013320, 2001.","journal-title":"Machine Learning"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"V. Vapnik, The nature of statistical learning theory. Statistics for Engineering and Information Science, Springer Verlag, 2000.","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"7_CR10","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C-The Art of Scientific Computing. Cambridge University Press, second ed., 1992."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"W. H\u00e4rdle, Applied Nonparametric Regression, vol. 19 of Econometric Society Monographs. Cambridge University Press, 1990.","DOI":"10.1017\/CCOL0521382483"},{"key":"7_CR12","volume-title":"Theory of Optimal Experiments","author":"V. Fedorov","year":"1972","unstructured":"V. Fedorov, Theory of Optimal Experiments. Academic Press, New York, 1972."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D. D. Lewis and J. Catlett, \u201cHeterogeneous Uncertainty Sampling for Supervised Learning,\u201d in Eleventh International Conference on Machine Learning (Cohen and Hirsh, eds.), (San Francisco), pp. 148\u2013156, Morgan Kaufmann, 1994.","DOI":"10.1016\/B978-1-55860-335-6.50026-X"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Y. Raviv and N. Intrator, \u201cVariance Reduction via Noise and Bias Constraints.,\u201d in Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems (A. Sharkey, ed.), (London), pp. 163\u2013175, Springer-Verlag, 1999.","DOI":"10.1007\/978-1-4471-0793-4_7"}],"container-title":["Lecture Notes in Computer Science","Multiple Classifier Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45428-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:38:35Z","timestamp":1556429915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45428-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438182","9783540454281"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45428-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}