On maximal frequent and minimal infrequent sets in binary matrices
From MaRDI portal
Recommendations
Cited in
(18)- An algebraic semigroup method for discovering maximal frequent itemsets
- Maximal frequent sets
- Efficient algorithms for dualizing large-scale hypergraphs
- Mining closed patterns in relational, graph and network data
- Extended dualization: application to maximal pattern mining
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- Achieving new upper bounds for the hypergraph duality problem through logic
- Maximal closed set and half-space separations in finite closure systems
- Finding All Minimal Infrequent Multi-dimensional Intervals
- On Dualization over Distributive Lattices
- Resolution based algorithms for the transversal hypergraph generation problem
- Computational aspects of monotone dualization: a brief survey
- Effective approximation of parametrized closure systems over transactional data streams
- The minimal hitting set generation problem: algorithms and computation
- Medical surveillance, frequent sets, and closure operations
- scientific article; zbMATH DE number 2086380 (Why is no real title available?)
- Scientific contributions of Leo Khachiyan (a short overview)
- Pairs Covered by a Sequence of Sets
This page was built for publication: On maximal frequent and minimal infrequent sets in binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404408)
