{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:44Z","timestamp":1725493124848},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430308"},{"type":"electronic","value":"9783540453291"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45329-6_13","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T02:44:33Z","timestamp":1193366673000},"page":"96-103","source":"Crossref","is-referenced-by-count":1,"title":["Recursive Adaptive ECOC models"],"prefix":"10.1007","author":[{"given":"Elizabeth","family":"Tapia","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Carlos","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Garc\u00eda-Villalba","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Villena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,23]]},"reference":[{"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), pp. 572\u2013577, Anaheim, CA: AAAI Press (1991)","key":"13_CR1"},{"issue":"3","key":"13_CR2","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-rated Predictions. Machine Learning, Vol. 37, No. 3, pp. 277\u2013296 (1999)","journal-title":"Machine Learning"},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45014-9_1","volume-title":"Multiple Classifier Systems, MCS 01","author":"T. Dietterich","year":"2000","unstructured":"Dietterich, T.: Ensemble Methods in Machine Learning. In J. Kittler and F. Roli (Eds.). Multiple Classifier Systems, MCS 01. Springer Lecture Notes in Computer Science, pp. 1\u201315, (2000)"},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-48219-9_3","volume-title":"Multiple Classifier Systems, MCS 02","author":"E. Tapia","year":"2001","unstructured":"Tapia, E., Gonz\u00e1lez, J.C., Villena, J.: A Generalized Class of Boosting Algorithms Based on Recursive Decoding Models. In J. Kittler and F. Roli (Eds.). Multiple Classifier Systems, MCS 02. Springer Lecture Notes in Computer Science, pp. 22\u201331, Cambridge, UK, (2001)"},{"unstructured":"Tapia, E, Gonz\u00e1lez, J.C., Villalba, L: On the design of Error Adaptive ECOC algorithms. In Proc. IDDM 2001 Workshop, 12th ECML, pp. 139\u2013150, Freiburg (2001)","key":"13_CR5"},{"key":"13_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity-Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"Gallager, R. G.: Low Density Parity-Check Codes. Cambridge, Massachusetts, M.I.T. Press (1963)"},{"key":"13_CR7","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)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/49.661110","volume":"16","author":"F. Kschischang","year":"1998","unstructured":"Kschischang F., Frey, B.: Iterative decoding of compound codes by probability propagation in graphical models. IEEE J. Sel. Areas in Comm. Vol. 16, No. 2, pp. 219\u2013230 (1998)","journal-title":"IEEE J. Sel. Areas in Comm"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"M. Tanner","year":"1981","unstructured":"Tanner, M.: A recursive approach to Low Complexity Error Correcting Codes. IEEE Trans. Inf. Theory, Vol. 27, pp. 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"13_CR10","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 Trans. on Communications, Vol. 44, No. 10, pp. 1261\u20131271 (1996)","journal-title":"IEEE Trans. on Communications"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.485713","volume":"42","author":"S. Benedetto","year":"1996","unstructured":"Benedetto S., Montorsi G.: Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes. IEEE Trans. Inf. Theory, Vol. 42, No. 2, pp. 409\u2013428, (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR12","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)"},{"doi-asserted-by":"crossref","unstructured":"Pearl, J.; "Fusion, Propagation and Structuring in Belief Networks", Artificial Intelligence, No. 29, pp. 241\u2013268 (1986)","key":"13_CR13","DOI":"10.1016\/0004-3702(86)90072-X"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T. Richardson","year":"2001","unstructured":"Richardson, T., Urbanke, R.: The Capacity of Low Density Parity Check Codes under Message Passing Decoding. IEEE Trans. Inf. Theory, Vol. 47, No. 2, pp. 599\u2013618 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR15","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 Trans. Inf. Theory, Vol. 45, pp. 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR16","volume-title":"Data Mining, Practical Machine Learning Tools and Techniques with JAVA Implementations","author":"I. Witten","year":"2000","unstructured":"Witten, I., Frank E.: Data Mining, Practical Machine Learning Tools and Techniques with JAVA Implementations. Morgan Kaufmann Publishers, San Francisco, California (2000)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"M. P.C. Fossorier","year":"1999","unstructured":"Fossorier, M. P.C., Mihaljevic, M., Hideki, I.: Reduced Complexity Iterative Decoding of Low Density Parity Check Codes Based on Belief Propagation. IEEE Trans. on Comm., Vol. 47, pp. 673\u2013680 (1999)","journal-title":"IEEE Trans. on Comm."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45329-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:06:46Z","timestamp":1556932006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45329-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430308","9783540453291"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45329-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}