On algorithm for constructing of decision trees with minimal number of nodes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2005, Issue , 2001, Pages 139-143

  Chikalov, Igor ^a  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DECISION TREES; POLYNOMIAL APPROXIMATION; ROUGH SET THEORY; TREES (MATHEMATICS);

POLYNOMIAL TIME COMPLEXITY;

DECISION TABLES;

EID: 84957794351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45554-X_16     Document Type: Conference Paper

References (10)

1. Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR 51 (1958) 270–360 (in Russian)
2. Chikalov, I.V.: Algorithm for constructing of decision trees with minimal average depth. Proceedings of The 8th Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems 1. July 3-7, Madrid, Spain (2000) 376–379
3. Markov, Al.A.: Circuit complexity of discrete optimization. Diskretnaya Matematika 4(3) (1992) 29–46 (in Russian)
4. Morzhakov, N.M.: On relationship between complexity of a set description and complexity of problem of linear form minimization on this set. Kombinatornoalgebraicheskiye Metody v Prikladnoi Matematike. Gorky University Publishers, Gorky (1985) 83–98 (in Russian)
5. Morzhakov, N.M.: On complexity of discrete extremal problem solving in the class of circuit algorithms. Matematicheskie Voprosi Kybernetiki 6. Nauka, Moscow (1996) 215–238 (in Russian)
6. Moshkov, M.Ju.: On problem of linear form minimization on finite set. Kombinatorno-algebraicheskiye Metody v Prikladnoi Matematike. Gorky University Publishers, Gorky (1985) 98–119 (in Russian)
7. Moshkov, M.Ju., Chkalov, I.V.: On efficient algorithms for conditional test constructing. Proceedings of the Twelfth International Conference”Problems of Theoretical Cybernetics” 2. Nizhni Novgorod, Russia (1999) 165 (in Russian)
8. Moshkov, M.Ju, Chikalov I.V.: On algorithm for constructing of decision trees with minimal depth. Fundamenta Informaticae 41(3) (2000) 295–299
9. Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, Boston, London (1991)
10. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Edited by R. Slowinski. Kluwer Academic Publishers, Dordrecht, Boston, London (1992) 331–362