{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T17:09:58Z","timestamp":1782580198247,"version":"3.54.5"},"reference-count":21,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we consider decision trees that use both conventional queries based on one attribute each and queries based on hypotheses of values of all attributes. Such decision trees are similar to those studied in exact learning, where membership and equivalence queries are allowed. We present greedy algorithm based on entropy for the construction of the above decision trees and discuss the results of computer experiments on various data sets and randomly generated Boolean functions.<\/jats:p>","DOI":"10.3390\/e23070808","type":"journal-article","created":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T04:46:57Z","timestamp":1624596417000},"page":"808","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9851-1420","authenticated-orcid":false,"given":"Mohammad","family":"Azad","sequence":"first","affiliation":[{"name":"Department of Computer Science, College of Computer and Information Sciences, Jouf University, Sakaka 72441, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1010-6605","authenticated-orcid":false,"given":"Igor","family":"Chikalov","sequence":"additional","affiliation":[{"name":"Intel Corporation, 5000 W Chandler Blvd, Chandler, AZ 85226, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1698-2809","authenticated-orcid":false,"given":"Shahid","family":"Hussain","sequence":"additional","affiliation":[{"name":"Computer Science Program, Dhanani School of Science and Engineering, Habib University, Karachi 75290, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0085-9483","authenticated-orcid":false,"given":"Mikhail","family":"Moshkov","sequence":"additional","affiliation":[{"name":"Computer, Electrical and Mathematical Sciences & Engineering Division, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,25]]},"reference":[{"key":"ref_1","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. (1984). Classification and Regression Trees, Chapman and Hall\/CRC."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/11427834_12","article-title":"Time complexity of decision trees","volume":"Volume 3400","author":"Peters","year":"2005","journal-title":"Transactions on Rough Sets III"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Rokach, L., and Maimon, O. (2007). Data Mining with Decision Trees\u2014Theory and Applications, World Scientific.","DOI":"10.1142\/9789812771728"},{"key":"ref_4","first-page":"341","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Parallel Program."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Pawlak, Z. (1991). Rough Sets\u2014Theoretical Aspects of Reasoning about Data, Kluwer.","DOI":"10.1007\/978-94-011-3534-4"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","article-title":"Rudiments of rough sets","volume":"177","author":"Pawlak","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_7","first-page":"270","article-title":"Logical methods of control of work of electric schemes","volume":"51","author":"Chegis","year":"1958","journal-title":"Trudy Mat. Inst. Steklov"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learn."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.tcs.2003.11.004","article-title":"Queries revisited","volume":"313","author":"Angluin","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., and Moshkov, M. (2019). Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, Springer. Intelligent Systems Reference Library.","DOI":"10.1007\/978-3-319-91839-6"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Aglin, G., Nijssen, S., and Schaus, P. (2020, January 7\u201312). Learning optimal decision trees using caching branch-and-bound search. Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA.","DOI":"10.1609\/aaai.v34i04.5711"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Alsolami, F., Azad, M., Chikalov, I., and Moshkov, M. (2020). Decision and Inhibitory Trees and Rules for Decision Tables with Many-Valued Decisions, Springer. Intelligent Systems Reference Library.","DOI":"10.1007\/978-3-030-12854-8"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Ignatiev, A., Pereira, F., and Marques-Silva, J. (2018, January 13\u201319). Learning optimal decision trees with SAT. Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden.","DOI":"10.24963\/ijcai.2018\/189"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Verwer, S., and Zhang, Y. (February, January 27). Learning optimal classification trees using a binary linear program formulation. Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, HI, USA.","DOI":"10.1609\/aaai.v33i01.33011624"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Azad, M., Chikalov, I., Hussain, S., and Moshkov, M. (2021, January 19\u201324). Minimizing depth of decision trees with hypotheses (to appear). Proceedings of the International Joint Conference on Rough Sets (IJCRS 2021), Bratislava, Slovakia.","DOI":"10.1007\/978-3-030-87334-9_11"},{"key":"ref_17","unstructured":"Azad, M., Chikalov, I., Hussain, S., and Moshkov, M. (2021, January 8\u201310). Minimizing number of nodes in decision trees with hypotheses (to appear). Proceedings of the 25th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (KES 2021), Szczecin, Poland."},{"key":"ref_18","unstructured":"Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann."},{"key":"ref_19","unstructured":"Dua, D., and Graff, C. (2017, April 12). UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_20","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_21","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/TSMCC.2004.843247","article-title":"Top-down induction of decision trees classifiers\u2014A survey","volume":"35","author":"Rokach","year":"2005","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/808\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:23:41Z","timestamp":1760163821000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,25]]},"references-count":21,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["e23070808"],"URL":"https:\/\/doi.org\/10.3390\/e23070808","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,25]]}}}