Associative classification is becoming a promising alternative to classical machine learning algorithms. It is a hybrid technique that combines supervised and unsupervised data mining algorithms and builds classifiers from association rules' models. The aim of this work is to apply these associative classifiers to improve estimation precision in the project management area where data sparsity involves a major drawback. Moreover, in this application domain, most of the attributes are continuous; therefore, they must be discretized before generating the rules. The discretization procedure has a significant effect on the quality of the induced rules as well as on the precision of the classifiers built from them. In this paper, a multivariate supervised discretization method is proposed, which takes into account the predictive purpose of the association rules. © 2010 Springer-Verlag.
CITATION STYLE
García, M. N. M., Lucas, J. P., Batista, V. F. L., & Martín, M. J. P. (2010). Multivariate discretization for associative classification in a sparse data application domain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6076 LNAI, pp. 104–111). https://doi.org/10.1007/978-3-642-13769-3_13
Mendeley helps you to discover research relevant for your work.