Sciweavers

151 search results - page 9 / 31
» Discretization from data streams: applications to histograms...
Sort
View
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à
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
13 years 11 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
ICC
2007
IEEE
145views Communications» more  ICC 2007»
14 years 1 months ago
Predicting User-Perceived Quality Ratings from Streaming Media Data
Abstract—Media stream quality is highly dependent on underlying network conditions, but identifying scalable, unambiguous metrics to discern the user-perceived quality of a media...
Amy Csizmar Dalal, David R. Musicant, Jamie F. Ols...
KDD
2003
ACM
148views Data Mining» more  KDD 2003»
14 years 8 months ago
Mining concept-drifting data streams using ensemble classifiers
Recently, mining data streams with concept drifts for actionable insights has become an important and challenging task for a wide range of applications including credit card fraud...
Haixun Wang, Wei Fan, Philip S. Yu, Jiawei Han
CIKM
2006
Springer
13 years 11 months ago
Classification spanning correlated data streams
In many applications, classifiers need to be built based on multiple related data streams. For example, stock streams and news streams are related, where the classification patter...
Yabo Xu, Ke Wang, Ada Wai-Chee Fu, Rong She, Jian ...