Sciweavers

1217 search results - page 1 / 244
» On compressing frequent patterns
Sort
View
DKE
2007
105views more  DKE 2007»
13 years 4 months ago
On compressing frequent patterns
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...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
DAWAK
2003
Springer
13 years 9 months ago
Comprehensive Log Compression with Frequent Patterns
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 ...
Kimmo Hätönen, Jean-François Boul...
VLDB
2005
ACM
118views Database» more  VLDB 2005»
13 years 10 months ago
Mining Compressed Frequent-Pattern Sets
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 ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 6 months ago
Go Green: Recycle and Reuse Frequent Patterns
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. ...
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 9 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
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...
Yudho Giri Sucahyo, Raj P. Gopalan