{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:09:35Z","timestamp":1760886575570},"reference-count":22,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":["Knowledge-Based Systems"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0950-7051(98)00036-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:51:28Z","timestamp":1027587088000},"page":"421-430","source":"Crossref","is-referenced-by-count":8,"title":["Constructing conjunctions using systematic search on decision trees"],"prefix":"10.1016","volume":"10","author":[{"given":"Zijian","family":"Zheng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0950-7051(98)00036-7_BIB1","article-title":"Feature construction: an analytic framework and an application to decision trees","author":"Matheus","year":"1989"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1022611825350","article-title":"Boolean feature discovery in empirical learning","volume":"5","author":"Pagallo","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB3","series-title":"Proceedings of the Fifth Australian Joint Conference on Artificial Intelligence","first-page":"355","article-title":"Constructing conjunctive tests for decision trees","author":"Zheng","year":"1992"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB4","series-title":"Proceedings of the Sixth Australian Joint Conference on Artificial Intelligence","first-page":"342","article-title":"Systematic search for categorical attribute-value data-driven machine learning","author":"Webb","year":"1993"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB5","article-title":"Adaptive decision tree algorithms for learning from examples","author":"Pagallo","year":"1990"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB6","series-title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","first-page":"699","article-title":"A scheme for feature construction and a comparison of empirical methods","author":"Yang","year":"1991"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB7","article-title":"Constructing new attributes for decision tree learning","author":"Zheng","year":"1996"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","article-title":"Inferring decision trees using the minimum description length principle","volume":"80","author":"Quinlan","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB9","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB10","series-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","first-page":"1064","article-title":"Constructing nominal X-of-N attributes","author":"Zheng","year":"1995"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB11","series-title":"UCI repository of machine learning databases","author":"Murphy","year":"1996"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB12","article-title":"The MONK's problems\u2014a performance comparison of different learning algorithms","author":"Thrun","year":"1991"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB13","series-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","first-page":"1019","article-title":"Oversearching and layered search in empirical learning","author":"Quinlan","year":"1995"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB14","series-title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","first-page":"645","article-title":"Constructive induction on decision trees","author":"Matheus","year":"1989"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB15","series-title":"Proceedings of the Tenth International Conference on Machine Learning","first-page":"252","article-title":"Lookahead feature construction for learning hard concepts","author":"Ragavan","year":"1993"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB16","series-title":"Proceedings of the Eighth International Workshop on Machine Learning","first-page":"183","article-title":"ID2-of-3: constructive induction of M-of-N concepts for discriminators in decision trees","author":"Murphy","year":"1991"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB17","article-title":"Multivariate versus univariate decision trees","author":"Brodley","year":"1992"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB18","series-title":"Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning","first-page":"539","article-title":"Search through systematic set enumeration","author":"Rymon","year":"1992"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB19","series-title":"Proceedings of the Tenth International Conference on Machine Learning","first-page":"268","article-title":"An SE-tree based characterisation of the induction problem","author":"Rymon","year":"1993"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB20","series-title":"Proceedings of the Tenth International Conference on Machine Learning","first-page":"284","article-title":"Efficiently inducing determinations: a complete and systematic search algorithm that uses optimal pruning","author":"Schlimmer","year":"1993"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB21","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","article-title":"OPUS: an efficient admissible algorithm for unordered search","volume":"3","author":"Webb","year":"1995","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S0950-7051(98)00036-7_BIB22","series-title":"Proceedings of the Nineteenth Australian Computer Science Conference","first-page":"1","article-title":"Inclusive pruning: a new class of pruning rule tin unordered search and its application to classification learning","volume":"Vol. 18","author":"Webb","year":"1996"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705198000367?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705198000367?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T08:29:34Z","timestamp":1578472174000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705198000367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0950705198000367"],"URL":"https:\/\/doi.org\/10.1016\/s0950-7051(98)00036-7","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}