Multivariate discretization for associative classification in a sparse data application domain

  • Authors:
  • María N. Moreno García;Joel Pinho Lucas;Vivian F. López Batista;M. José Polo Martín

  • Affiliations:
  • Department of Computing and Automatic, University of Salamanca, Salamanca, Spain;Department of Computing and Automatic, University of Salamanca, Salamanca, Spain;Department of Computing and Automatic, University of Salamanca, Salamanca, Spain;Department of Computing and Automatic, University of Salamanca, Salamanca, Spain

  • Venue:
  • HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.