{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:53:35Z","timestamp":1794336815940,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540644170","type":"print"},{"value":"9783540697817","type":"electronic"}],"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\/bfb0026697","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T03:27:35Z","timestamp":1132370855000},"page":"268-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scope classification: An instance-based learning algorithm with a rule-based characterisation"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Lachiche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Marquise","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"issue":"4","key":"33_CR1","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Peter Clark and Tim Niblett. The CN2 induction algorithm. Machine Learning, 3(4):261\u2013283, 1989.","journal-title":"Machine Learning"},{"key":"33_CR2","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"Scott Cost and Steven Salzberg. A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning, 10:57\u201378, 1993.","journal-title":"Machine Learning"},{"key":"33_CR3","series-title":"LNAI","first-page":"85","volume-title":"Proc. of the Ninth European Conference on Machine Learning","author":"G. Demiroz","year":"1997","unstructured":"Gulsen Demiroz and H. Altay Guvenir. Classification by voting feature intervals. In Proc. of the Ninth European Conference on Machine Learning, pages 85\u201392, Prague, Czech Republic, 1997. LNAI 1224, Springer-Verlag."},{"key":"33_CR4","first-page":"141","volume":"24","author":"P. Domingos","year":"1996","unstructured":"Pedro Domingos. Unifying instance-based and rule-based induction. Machine Learning, 24:141\u2013168, 1996.","journal-title":"Machine Learning"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Ron Kohavi and George H. John. Automatic parameter selection by minimizing estimated error. In Proc. of the Twelfth International Conference on Machine Learning, 1995. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-377-6.50045-1"},{"key":"33_CR6","unstructured":"C.J. Merz and P.M. Murphy. UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/\u2248mleaxn\/MLRepository.html, 1996."},{"key":"33_CR7","unstructured":"John Ross Quinlan. C4.5: Programs for machine learning. Series in machine learning. Morgan Kaufmann, 1993."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Ron Rymon. An SE-tree based characterization of the induction problem. In Proc. of the Tenth International Conference on Machine Learning, pages 268\u2013275, 1993.","DOI":"10.1016\/B978-1-55860-307-3.50041-1"},{"key":"33_CR9","unstructured":"Ron Rymon. SE-Learn home page. http:\/\/www.isp.pitt.edu\/\u2248rymon\/SE-Learn.html, 1996."},{"key":"33_CR10","unstructured":"Ron Rymon. SE-trees outperform decision trees in noisy domains. In Proc. of the Second International Conference on Knowledge Discovery in Databases, pages 331\u2013334, 1996. AAAI Press."},{"key":"33_CR11","first-page":"251","volume":"6","author":"S. Salzberg","year":"1991","unstructured":"Steven Salzberg. A nearest hyperrectangle learning method. Machine Learning, 6:251\u2013276, 1991.","journal-title":"Machine Learning"},{"key":"33_CR12","unstructured":"Mich\u00e8le Sebag. Delaying the choice of bias: A disjunctive version space approach. In Proc. of the Thirteenth International Conference on Machine Learning, pages 444\u2013452, 1996. Morgan Kaufmann."},{"key":"33_CR13","first-page":"5","volume":"19","author":"D. Wettschereck","year":"1995","unstructured":"Dietrich Wettschereck and Thomas G. Dietterich. An experimental comparison of the nearest-neighbor and nearest-hyperrectangle algorithms. Machine Learning, 19:5\u201327, 1995.","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:03:02Z","timestamp":1558256582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540644170","9783540697817"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0026697","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0026664","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}