To access the full text documents, please follow this link: http://hdl.handle.net/2117/16907

Closed-set-based discovery of representative association rules revisited
Balcázar Navarro, José Luis; Tirnauca, Cristina
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350–359) for mining representative rules. We show that its output is sometimes incomplete, due to an oversight in its mathematical validation, and we propose an alternative complete generator that works within only slightly larger running times.
Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació
Data minig
Mineria de dades
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/submittedVersion
info:eu-repo/semantics/conferenceObject
Hermann Éditions
         

Show full item record

Related documents

Other documents of the same author

Balcázar Navarro, José Luis; Tirnauca, Cristina
Balcázar Navarro, José Luis; Tirnauca, Cristina; Zorrilla Pantaleón, Marta Elena
Balcázar Navarro, José Luis
Balcázar Navarro, José Luis; García Sáiz, Diego; de la Dehesa, Javier
García Sáiz, Diego; Zorrilla Pantaleón, Marta Elena; Balcázar Navarro, José Luis
 

Coordination

 

Supporters