A framework for incremental generation of closed itemsets

DOI10.1016/J.DAM.2007.08.004MaRDI QIDQ2478435zbMATH OpenOpenAlexFDO

Authors Rokia Missaoui, Robert Godin, 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

formal concept analysisfrequent closed itemsetsGalois latticesincremental data mining

Mathematics Subject Classification ID

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

Recommendations

• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• An incremental algorithm for mining frequent closed patterns
• scientific article; zbMATH DE number 2088043
• Distributed Computing - IWDC 2004
• An incremental approach to share-frequent itemsets mining

Cites work

• A framework for incremental generation of closed itemsets
• A partition-based approach towards constructing Galois (concept) lattices
• An incremental concept formation approach for learning from databases
• Computing iceberg concept lattices with Titanic
• Concept Lattices
• Conceptual Structures for Knowledge Creation and Communication
• Galois Connexions
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 2086380 (Why is no real title available?)
• scientific article; zbMATH DE number 1827093 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• scientific article; zbMATH DE number 3332577 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• On the Merge of Factor Canonical Bases

Cited in

(15)

• Maintaining discovered frequent itemsets: Cases for changeable database and support
• LCM from FCA point of view: a CbO-style algorithm with speed-up features
• Transformations of discrete closure systems
• A framework for incremental generation of closed itemsets
• A lattice-free concept lattice update algorithm
• An incremental algorithm for mining frequent closed patterns
• Constrained itemset mining on a sequence of incoming data blocks
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• An efficient approach for incremental mining fuzzy frequent itemsets with FP-tree
• scientific article; zbMATH DE number 2088043 (Why is no real title available?)
• Discovery of the D-basis in binary tables based on hypergraph dualization
• An incremental approach to share-frequent itemsets mining
• An efficient algorithm of mining frequent closed inter-transaction itemsets
• Fuzzy and rough formal concept analysis: a survey
• Constraint-Based Mining and Inductive Databases

Describes a project that uses

Uses Software

• CLOSET

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2478435)