On algorithm for constructing of decision trees with minimal depth

• Autorzy: Moshkov M. , Chikalov I.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

decision tree; algorithm

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 41, Nr 3
• Strony: 295--299
• Opis fizyczny: bibliogr. 8 poz.

Twórcy

autor

Moshkov M.

autor

Chikalov I.

• Faculty of Computing Mathematics and Cybernetics of Nizhni Novgorod State University, 23, Gagarina Av., Nizhni Novgorod, 603600, Russia,