Classification based on specific rules and inexact coverage

  • Authors:
  • Raudel Hernández-León;Jesús A. Carrasco-Ochoa;José Fco. Martínez-Trinidad;José Hernández-Palancar

  • Affiliations:
  • Advanced Technologies Application Center (CENATAV), Havana, Cuba;National Institute of Astrophysics, Optics and Electronics (INAOE), Puebla, Mexico;National Institute of Astrophysics, Optics and Electronics (INAOE), Puebla, Mexico;Advanced Technologies Application Center (CENATAV), Havana, Cuba

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 12.05

Visualization

Abstract

Association rule mining and classification are important tasks in data mining. Using association rules has proved to be a good approach for classification. In this paper, we propose an accurate classifier based on class association rules (CARs), called CAR-IC, which introduces a new pruning strategy for mining CARs, which allows building specific rules with high confidence. Moreover, we propose and prove three propositions that support the use of a confidence threshold for computing rules that avoids ambiguity at the classification stage. This paper also presents a new way for ordering the set of CARs based on rule size and confidence. Finally, we define a new coverage strategy, which reduces the number of non-covered unseen-transactions during the classification stage. Results over several datasets show that CAR-IC beats the best classifiers based on CARs reported in the literature.