Back to Search
Start Over
A Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions - A Comparative Study.
- Source :
-
Fundamenta Informaticae . 2013, Vol. 128 Issue 1, p1-15. 15p. - Publication Year :
- 2013
-
Abstract
- In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01692968
- Volume :
- 128
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Fundamenta Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 92009883
- Full Text :
- https://doi.org/10.3233/FI-2013-929