Comparison of rule induction, decision trees and formal concept analysis approaches for classification
2018; IOP Publishing; Volume: 1015; Linguagem: Inglês
10.1088/1742-6596/1015/3/032068
ISSN1742-6596
AutoresEvgeny Kotelnikov, Vladimir Milov,
Tópico(s)Statistical and Computational Modeling
ResumoRule-based learning algorithms have higher transparency and easiness to interpret in comparison with neural networks and deep learning algorithms. These properties make it possible to effectively use such algorithms to solve descriptive tasks of data mining. The choice of an algorithm depends also on its ability to solve predictive tasks. The article compares the quality of the solution of the problems with binary and multiclass classification based on the experiments with six datasets from the UCI Machine Learning Repository. The authors investigate three algorithms: Ripper (rule induction), C4.5 (decision trees), In-Close (formal concept analysis). The results of the experiments show that In-Close demonstrates the best quality of classification in comparison with Ripper and C4.5, however the latter two generate more compact rule sets.
Referência(s)