On maximal frequent and minimal infrequent sets in binary matrices

DOI10.1023/A:1024605820527zbMath1038.68041OpenAlexW2169245654MaRDI QIDQ1404408

Endre Boros, Kazuhisa Makino, Leonid G. Khachiyan, Vladimir A. Gurvich

Publication date: 21 August 2003

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024605820527

zbMATH Keywords

transversalsdualizationdata miningindependent setshitting setsfrequent setsinfrequent sets

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Extended dualization: application to maximal pattern mining ⋮ Pairs Covered by a Sequence of Sets ⋮ On Dualization over Distributive Lattices ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Discovering all associations in discrete data using frequent minimally infrequent attribute sets ⋮ Efficient algorithms for dualizing large-scale hypergraphs ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Mining closed patterns in relational, graph and network data ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Effective approximation of parametrized closure systems over transactional data streams ⋮ An algebraic semigroup method for discovering maximal frequent itemsets