Classification based on specific rules and inexact coverage

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...

Descripción completa

Detalles Bibliográficos
Autores: RAUDEL HERNANDEZ LEON, Jesús Ariel Carrasco Ochoa, José Francisco Martínez Trinidad
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2012
País:México
Institución:Instituto Nacional de Astrofísica, Óptica y Electrónica
Repositorio:Repositorio Institucional del INAOE
Idioma:inglés
OAI Identifier:oai:inaoe.repositorioinstitucional.mx:1009/1842
Acceso en línea:http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1842
Access Level:acceso abierto
Palabra clave:info:eu-repo/classification/Data mining/Data mining
info:eu-repo/classification/Supervised classification/Supervised classification
info:eu-repo/classification/Class association rules/Class association rules
info:eu-repo/classification/Association rule mining/Association rule mining
info:eu-repo/classification/cti/1
info:eu-repo/classification/cti/12
info:eu-repo/classification/cti/1203
Descripción
Sumario: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.