Generic Association Rule Bases: Are They so Succinct?
From MaRDI portal
Publication:5452425
DOI10.1007/978-3-540-78921-5_13zbMath1133.68451WikidataQ62610144 ScholiaQ62610144MaRDI QIDQ5452425
Sadok Ben Yahia, Tarek Hamrouni, 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
Related Items
Cites Work
- Generating a condensed representation for association rules
- Computing iceberg concept lattices with Titanic
- SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
- Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item