{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:39:51Z","timestamp":1777646391491,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2000,2]]},"abstract":"<jats:p>An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.<\/jats:p>","DOI":"10.3233\/fi-2000-41302","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:03:20Z","timestamp":1575324200000},"page":"295-299","source":"Crossref","is-referenced-by-count":23,"title":["On Algorithm for Constructing of Decision Trees with Minimal Depth"],"prefix":"10.1177","volume":"41","author":[{"given":"Mikhail","family":"Moshkov","sequence":"first","affiliation":[{"name":"Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. e-mail: moshkov@nnucnit.unn.ac.ru"}]},{"given":"Igor","family":"Chikalov","sequence":"additional","affiliation":[{"name":"Faculty of Computing Mathematics and Cybernetics of Nizhni Novgorod State University, 23, Gagarina Av., Nizhni Novgorod, 603600, Russia. e-mail: igor@nstl.nnov.ru"}]}],"member":"179","published-online":{"date-parts":[[2000,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2000-41302","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2000-41302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:35:05Z","timestamp":1777444505000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2000-41302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["10.3233\/FI-2000-41302"],"URL":"https:\/\/doi.org\/10.3233\/fi-2000-41302","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1,1]]}}}