Sciweavers

582 search results - page 108 / 117
» Info-fuzzy algorithms for mining dynamic data streams
Sort
View
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
14 years 2 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 5 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
VLDB
2005
ACM
146views Database» more  VLDB 2005»
14 years 8 months ago
Adaptive website recommendations with AWESOME
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many fa...
Andreas Thor, Nick Golovin, Erhard Rahm
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 8 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
WWW
2005
ACM
14 years 9 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...