{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:47Z","timestamp":1725572207329},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664901"},{"type":"electronic","value":"9783540482475"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48247-5_24","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T06:03:36Z","timestamp":1292565816000},"page":"223-231","source":"Crossref","is-referenced-by-count":0,"title":["Experiments on a Representation-Independent \u201cTop-Down and Prune\u201d Induction Scheme"],"prefix":"10.1007","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Jappy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Blake, C., Keogh, E., Merz, C.J.: UCI repository of machine learning databases (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Buntine, W., Niblett, T.: A further comparison of splitting rules for Decision-Tree induction. Machine Learning, 75\u201385 (1992)","DOI":"10.1007\/BF00994006"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Clark, P., Boswell, R.: Rule induction with CN2: some recent improvements. In: Proc. of the 6 th European Working Session in Learning, pp. 151\u2013161 (1991)","DOI":"10.1007\/BFb0017011"},{"key":"24_CR4","unstructured":"Domingos, P.: A Process-oriented Heuristic for Model selection. In: Proc. of the 15 th International Conference on Machine Learning, pp. 127\u2013135 (1998)"},{"key":"24_CR5","unstructured":"Franck, E., Witten, I.: Using a Permutation Test for Attribute selection in Decision Trees. In: Proc. of the 15th International Conference on Machine Learning, pp. 152\u2013160 (1998)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Holte, R.C.: Very simple classification rules perform well on most commonly used datasets. Machine Learning, 63\u201391 (1993)","DOI":"10.1023\/A:1022631118932"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Mansour, Y.: On the boosting ability of top-down decision tree learning algorithms. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 459\u2013468 (1996)","DOI":"10.1145\/237814.237994"},{"key":"24_CR8","unstructured":"Kearns, M.J., Mansour, Y.: A Fast, Bottom-up Decision Tree Pruning algorithm with Near-Optimal generalization. In: Proc. of the 15 th International Conference on Machine Learning (1998)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Nock, R., Gascuel, O.: On learning decision committees. In: Proc. of the 12th International Conference on Machine Learning, pp. 413\u2013420 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50058-X"},{"key":"24_CR10","unstructured":"Nock, R., Jappy, P.: On the power of decision lists. In: Proc. of the 15th International Conference on Machine Learning, pp. 413\u2013420 (1998)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Nock, R., Jappy, P.: A top-down and prune induction scheme for constrained decision committees. In: Proc. of the 3rd International Symposium on Intelligent Data Analysis (1999) (accepted)","DOI":"10.1007\/3-540-48412-4_3"},{"key":"24_CR12","unstructured":"Quinlan, J.R.: Bagging, Boosting and C4.5. In: Proc. of AAAI 1996, pp. 725\u2013730 (1996)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence rated predictions. In: Proceedings of the Eleventh Annual ACM Conference on Computational Learning Theory, pp. 80\u201391 (1998)","DOI":"10.1145\/279943.279960"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48247-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T04:48:17Z","timestamp":1559882897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48247-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664901","9783540482475"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48247-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}