Home 9 Publications 9 Effective Approximation of Parametrized Closure Systems over Transactional Data Streams

Effective Approximation of Parametrized Closure Systems over Transactional Data Streams

Author: D. Trabold, T. Horvath, S. Wrobel
Journal: Machine Learning
Year: 2019

Citation information

D. Trabold, T. Horvath, S. Wrobel,
Machine Learning,
2019,
109,
1147-1177,
June,
https://doi.org/10.1007/s10994-019-05827-w

Strongly closed itemsets, defined by a parameterized closure operator, are a generalization of ordinary closed itemsets. Depending on the strength of closedness, the family of strongly closed itemsets typically forms a tiny subfamily of ordinary closed itemsets that is stable against changes in the input. In this paper we consider the problem of mining strongly closed itemsets from transactional data streams. Utilizing their algebraic and algorithmic properties, we propose an algorithm based on reservoir sampling for approximating this type of itemsets in the landmark streaming setting, prove its correctness, and show empirically that it yields a considerable speed-up over a straightforward naive algorithm without any significant loss in precision and recall. We motivate the problem setting considered by two practical applications. In particular, we first experimentally demonstrate that the above properties, i.e., compactness and stability, make strongly closed itemsets an excellent indicator of certain types of concept drifts in transactional data streams. As a second application we consider computer-aided product configuration, a real-world problem raised by an industrial project. For this problem, which is essentially exact concept identification, we propose a learning algorithm based on a certain type of subset queries formed by strongly closed itemsets and show on real-world datasets that it requires significantly less query evaluations than a naive algorithm based on membership queries.