Title
Comparing the computational complexity and accuracy of classification algorithms
Abstract
Decision trees have been widely used for classification in Data mining. Number of decision tree algorithms has been developed in the past. In order to reduce the computational time the On Improving the efficiency of SLIQ (OIESLIQ) algorithm has been developed with an aim to reduce diversity of the decision tree at each split. In order to improve the accuracy, the paper proposes a novel approach (Pioneer classifier algorithm) to embark upon the other two algorithms.
Year
DOI
Venue
2010
10.1145/1741906.1742021
ICWET
Keywords
Field
DocType
decision tree algorithm,novel approach,data mining,computational time,classification algorithm,decision tree,pioneer classifier algorithm,computational complexity,decision trees,classification
Data mining,Decision tree,Computer science,Classification Tree Method,Decision tree model,Probabilistic analysis of algorithms,C4.5 algorithm,Artificial intelligence,ID3 algorithm,Decision tree learning,Machine learning,Incremental decision tree
Conference
Citations 
PageRank 
References 
0
0.34
3
Authors
3
Name
Order
Citations
PageRank
S. Beatrice100.34
R. Thirumahal200.34
S. P. Raja3126.67