Sciweavers

69 search results - page 6 / 14
» An Efficient Algorithm for Enumerating Closed Patterns in Tr...
Sort
View
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
13 years 8 months ago
A Test Paradigm for Detecting Changes in Transactional Data Streams
A pattern is considered useful if it can be used to help a person to achieve his goal. Mining data streams for useful patterns is important in many applications. However, data stre...
Willie Ng, Manoranjan Dash
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 21 days 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
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 8 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
CIKM
2009
Springer
13 years 11 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan