Optimizing hypergraph transversal computation with an anti-monotone constraint

Authors:
Céline Hébert;Alain Bretto;Bruno Crémilleux
Affiliations:
Université de Caen, Caen Cédex France;Université de Caen, Caen Cédex France;Université de Caen, Caen Cédex France
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 5
Cited 1

On the complexity of dualization of monotone disjunctive normal forms

Journal of Algorithms
Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries

Data Mining and Knowledge Discovery
Discovering all most specific sentences

ACM Transactions on Database Systems (TODS)
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining

Mining uncertain data for frequent itemsets that satisfy aggregate constraints

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding hypergraph transversals is a major algorithmic issue having many relationships with the data mining area. By defining a new Galois connection, we show how it is possible to use data mining results on pattern condensed representations and the levelwise framework to improve the hypergraph transversals computation. We present a new algorithm MTMINER and experiments showing its efficiency.