{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:16:37Z","timestamp":1778300197492,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422846","type":"print"},{"value":"9783540482192","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48219-9_3","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:56:57Z","timestamp":1184590617000},"page":"22-31","source":"Crossref","is-referenced-by-count":3,"title":["A Generalized Class of Boosting Algorithms Based on Recursive Decoding Models"],"prefix":"10.1007","author":[{"given":"Elizabeth","family":"Tapia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 C.","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"Villena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Schapire, R. E., Singer, Y.: Improved Boosting Algorithms Using Confidence\u2013rated Predictions. Machine Learning, Vol. 37,No. 3, 277\u2013296 (1999)","journal-title":"Machine Learning"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Schapire, R. E., Singer Y.: BoosTexter: A Boosting Based System for Text Categorization. Machine Learning, Vol. 39,Numbers 2\/3, May\/June (2000)","DOI":"10.1023\/A:1007649029923"},{"issue":"3","key":"3_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"XXVII","author":"C. Shannon","year":"1948","unstructured":"Shannon, C.: A Mathematical Theory of Communication. The Bell System Technical Journal, Vol. XXVII,No. 3, 379\u2013423 (1948)","journal-title":"The Bell System Technical Journal"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1090\/trans2\/017\/10","volume":"17","author":"A.N. Kolmogorov","year":"1961","unstructured":"Kolmogorov, A.N., Tihomirov, V. M.: \u025b Entropy and \u025b-Capacity of Sets in Functional Spaces. American Mathematical Society Translations, Vol. 17, 277\u2013364 (1961)","journal-title":"American Mathematical Society Translations"},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/18.720544","volume":"44","author":"D. L. Donoho","year":"1998","unstructured":"Donoho, D. L., Vetterli, M., De Vore, R., Daubechies, I.: Data Compresion and Harmonic Analysis. IEEE Transactions on Information Theory, Vol. 44,No. 6, 2435\u20132476 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR6","unstructured":"Cohen, A., Dahmen, W., Daubechies, I., DeVore, R.: Tree Approximation and optimal encoding. Institut f\u00fcr Geometrie und Praktische Mathematik, Bericht Nr. 174, (1999)"},{"key":"3_CR7","unstructured":"Csisz\u00e1r, I., K\u00f6rner J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, Inc. (London) LTD (1981)"},{"key":"3_CR8","unstructured":"Massey, J. L.: Shannon\u2019s proof of the noisy coding theorem. Abstracts of Papers, IEEE International Symposium on Information Theory, page 107 (1977)"},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0407946","volume-title":"Threshold Decoding","author":"J. Massey","year":"1963","unstructured":"Massey, J.: Threshold Decoding. Cambridge, MA: M.I.T. Press (1963)"},{"key":"3_CR10","volume-title":"Additive Logistic Regression: a Statistical View of Boosting","author":"J. Friedman","year":"1998","unstructured":"Friedman, J., Hastie, T., Tibshirani R.: Additive Logistic Regression: a Statistical View of Boosting. (Tech. Report). Department of Statistics, Stanford University, California (1998)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P. L. Bartlett","year":"1998","unstructured":"Bartlett, P. L.: The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network. IEEE Transactions on Information Theory, Vol. 44,No. 2, 525\u2013536 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"Schapire, R. E.; Freund, Y.; Bartlett, P. L., Lee, W. S.: Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods. The Annals of Statistics, Vol. 26,No. 5, 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"},{"key":"3_CR13","first-page":"572","volume-title":"Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91)","author":"T. Dietterich","year":"1991","unstructured":"Dietterich, T., Bakiri, G.: Error-correcting output codes: A general method for improving multiclass inductive learning programs. Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), 572\u2013577, Anaheim, CA: AAAI Press (1991)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"IT-27","author":"M. Tanner","year":"1981","unstructured":"Tanner, M.: A recursive Approach to Low Complexity Error Correcting Codes. IEEE Transactions on Information Theory, Vol. IT-27, 533\u2013547 (1981)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/49.661110","volume":"16","author":"K. Kschischang","year":"1998","unstructured":"Kschischang, K., Frey, B.: Iterative decoding of compound codes by probability propagation in graphical models. IEEE J. Sel. Areas Comm., Vol. 16(2), 219\u2013230 (1998)","journal-title":"IEEE J. Sel. Areas Comm."},{"key":"3_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity-Check Codes","author":"R. G. Gallaguer","year":"1963","unstructured":"Gallaguer, R. G.: Low Density Parity-Check Codes. Cambridge, Massachusetts: M.I.T. Press (1963)"},{"key":"3_CR17","volume-title":"Codes and Decoding on General Graphs","author":"N. Wiberg","year":"1996","unstructured":"Wiberg N.: Codes and Decoding on General Graphs. Doctoral Dissertation, Department of Electrical Engineering, Link\u00f6ping University, Sweden (1996)"},{"issue":"10","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/26.539767","volume":"44","author":"C. Berrou","year":"1996","unstructured":"Berrou, C., Glavieux, A.: Near Optimum Error Correcting Coding and Decoding: Turbo Codes. IEEE Transactions on Communications, Vol. 44,No. 10, 1261\u20131271 (1996)","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D. J. MacKay","year":"1999","unstructured":"MacKay, D. J.: Good Error Correcting Codes based on Very Sparse Matrices. IEEE Transactions on Information Theory, Vol. 45,No. 2, 399\u2013431 (1999)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Multiple Classifier Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48219-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T21:59:13Z","timestamp":1587765553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48219-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422846","9783540482192"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48219-9_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}