Sciweavers

5329 search results - page 692 / 1066
» The Weighted Majority Algorithm
Sort
View
ICML
2007
IEEE
16 years 7 months ago
On the role of tracking in stationary environments
It is often thought that learning algorithms that track the best solution, as opposed to converging to it, are important only on nonstationary problems. We present three results s...
Richard S. Sutton, Anna Koop, David Silver
WWW
2008
ACM
16 years 7 months ago
Which "Apple" are you talking about ?
In a higher level task such as clustering of web results or word sense disambiguation, knowledge of all possible distinct concepts in which an ambiguous word can be expressed woul...
Mandar Rahurkar, Dan Roth, Thomas S. Huang
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 7 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 7 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
RECOMB
2005
Springer
16 years 7 months ago
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
Elissa J. Chesler, Michael A. Langston