Sciweavers

3694 search results - page 395 / 739
» Stochastic complexity in learning
Sort
View
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 7 months ago
Canonicalization of database records using adaptive similarity measures
It is becoming increasingly common to construct databases from information automatically culled from many heterogeneous sources. For example, a research publication database can b...
Aron Culotta, Michael L. Wick, Robert Hall, Matthe...
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
16 years 7 days ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
ATAL
2008
Springer
15 years 8 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
ICML
2007
IEEE
16 years 7 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
ICML
2007
IEEE
16 years 7 months ago
Hierarchical Gaussian process latent variable models
The Gaussian process latent variable model (GP-LVM) is a powerful approach for probabilistic modelling of high dimensional data through dimensional reduction. In this paper we ext...
Neil D. Lawrence, Andrew J. Moore