{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:38:03Z","timestamp":1760236683878,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T00:00:00Z","timestamp":1639440000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>A new two-stage method for the construction of a decision tree is developed. The first stage is based on the definition of a minimum query set, which is the smallest set of attribute-value pairs for which any two objects can be distinguished. To obtain this set, an appropriate linear programming model is proposed. The queries from this set are building blocks of the second stage in which we try to find an optimal decision tree using a genetic algorithm. In a series of experiments, we show that for some databases, our approach should be considered as an alternative method to classical ones (CART, C4.5) and other heuristic approaches in terms of classification quality.<\/jats:p>","DOI":"10.3390\/e23121682","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T22:06:10Z","timestamp":1639519570000},"page":"1682","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minimum Query Set for Decision Tree Construction"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3191-9151","authenticated-orcid":false,"given":"Wojciech","family":"Wieczorek","sequence":"first","affiliation":[{"name":"Department of Computer Science and Automatics, University of Bielsko-Biala, Willowa 2, 43-309 Bielsko-Bia\u0142a, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2128-6998","authenticated-orcid":false,"given":"Jan","family":"Kozak","sequence":"additional","affiliation":[{"name":"Department of Machine Learning, University of Economics in Katowice, 1 Maja 50, 40-287 Katowice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1074-2847","authenticated-orcid":false,"given":"\u0141ukasz","family":"Str\u0105k","sequence":"additional","affiliation":[{"name":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8304-5746","authenticated-orcid":false,"given":"Arkadiusz","family":"Nowakowski","sequence":"additional","affiliation":[{"name":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,12,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Kubat, M. (2017). An Introduction to Machine Learning, Springer.","DOI":"10.1007\/978-3-319-63913-0"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10462-011-9272-4","article-title":"Decision trees: A recent overview","volume":"39","author":"Kotsiantis","year":"2013","journal-title":"Artif. Intell. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Learn."},{"key":"ref_4","unstructured":"Quinlan, J.R. (2014). C4.5: Programs for Machine Learning, Elsevier."},{"key":"ref_5","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. (1984). Classification and Regression Trees, Elsevier."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TSMCC.2011.2157494","article-title":"A Survey of Evolutionary Algorithms for Decision-Tree Induction","volume":"42","author":"Barros","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kozak, J. (2019). Ant Colony Decision Forest Approach. Decision Tree and Ensemble Learning Based on Ant Colony Optimization, Springer.","DOI":"10.1007\/978-3-319-93752-6"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Saeed, K., and Sn\u00e1\u0161el, V. (2014). Evolutionary Algorithm for Decision Tree Induction. Computer Information Systems and Industrial Management, Springer.","DOI":"10.1007\/978-3-662-45237-0"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ins.2016.08.051","article-title":"Collective data mining in the ant colony decision tree approach","volume":"372","author":"Kozak","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Japkowicz, N., and Shah, M. (2011). Evaluating Learning Algorithms: A Classification Perspective, Cambridge University Press.","DOI":"10.1017\/CBO9780511921803"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","article-title":"Top 10 algorithms in data mining","volume":"14","author":"Wu","year":"2008","journal-title":"Knowl. Inf. Syst."},{"key":"ref_12","first-page":"13","article-title":"A comparative study of decision tree ID3 and C4.5","volume":"4","author":"Hssina","year":"2014","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/11527503_34","article-title":"A Novel Data Mining Method Based on Ant Colony Algorithm","volume":"Volume 3584","author":"Li","year":"2005","journal-title":"Advanced Data Mining and Applications"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant Colony Optimization\u2014Artificial Ants as a Computational Intelligence Technique","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_16","unstructured":"Timofeev, R. (2004). Classification and Regression Trees (CART) Theory and Applications. [Master\u2019s Thesis, Humboldt University]."},{"key":"ref_17","unstructured":"Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Salhi, S. (2017). Heuristic Search: The Emerging Science of Problem Solving, Springer International Publishing.","DOI":"10.1007\/978-3-319-49355-8"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2011.02.016","article-title":"A large population size can be unhelpful in evolutionary algorithms","volume":"436","author":"Chen","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs, Springer.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Lozano, J.A., Mendiburu, A., and Hernando, L. (2018). Handbook of Heuristics, Springer International Publishing. Chapter Multi-Start Methods.","DOI":"10.1007\/978-3-319-07124-4_1"},{"key":"ref_22","unstructured":"Schrijver, A. (1998). Theory of Linear and Integer Programming, John Wiley & Sons."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","article-title":"The use of ranks to avoid the assumption of normality implicit in the analysis of variance","volume":"32","author":"Friedman","year":"1937","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kanji, G.K. (2006). 100 Statistical Tests, Sage.","DOI":"10.4135\/9781849208499"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/12\/1682\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:48:07Z","timestamp":1760168887000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/12\/1682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,14]]},"references-count":24,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["e23121682"],"URL":"https:\/\/doi.org\/10.3390\/e23121682","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,12,14]]}}}