Sciweavers

11910 search results - page 185 / 2382
» Online Learning Algorithms
Sort
View
96
Voted
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 28 days ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
JMLR
2002
140views more  JMLR 2002»
15 years 13 days ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
ATAL
2007
Springer
15 years 7 months ago
Learning consumer preferences using semantic similarity
In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate the...
Reyhan Aydogan, Pinar Yolum
110
Voted
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
14 years 11 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 4 months ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla