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

DOI10.1007/978-3-540-78921-5_5zbMath1133.68450OpenAlexW1523526897WikidataQ62610148 ScholiaQ62610148MaRDI QIDQ5452415

Sadok Ben Yahia, Engelbert Mephu Nguifo, Tarek Hamrouni

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_5

Mathematics Subject Classification ID

Knowledge representation (68T30) Lattices (06B99)

Related Items (1)

Generic Association Rule Bases: Are They so Succinct?

Cites Work

• Generating a condensed representation for association rules
• Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
• Computing iceberg concept lattices with Titanic
• Generic Association Rule Bases: Are They so Succinct?
• Formal Concept Analysis
• Constraint-Based Mining and Inductive Databases
• Formal Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions