Generic Association Rule Bases: Are They so Succinct?
From MaRDI portal
Publication:5452425
Recommendations
Cites work
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 61569 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1943768 (Why is no real title available?)
- scientific article; zbMATH DE number 1882061 (Why is no real title available?)
- Computing iceberg concept lattices with Titanic
- Generating a condensed representation for association rules
- SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
- Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
Cited in
(10)- 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
- Generating a condensed representation for association rules
- Minimum-redundant and lossless association rule-set representation
- SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
- SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS
- scientific article; zbMATH DE number 1943768 (Why is no real title available?)
- scientific article; zbMATH DE number 2084833 (Why is no real title available?)
- Compact representations of sequential classification rules
This page was built for publication: Generic Association Rule Bases: Are They so Succinct?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452425)