Generating a condensed representation for association rules

DOI10.1007/s10844-005-0266-zzbMath1071.68022OpenAlexW1997309399MaRDI 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

zbMATH Keywords

generatorsdata miningbasis for association rulescondensed representationfrequent closed itemsetsGalois closure operatormin-max association rules

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (8)

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 ⋮ ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS ⋮ Valuations and closure operators on finite lattices ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Generic Association Rule Bases: Are They so Succinct? ⋮ Closed-Set-Based Discovery of Representative Association Rules

Uses Software

• UCI-ml
• CLOSET

Cites Work

• CLOSET
• Minimum Covers in Relational Database Model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating a condensed representation for association rules