The following pages link to CLOSET (Q38705):
Displaying 20 items.
- MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model (Q356030) (← links)
- A new algorithm for fast mining frequent itemsets using N-lists (Q362278) (← links)
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams (Q506760) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- Itemset mining: a constraint programming perspective (Q650527) (← links)
- RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams (Q872309) (← links)
- Top-down mining of frequent closed patterns from very high dimensional data (Q1007893) (← links)
- Maintaining discovered frequent itemsets: Cases for changeable database and support (Q1412151) (← links)
- Generating a condensed representation for association rules (Q1774512) (← links)
- A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← links)
- Fast and effective cluster-based information retrieval using frequent closed itemsets (Q2195391) (← links)
- Effective lossless condensed representation and discovery of spatial co-location patterns (Q2195433) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- A framework for incremental generation of closed itemsets (Q2478435) (← links)
- A novel algorithm for frequent itemset mining in data warehouses (Q2508121) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory (Q4409021) (← links)
- Hybrid ASP-based Approach to Pattern Mining (Q4957187) (← links)
- Association Rules Network: Definition and Applications (Q4969631) (← links)
