Sciweavers

313 search results - page 44 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 6 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
DAWAK
2006
Springer
13 years 8 months ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 3 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 7 days ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 5 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou