Pages that link to "Item:Q1404408"
From MaRDI portal
The following pages link to On maximal frequent and minimal infrequent sets in binary matrices (Q1404408):
Displaying 16 items.
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets (Q444438) (← links)
- Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- On frequent sets of Boolean matrices (Q1286408) (← links)
- An algebraic semigroup method for discovering maximal frequent itemsets (Q2111834) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- Extended dualization: application to maximal pattern mining (Q2634673) (← links)
- Maximal frequent sets (Q2914816) (← links)
- Pairs Covered by a Sequence of Sets (Q2947882) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- On Dualization over Distributive Lattices (Q6045449) (← links)
- Maximal closed set and half-space separations in finite closure systems (Q6093588) (← links)
