Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract)

Authors:
Mario Boley;Tamás Horváth;Axel Poigné;Stefan Wrobel
Affiliations:
Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany;Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany;Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany;Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany and Dept. of Computer Science, University of Bonn, Germany
Venue:
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2007

Citing 4
Cited 2

On generating all maximal independent sets

Information Processing Letters
Efficient mining of association rules using closed itemset lattices

Information Systems
Efficient algorithms on distributive lattices

Discrete Applied Mathematics
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices

Annals of Mathematics and Artificial Intelligence

Integrating constraint programming and itemset mining

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Flexible and efficient distributed resolution of large entities

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems in data mining can be viewed as a special case of the problem of enumerating the closed elements of an independence system with respect to some specific closure operator. Motivated by real-world applications, e.g., in track mining, we consider a generalization of this problem to strongly accessible set systems and arbitrary closure operators. For this more general problem setting, the closed sets can be enumerated with polynomial delay if deciding membership in the set system and computing the closure operator can be solved in polynomial time. We discuss potential applications in graph mining.