{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:52Z","timestamp":1725474352801},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650683"},{"type":"electronic","value":"9783540496878"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0094810","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:03:33Z","timestamp":1164377013000},"page":"102-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cost sensitive discretization of numeric attributes"],"prefix":"10.1007","author":[{"given":"Tom","family":"Brijs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koen","family":"Vanhoof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,19]]},"reference":[{"key":"12_CR1","unstructured":"Barber C., Dobkin D., and Huhdanpaa H. (1993). The quickhull algorithm for convex hull. Technical Report GCG53, University of Minesota."},{"key":"12_CR2","first-page":"164","volume-title":"Proceedings of the Fifth European Working Session on Learning","author":"J. Catlett","year":"1991","unstructured":"Catlett J. (1991). On changing continuous attributes into ordered discrete attributes. In Proceedings of the Fifth European Working Session on Learning, 164\u2013178. Berlin: Springer-Verlag."},{"key":"12_CR3","unstructured":"Dougherty J., Kohavi R., and Sahami M. (1995). Supervised and unsupervised discretization of continous features. In Machine Learning: Proceedings of the Twelfth Int. Conference, 194\u2013202. Morgan Kaufmann."},{"key":"12_CR4","unstructured":"Elomaa T., and Rousu J. (1996). Finding Optimal Multi-Splits for Numerical Attributes in Decision Tree Learning. Technical Report NC-TR-96-041, University of Helsinki."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Fayyad U., and Irani K. (1992). On the handling of continuous-valued attributes in decision tree generation. In Machine Learning 8. 87\u2013102.","DOI":"10.1007\/BF00994007"},{"key":"12_CR6","unstructured":"Fayyad U., and Irani K. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the Thirteenth Int. Joint Conference on Artificial Intelligence, 1022\u20131027. Morgan Kaufmann."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Fulton T., Kasif S., and Salzberg S. (1995). Efficient algorithms for finding multi-way splits for decision trees. In Proceedings of the Twelfth Int. Conference on Machine Learning, 244\u2013251. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-377-6.50038-4"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Holte R. (1993). Very simple classification rules perform well on most commonly used datasets. In Machine Learning 11, 63\u201390.","DOI":"10.1023\/A:1022631118932"},{"key":"12_CR9","unstructured":"Kerber R. (1992). Chimerge: Discretization of numeric attributes. In Proceedings of the Tenth Nat. Conference on Artificial Intelligence, 123\u2013128. MIT Press."},{"key":"12_CR10","unstructured":"Kohavi R., and Sahami M. (1996). Error-based and Entropy-Based Discretization of Continuous Features. In Proceedings of the Second Int. Conference on Knowledge & Data Mining, 114\u2013119. AAAI Press."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Maas W. (1994). Efficient agnostic PAC-learning with simple hypotheses. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 67\u201375. ACM Press.","DOI":"10.1145\/180139.181016"},{"key":"12_CR12","unstructured":"Provost F., and Fawcett T. (1997). Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions. In Proceedings of the Third Int. Conference on Knowledge Discovery and Data Mining, 43\u201348, AAAI Press."},{"key":"12_CR13","unstructured":"Van de Merckt T. (1993). Decision Trees in Numerical Attributes Spaces. In Proceedings of the Thirteenth Int. Joint Conference on Artificial Intelligence, 1016\u20131021, Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0094810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:23:06Z","timestamp":1558272186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0094810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650683","9783540496878"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0094810","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"19 October 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}