Sciweavers

39 search results - page 2 / 8
» Choosing Between Two Learning Algorithms Based on Calibrated...
Sort
View
NIPS
2003
13 years 6 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
ATAL
2007
Springer
13 years 9 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
JEI
2002
88views more  JEI 2002»
13 years 5 months ago
Natural image database and its use for scene illuminant estimation
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Shoji Tominaga
ICML
2003
IEEE
14 years 6 months ago
Principled Methods for Advising Reinforcement Learning Agents
An important issue in reinforcement learning is how to incorporate expert knowledge in a principled manner, especially as we scale up to real-world tasks. In this paper, we presen...
Eric Wiewiora, Garrison W. Cottrell, Charles Elkan
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 5 months ago
Active Learning for Hidden Attributes in Networks
In many networks, vertices have hidden attributes that are correlated with the network's topology. For instance, in social networks, people are more likely to be friends if t...
Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, C...