A framework for incremental generation of closed itemsets

DOI10.1016/j.dam.2007.08.004zbMath1142.68339OpenAlexW2092358235MaRDI QIDQ2478435

Robert Godin, Rokia Missaoui, Petko Valtchev

Publication date: 28 March 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.004

zbMATH Keywords

Galois latticesformal concept analysisfrequent closed itemsetsincremental data mining

Mathematics Subject Classification ID

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

Related Items (5)

Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Fuzzy and rough formal concept analysis: a survey ⋮ Transformations of discrete closure systems ⋮ A framework for incremental generation of closed itemsets ⋮ A lattice-free concept lattice update algorithm

Uses Software

• CLOSET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An incremental concept formation approach for learning from databases
• A partition-based approach towards constructing Galois (concept) lattices
• A framework for incremental generation of closed itemsets
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• Computing iceberg concept lattices with Titanic
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• On the Merge of Factor Canonical Bases
• Galois Connexions
• Conceptual Structures for Knowledge Creation and Communication
• Concept Lattices

This page was built for publication: A framework for incremental generation of closed itemsets