A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation

Authors:
Céline Hébert;Alain Bretto;Bruno Crémilleux
Affiliations:
Department of Informatics, University of Caen, France. E-mail: {celine.hebert,alain.bretto, bruno.cremilleux}@info.unicaen.fr;Department of Informatics, University of Caen, France. E-mail: {celine.hebert,alain.bretto, bruno.cremilleux}@info.unicaen.fr;Department of Informatics, University of Caen, France. E-mail: {celine.hebert,alain.bretto, bruno.cremilleux}@info.unicaen.fr
Venue:
Fundamenta Informaticae
Year:
2007

Citing 14
Cited 5

On the complexity of dualization of monotone disjunctive normal forms

Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science
Levelwise Search and Borders of Theories in KnowledgeDiscovery

Data Mining and Knowledge Discovery
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries

Data Mining and Knowledge Discovery
Hypergraph Transversal Computation and Related Problems in Logic and AI

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Discovering all most specific sentences

ACM Transactions on Database Systems (TODS)
A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Exact algorithms for finding minimum transversals in rank-3 hypergraphs

Journal of Algorithms
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Condensed representation of EPs and patterns quantified by frequency-based measures

KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Visualizing transactional data with multiple clusterings for knowledge discovery

ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
A new algorithm for the hypergraph transversal problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Mining frequent δ-free patterns in large databases

DS'05 Proceedings of the 8th international conference on Discovery Science

Combinatorial optimization in system configuration design

Automation and Remote Control
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets

Data & Knowledge Engineering
Hypergraph Cuts & Unsupervised Representation for Image Segmentation

Fundamenta Informaticae
Toward a fair review-management system

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Estimating entity importance via counting set covers

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding hypergraph transversals is a major algorithmic issue which was shown having many connections with the data mining area. In this paper, by defining a new Galois connection, we show that this problem is closely related to the mining of the so-called condensed representations of frequent patterns. This data mining formalization enables us to benefit from efficient algorithms dedicated to the extraction of condensed representations. More precisely, we demonstrate how it is possible to use the levelwise framework to improve the hypergraphminimal transversal computation by exploiting an anti-monotone constraint to safely prune the search space. We propose a new algorithm MTMINER to extract minimal transversals and provide experiments showing that our method is efficient in practice.