Efficient closed pattern mining in strongly accessible set systems

Abstract. Many problems in data mining can be viewed as a special case of the problem of enumerating the closed elements of an indepen-dence system with respect to some specific closure operator. Motivated by real-world applications, e.g., in track mining, we consider a general-ization 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 polyno-mial time. We discuss potential applications in graph mining. 1