Sciweavers

135 search results - page 12 / 27
» Clustering Problems on Sliding Windows
Sort
View
DATAMINE
2006
230views more  DATAMINE 2006»
14 years 9 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
97
Voted
KDD
1998
ACM
141views Data Mining» more  KDD 1998»
15 years 1 months ago
Rule Discovery from Time Series
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Ren...
CIKM
2009
Springer
15 years 4 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
69
Voted
ICCV
2003
IEEE
15 years 11 months ago
Regression based Bandwidth Selection for Segmentation using Parzen Windows
We consider the problem of segmentation of images that can be modelled as piecewise continuous signals having unknown, non-stationary statistics. We propose a solution to this pro...
Maneesh Kumar Singh, Narendra Ahuja
WWW
2005
ACM
15 years 10 months ago
Ranking a stream of news
According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have p...
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...