[:es]Lazcorreta Puigmartí, E. (Universidad Miguel Hernández); Botella, F. (Universidad Miguel Hernández); Fernández-Caballero, A (Universidad Castilla- La Mancha)
Abstract: This paper introduces a novel proposal to discover the best associative classification rules through studying the influence of the attributes used in robust catalogues. Notice that a catalogue is defined as a dataset free of duplicate records. Moreover, a robust catalogue is obtained when incomplete records and those with uncertainty are eliminated from a catalogue. Therefore, a robust catalogue is a collection of association rules with 100% confidence and unitary support. In this paper we demonstrate that robust catalogues contain the same association rules as the datasets from which they were obtained, but can be managed in memory without eliminating any data from the analysis. In fact, the experiments performed show that all robust catalogues contained in a classification dataset are easily obtained, providing millions of associative classification rules with 100% confidence to the expert researcher in data mining. © 2017 Elsevier Ltd[:]


Deja una respuesta

Avatar placeholder

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *