Generating a condensed representation for association rules

DOI10.1007/S10844-005-0266-ZMaRDI QIDQ1774512zbMATH OpenOpenAlexFDO

Authors Nicolas Pasquier, Rafik Taouil, Yves Bastide, 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

data mininggeneratorsbasis 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)

Recommendations

• scientific article; zbMATH DE number 1696848
• scientific article; zbMATH DE number 2033349
• Generic Association Rule Bases: Are They so Succinct?
• Closed Association Rules
• scientific article; zbMATH DE number 1696739

Cites work

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 61569 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• CLOSET
• Minimum Covers in Relational Database Model

Cited in

(21)

• scientific article; zbMATH DE number 2033349 (Why is no real title available?)
• Closed-Set-Based Discovery of Representative Association Rules
• scientific article; zbMATH DE number 2096810 (Why is no real title available?)
• Valuations and closure operators on finite lattices
• scientific article; zbMATH DE number 1977834 (Why is no real title available?)
• Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
• Extracting compact and information lossless sets of fuzzy association rules
• Redundancy, deduction schemes, and minimum-size bases for association rules
• Generic Association Rule Bases: Are They so Succinct?
• ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS
• Minimum-redundant and lossless association rule-set representation
• Database Support for Data Mining Applications
• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• scientific article; zbMATH DE number 1696739 (Why is no real title available?)
• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS
• Extracting attribute implications from a formal context: unifying the basic approaches
• The agree concept lattice for multidimensional database analysis
• scientific article; zbMATH DE number 1943768 (Why is no real title available?)
• scientific article; zbMATH DE number 2084833 (Why is no real title available?)
• Abstract concept lattices

Describes a project that uses

Uses Software

• CLOSET
• UCI

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774512)