A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...