{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:14:22Z","timestamp":1753737262302},"reference-count":22,"publisher":"Elsevier","isbn-type":[{"value":"9781558603073","type":"print"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1016\/b978-1-55860-307-3.50039-3","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T15:04:29Z","timestamp":1404140669000},"page":"252-259","source":"Crossref","is-referenced-by-count":21,"title":["Lookahead Feature Construction for Learning Hard Concepts"],"prefix":"10.1016","author":[{"given":"Harish","family":"Ragavan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Rendell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib1","series-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"issue":"4","key":"10.1016\/B978-1-55860-307-3.50039-3_bib2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00116835","article-title":"The CN2 induction algorithm","volume":"3","author":"Clark","year":"1989","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib3","series-title":"Pattern Recognition: A Statistical Approach","author":"Devijver","year":"1982"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib4","series-title":"Nonparametric Density Estimation: The L1 View","author":"Devroye","year":"1985"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176347963","article-title":"Multi-variate adaptive regression splines","volume":"19","author":"Friedman","year":"1991","journal-title":"Annals of Statistics"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","article-title":"Iterative broadening","volume":"55","author":"Ginsberg","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","article-title":"Quantifying inductive bias: AI learning algorithms and Valiant's learning framework","volume":"36","author":"Haussier","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib8","doi-asserted-by":"crossref","DOI":"10.1023\/A:1022631118932","article-title":"Very simple classification rules perform well on most datasets","author":"Holte","year":"1993","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib9","unstructured":"N. Indurkhya and S. M. Weiss. (1990) Iterative rule induction procedures. Technical Report LCSR\u2013TR\u2013145, Laboratory for Computer Science Research, Rutgers University, New Brunswick, NJ."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib10","unstructured":"G. Mehlsam. (1989) Automatisches Erzeugen von Klassifikationskriterien. PhD thesis, Technische Universitat Wien, Vienna, Austria."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib11","unstructured":"S. W. Norton. (1989) Generating better decision trees. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 800\u2013805."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib12","unstructured":"G. Pagallo. (1990) Adaptive Decision Tree Algorithms for Learning from Examples. PhD thesis, University of California at Santa Cruz."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib13","series-title":"Machine Learning: An Artificial Intelligence Approach","first-page":"463","article-title":"Learning efficient classification procedures and their application to chess end games","author":"Quinlan","year":"1983"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","article-title":"Inferring decision trees using the minimum description principle","volume":"80","author":"Quinlan","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib15","unstructured":"H. Ragavan, L. Rendell, M. Shaw, and A. Tessmer. (1993) Learning complex real-world concepts through feature construction. Technical report, Beckman Institute, University of Illinois, Urbana, IL. Short version in Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib16","unstructured":"L. A. Rendell and H. Ragavan. (1993) Improving the design of induction methods by analyzing algorithms functionality and data-based concept complexity. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993."},{"issue":"4","key":"10.1016\/B978-1-55860-307-3.50039-3_bib17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.1467-8640.1990.tb00298.x","article-title":"Learning hard concepts through constructive induction: Framework and rationale","volume":"6","author":"Rendell","year":"1990","journal-title":"Computational Intelligence"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib18","first-page":"318","article-title":"Learning internal representations by error propagation","volume":"volume 1","author":"Rumelhart","year":"1986"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib19","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","article-title":"A universal prior for integers and estimation by minimum description length","volume":"11","author":"Rissanen","year":"1983","journal-title":"Annals of Statistics"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00116895","article-title":"Incremental learning from noisy data","volume":"1","author":"Schlimmer","year":"1986","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib21","unstructured":"W. Van de Velde. (1990) Incremental induction of topologically minimal trees. In Proceedings of the Seventh International Workshop on Machine Learning, pages 66\u201374."},{"key":"10.1016\/B978-1-55860-307-3.50039-3_bib22","unstructured":"D-S. Yang, L. A. Rendell, and G. Blix. (1991) A scheme for feature construction and a comparison of empirical methods. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 699\u2013704."}],"container-title":["Machine Learning Proceedings 1993"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603073500393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603073500393?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T07:26:24Z","timestamp":1538465184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558603073500393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9781558603073"],"references-count":22,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-307-3.50039-3","relation":{},"subject":[],"published":{"date-parts":[[1993]]}}}