Generating a condensed representation for association rules
From MaRDI portal
Publication:1774512
DOI10.1007/s10844-005-0266-zzbMath1071.68022MaRDI QIDQ1774512
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Gerd Stumme, Lotfi Lakhal
Publication date: 17 May 2005
Published in: Journal of Intelligent Information Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10844-005-0266-z
generators; data mining; basis for association rules; condensed representation; frequent closed itemsets; Galois closure operator; min-max association rules
68P15: Database theory
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
Related Items
ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS, Closed-Set-Based Discovery of Representative Association Rules, Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions, Generic Association Rule Bases: Are They so Succinct?, Valuations and closure operators on finite lattices, Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset, The Agree Concept Lattice for Multidimensional Database Analysis, Abstract Concept Lattices
Uses Software
Cites Work