TY - GEN
T1 - Efficient closed pattern mining in strongly accessible set systems (extended abstract)
AU - Boley, Mario
AU - Horváth, Tamás
AU - Poigné, Axel
AU - Wrobel, Stefan
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38049162234&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74976-9_37
DO - 10.1007/978-3-540-74976-9_37
M3 - Conference contribution
AN - SCOPUS:38049162234
SN - 9783540749752
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 382
EP - 389
BT - Knowledge Discovery in Database
PB - Springer Verlag
T2 - 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2007
Y2 - 17 September 2007 through 21 September 2007
ER -