Sciweavers

71 search results - page 7 / 15
» Relative Entropy Policy Search
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
15 years 2 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
WWW
2002
ACM
15 years 10 months ago
Using web structure for classifying and describing web pages
The structure of the web is increasingly being used to improve organization, search, and analysis of information on the web. For example, Google uses the text in citing documents ...
Eric J. Glover, Kostas Tsioutsiouliklis, Steve Law...
ICML
2004
IEEE
15 years 10 months ago
Learning to fly by combining reinforcement learning with behavioural cloning
Reinforcement learning deals with learning optimal or near optimal policies while interacting with the environment. Application domains with many continuous variables are difficul...
Eduardo F. Morales, Claude Sammut
IPL
2010
114views more  IPL 2010»
14 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer