Sciweavers

2463 search results - page 2 / 493
» Compressed Pattern Databases
Sort
View
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. ...
SDM
2012
SIAM
289views Data Mining» more  SDM 2012»
11 years 7 months ago
Mining Compressing Sequential Patterns
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin,...
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
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
13 years 11 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 10 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