Sciweavers

259 search results - page 34 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
IS
2007
14 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
14 years 10 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
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
14 years 11 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
KDD
2002
ACM
214views Data Mining» more  KDD 2002»
15 years 10 months ago
Privacy preserving association rule mining in vertically partitioned data
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
Jaideep Vaidya, Chris Clifton
IPL
2006
99views more  IPL 2006»
14 years 9 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti