scientific article; zbMATH DE number 2086380

MaRDI QIDQ4736834zbMATH OpenFDO

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

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850133.htm

zbMATH Keywords

data miningdualizationfrequent setshitting setsindependent setsinfrequent setstransversals

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On maximal frequent and minimal infrequent sets in binary matrices
• On frequent sets of Boolean matrices
• Finding All Minimal Infrequent Multi-dimensional Intervals
• Computational aspects of mining maximal frequent patterns
• Maximal frequent sets

Cited in

(22)

• On frequent sets of Boolean matrices
• On maximal frequent and minimal infrequent sets in binary matrices
• An inequality for polymatroid functions and its applications.
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• Dual-bounded generating problems: Weighted transversals of a hypergraph
• On the complexity of inducing categorical and quantitative association rules
• The complexity of satisfying constraints on databases of transactions
• A framework for incremental generation of closed itemsets
• Itemset frequency satisfiability: complexity and axiomatization
• Computational aspects of mining maximal frequent patterns
• The minimal hitting set generation problem: algorithms and computation
• Finding All Minimal Infrequent Multi-dimensional Intervals
• Generating dual-bounded hypergraphs
• Discovering all associations in discrete data using frequent minimally infrequent attribute sets
• Achieving new upper bounds for the hypergraph duality problem through logic
• Discovery of the D-basis in binary tables based on hypergraph dualization
• Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Scientific contributions of Leo Khachiyan (a short overview)
• Self-duality of bounded monotone Boolean functions and related problems
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736834)