A data mining formalization to improve hypergraph minimal transversal computation

MaRDI QIDQ5431930zbMATH OpenFDO

Authors Céline Hébert, Alain Bretto, Bruno Crémilleux

Publication date 2 January 2008

zbMATH Keywords

condensed representationsdatamininghypergraphminimal transversalslevelwise framework

Mathematics Subject Classification ID

Hypergraphs (05C65) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Computing and Combinatorics
• Foundations of Information and Knowledge Systems
• A global parallel algorithm for the hypergraph transversal problem
• Frequent Hypergraph Mining
• An Efficient Algorithm for the Transversal Hypergraph Generation

Cited in

(12)

• Combinatorial optimization in system configuration design
• An average study of hypergraphs and their minimal transversals
• Efficient algorithms for dualizing large-scale hypergraphs
• Applying a hypergraph to determine the structure of some finite modules
• The minimal hitting set generation problem: algorithms and computation
• Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining
• Discovery of the D-basis in binary tables based on hypergraph dualization
• Frequent Hypergraph Mining
• Studying some semisimple modules via hypergraphs
• Exploring some modules through inclusion hypergraphs
• On the average-case complexity of Berge algorithm
• A hypergraph on modules and singularity condition

This page was built for publication: A data mining formalization to improve hypergraph minimal transversal computation

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