Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases

Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of frequent patterns, where transactions are allowed to miss some items in the itemset they support. Patterns exhibiting such “faults” are called frequent fault-tolerant patterns (FFT-patterns) if they are significant in number. In this paper, the term “pattern” is distinguished from “itemset” as referring to a pair (tidset × itemset). Unlike classical frequent patterns, the number of FFTpatterns grows exponentially not only with the number of items, but also with the number of transactions. Since the latter may reach millions, mining FFT-patterns by enumerating them becomes infeasible. Hence, the challenge is to represent FFT-patterns concisely without losing any useful information. To address this, we draw on the observation that, in transactional databases, the transactions themselves are not i...

• Type: Conference
• Year: 2007
• Where: ICDM
• Authors: Ardian Kristanto Poernomo, Vivekanand Gopalkrishnan
• Keywords: Classic Frequent Patterns, Data Mining, Frequent Fault-tolerant Patterns, Frequent Patterns, ICDM 2007