CLOSET

swMATH26986MaRDI QIDQ38705FDOQ38705

Author name not available (Why is that?)

Official website: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6266

Cited In (35)

• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• Association Rules Network: Definition and Applications
• Valuations and closure operators on finite lattices
• Itemset mining: a constraint programming perspective
• Maintaining discovered frequent itemsets: Cases for changeable database and support
• A practical approximation algorithm for optimal \(k\)-anonymity
• A novel algorithm for frequent itemset mining in data warehouses
• A framework for incremental generation of closed itemsets
• A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
• Mining closed patterns in relational, graph and network data
• Top-down mining of frequent closed patterns from very high dimensional data
• RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams
• Generating a condensed representation for association rules
• Hybrid ASP-based approach to pattern mining
• DMTL
• SPADE
• FooCA
• gSpan
• MiningZinc
• PrefixSpan
• Carpenter
• COBBLER
• MAX-FISM
• CMAR
• MotifMiner
• Fast and effective cluster-based information retrieval using frequent closed itemsets
• MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model
• CloseGraph
• CloSpan
• BIDE
• LCM
• Computational aspects of mining maximal frequent patterns
• A new algorithm for fast mining frequent itemsets using N-lists
• CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
• Effective lossless condensed representation and discovery of spatial co-location patterns

This page was built for software: CLOSET