Generic Association Rule Bases: Are They so Succinct?

DOI10.1007/978-3-540-78921-5_13zbMATH Open1133.68451OpenAlexW1557160334WikidataQ62610144 ScholiaQ62610144MaRDI QIDQ5452425FDOQ5452425

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
• Computing iceberg concept lattices with Titanic
• Generating a condensed representation for association rules
• Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions

Cited In (1)

• Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions

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)