Efficient closed pattern mining in strongly accessible set systems (extended abstract)

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationKnowledge Discovery in Database
Subtitle of host publicationPKDD 2007 - 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Proceedings
Place of PublicationCham Switzerland
PublisherSpringer
Pages382-389
Number of pages8
ISBN (Print)9783540749752
Publication statusPublished - 2007
Externally publishedYes
EventEuropean Conference on Principles and Practice of Knowledge Discovery in Databases 2007 - Warsaw, Poland
Duration: 17 Sep 200721 Sep 2007
Conference number: 11th
https://link.springer.com/book/10.1007/978-3-540-74976-9 (Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume4702
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceEuropean Conference on Principles and Practice of Knowledge Discovery in Databases 2007
Abbreviated titlePKDD 2007
Country/TerritoryPoland
CityWarsaw
Period17/09/0721/09/07
Internet address

Cite this