Generic Association Rule Bases: Are They so Succinct?
From MaRDI portal
Publication:5452425
DOI10.1007/978-3-540-78921-5_13zbMATH Open1133.68451OpenAlexW1557160334WikidataQ62610144 ScholiaQ62610144MaRDI QIDQ5452425FDOQ5452425
Authors: Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo 
Publication date: 4 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78921-5_13
Recommendations
Cites Work
- SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing iceberg concept lattices with Titanic
- Generating a condensed representation for association rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
