Abstract
In this paper we introduce a new type of pattern - a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at different levels of abstraction. They represent surprising correlations, both positive and negative, which are specific for a given abstraction level, and which "flip" from positive to negative and vice versa when items are generalized to a higher level of abstraction. We design an efficient algorithm for finding flipping correlations, the Flipper algorithm, which outperforms näive pattern mining methods by several orders of magnitude. We apply Flipper to real-life datasets and show that the discovered patterns are non-redundant, surprising and actionable. Flipper finds strong contrasting correlations in itemsets with low-to-medium support, while existing techniques cannot handle the pattern discovery in this frequency range.
Original language | English (US) |
---|---|
Pages (from-to) | 370-381 |
Number of pages | 12 |
Journal | Proceedings of the VLDB Endowment |
Volume | 5 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2011 |
Keywords
- Flipping correlation
- Itemset mining
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Computer Science