Concise representations of association rules

DOI10.1007/3-540-45728-3_8MaRDI QIDQ4409792zbMATH OpenFDO

Authors Marzena Kryszkiewicz

Publication date 1 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2447/24470092.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10) Knowledge representation (68T30) Computing methodologies and applications (68U99)

Recommendations

• Generic Association Rule Bases: Are They so Succinct?
• Minimum-redundant and lossless association rule-set representation
• Generating a condensed representation for association rules
• scientific article; zbMATH DE number 2033349
• Closed-Set-Based Discovery of Representative Association Rules

Cited in

(12)

• A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
• Generalization of association rules through disjunction
• Direct and incremental computing of maximal covering rules
• Minimum-redundant and lossless association rule-set representation
• Compact representations of sequential classification rules
• Intelligent structuring and reducing of association rules with formal concept analysis
• Closed Association Rules
• Closed-Set-Based Discovery of Representative Association Rules
• Measuring the implications of the D-basis in analysis of data in biomedical studies
• Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
• Generic Association Rule Bases: Are They so Succinct?
• Generalized disjunction-free representation of frequent patterns with negation

This page was built for publication: Concise representations of association rules

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