Sciweavers

134 search results - page 3 / 27
» Sliding-Window Filtering: An Efficient Algorithm for Increme...
Sort
View
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 2 months ago
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun ...
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 8 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
14 years 8 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha
TKDE
2008
218views more  TKDE 2008»
13 years 7 months ago
A General Model for Sequential Pattern Mining with a Progressive Database
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
Jen-Wei Huang, Chi-Yao Tseng, Jian Chih Ou, Ming-S...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà