Sciweavers

87 search results - page 3 / 18
» Efficient elastic burst detection in data streams
Sort
View
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
14 years 5 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
11 years 7 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 9 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 6 months ago
Dynamic Clustering of Evolving Streams with a Single Pass
Stream data is common in many applications, e.g., stock quotes, merchandize sales record, system logs, etc.. It is of great importance to analyze these stream data. As one of the ...
Jiong Yang
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 5 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang