{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:15Z","timestamp":1725490095644},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435914"},{"type":"electronic","value":"9783540460435"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46043-8_16","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T12:57:11Z","timestamp":1188219431000},"page":"166-175","source":"Crossref","is-referenced-by-count":1,"title":["Induction of Decision Multi-trees Using Levin Search"],"prefix":"10.1007","author":[{"given":"C.","family":"Ferri-Ram\u00edrez","sequence":"first","affiliation":[]},{"given":"J.","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[]},{"given":"M. J.","family":"Ram\u00edrez-Quintana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning, 36:105\u2013139, 1999.","journal-title":"Machine Learning"},{"key":"16_CR2","unstructured":"Leo Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth Publishing Company, 1984."},{"key":"16_CR3","unstructured":"T. Dean and M. Boddy. An analysis of time-dependent planning. In Proc. of the 1th National Conference on Artificial Intelligence, pages 49\u201354, 1988."},{"key":"16_CR4","unstructured":"C. Ferri, J. Hern\u00e1ndez, and M.J. Ram\u00edrez. The FLIP system homepage. http:\/\/www.dsic.upv.es\/~flip\/ , 2000."},{"key":"16_CR5","unstructured":"C. Ferri, J. Hern\u00e1ndez, and M.J. Ram\u00edrez. Learning MDL-guided Decision Trees for Constructor-Based Languages. In WIP track of 11th Int. Conf. on Inductive Logic Progr,ILP01, pages 39\u201350, 2001."},{"key":"16_CR6","unstructured":"Y. Freund and R.E. Schapire. Experiments with a new boosting algorithm. In Proc. of the 13th Int. Conf. on Machine Learning (ICML\u20191996), pages 148\u2013156. Morgan Kaufmann, 1996."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\u201320","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19\u201320:583-628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"16_CR8","unstructured":"SPSS Inc. Clementine homepage, http:\/\/www.spss.com\/clementine\/ ."},{"key":"16_CR9","first-page":"265","volume":"9","author":"L.A. Levin","year":"1973","unstructured":"L.A. Levin. Universal Search Problems. Problems Inform. Transmission, 9:265\u2013266, 1973.","journal-title":"Problems Inform. Transmission"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and its Applications. 2nd Ed. Springer-Verlag, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"16_CR11","unstructured":"M. Mehta, J. Rissanen, and R. Agrawal. MDL-Based Decision Tree Pruning. In Proc. of the 1st Int. Conf. on Knowledge Discovery and Data Mining (KDD\u201995), pages 216\u2013221, 1995."},{"key":"16_CR12","unstructured":"N.J. Nilsson. Artficial Intelligence: a new synthesis. Morgan Kaufmann, 1998."},{"key":"16_CR13","unstructured":"University of California. UCI Machine Learning Repository Content Summary. http:\/\/www.ics.uci.edu\/~mlearn\/MLSummary.html ."},{"issue":"l","key":"16_CR14","first-page":"5","volume":"29","author":"N.C. Berkman","year":"1997","unstructured":"N.C. Berkman P.E. Utgoff and J.A. Clouse. Decision tree induction based on efficient tree restructuring. Machine Learning, 29(l):5\u201344, 1997.","journal-title":"Machine Learning"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"B. Pfahringer. Compression-based discretization of continuous attributes. In Proc. 12th International Conference on Machine Learning, pages 456\u2013463. Morgan Kaufmann, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50063-3"},{"key":"16_CR16","unstructured":"J. R. Quinlan. Induction of Decision Trees. In Read, in Machine Learning. M. Kaufmann, 1990."},{"issue":"3","key":"16_CR17","first-page":"239","volume":"5","author":"J. R. Quinlan","year":"1990","unstructured":"J. R. Quinlan. Learning Logical Definitions from Relations. M.L.J, 5(3):239\u2013266, 1990.","journal-title":"M.L.J"},{"key":"16_CR18","unstructured":"J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"key":"16_CR19","unstructured":"J. R. Quinlan. Bagging, Boosting, and C4.5. In Proc. of the 13th Nat. Conf. on A.I. and the Eighth Innovative Applications of A.I. Conf., pages 725\u2013730. AAAI Press \/ MIT Press, 1996."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. R. Quinlan","year":"1989","unstructured":"J. R. Quinlan and R. L. Rivest. Inferring Decision Trees Using The Minimum Description Length Principle. Information and Computation, 80:227\u2013248, 1989.","journal-title":"Information and Computation"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modelling by shortest data description. Automatica, 14:465\u2013471, 1978.","journal-title":"Automatica"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46043-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:42:15Z","timestamp":1556800935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46043-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435914","9783540460435"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46043-8_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}