{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:38Z","timestamp":1725488138808},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663324"},{"type":"electronic","value":"9783540484127"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48412-4_3","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:24:43Z","timestamp":1186053883000},"page":"27-38","source":"Crossref","is-referenced-by-count":1,"title":["A \u201cTop-Down and Prune\u201d Induction Scheme for Constrained Decision Committees"],"prefix":"10.1007","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Jappy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,7,8]]},"reference":[{"key":"3_CR1","unstructured":"L. Breiman, J. H. Freidman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984."},{"key":"3_CR2","unstructured":"C. Blake, E. Keogh, and C. J. Merz. UCI repository of machine learning databases. 1998. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"W. Buntine and T. Niblett. A further comparison of splitting rules for DecisionTree induction. Machine Learning, pages 75\u201385, 1992.","DOI":"10.1007\/BF00994006"},{"key":"3_CR4","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"P. Clark and T. Niblett. The CN2 induction algorithm. Machine Learning, 3:261\u2013283, 1989.","journal-title":"Machine Learning"},{"key":"3_CR5","unstructured":"P. Domingos. A Process-oriented Heuristic for Model selection. In Proc. of the 15 th ICML, pages 127\u2013135, 1998."},{"key":"3_CR6","unstructured":"E. Franck and I. Witten. Using a Permutation Test for Attribute selection in Decision Trees. In Proc. of the 15 th ICML, pages 152\u2013160, 1998."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"R. C. Holte. Very simple Classification rules perform well on most commonly used datasets. Machine Learning, pages 63\u201391, 1993.","DOI":"10.1023\/A:1022631118932"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"L. Hyafil and R. Rivest. Constructing optimal decision trees is NP-complete. Inform. Process. Letters, pages 15\u201317, 1976.","DOI":"10.1016\/0020-0190(76)90095-8"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"George H. John, Ron Kohavi, and Karl Pfleger. Irrelevant features and the subset selection problem. In Proc. of the 11 th ICML, pages 121\u2013129, 1994.","DOI":"10.1016\/B978-1-55860-335-6.50023-4"},{"key":"3_CR10","unstructured":"M. J. Kearns and Y. Mansour. A Fast, Bottom-up Decision Tree Pruning algorithm with Near-Optimal generalization. In Proc. of the 15 th ICML, 1998."},{"key":"3_CR11","unstructured":"D. Kohavi and D. Sommerfield. Targetting Business users with Decision Table Classifiers. In Proc. of the 4 th Intl Conf. on KDD, 1998."},{"key":"3_CR12","unstructured":"T. M. Mitchell. Machine Learning. McGraw-Hill, 1997."},{"key":"3_CR13","unstructured":"R. S. Michalski, I. Mozetic, J. Hong, and N. Lavrac. The AQ15 inductive learning system: An overview and experiments. In Proc. of AAAI\u201986, pages 1041\u20131045, 1986."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"R. Nock and O. Gascuel. On learning decision committees. In Proc. of the 12 th ICML, pages 413\u2013420, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50058-X"},{"key":"3_CR15","unstructured":"R. Nock and P. Jappy. On the power of decision lists. In Proc. of the 15 th ICML, pages 413\u2013420, 1998."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"R. Nock and P. Jappy. Decision Tree based induction of Decision Lists. International Journal of Intelligent Data Analysis (accepted), 1999.","DOI":"10.3233\/IDA-1999-3306"},{"key":"3_CR17","unstructured":"J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann, 1994."},{"key":"3_CR18","unstructured":"J. R. Quinlan. Bagging, Boosting and C4.5. In Proc. of AAAI-96, pages 725\u2013730, 1996."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"R. L. Rivest. Learning decision lists. Machine Learning, pages 229\u2013246, 1987.","DOI":"10.1007\/BF00058680"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"R. E. Schapire. The strength of weak learnability. Machine Learning, pages 197\u2013227, 1990.","DOI":"10.1007\/BF00116037"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. In Proceedings of COLT\u201998, pages 80\u201391, 1998.","DOI":"10.1145\/279943.279960"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48412-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:30:44Z","timestamp":1556731844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48412-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663324","9783540484127"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48412-4_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}