Sciweavers

4196 search results - page 310 / 840
» Unsupervised Learning of Relations
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 8 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ENGL
2007
148views more  ENGL 2007»
15 years 4 months ago
A General Reflex Fuzzy Min-Max Neural Network
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Abhijeet V. Nandedkar, Prabir Kumar Biswas
127
Voted
ICML
2006
IEEE
16 years 5 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
ICML
2005
IEEE
16 years 5 months ago
A theoretical analysis of Model-Based Interval Estimation
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
Alexander L. Strehl, Michael L. Littman
ICML
2003
IEEE
16 years 5 months ago
Relativized Options: Choosing the Right Transformation
Relativized options combine model minimization methods and a hierarchical reinforcement learning framework to derive compact reduced representations of a related family of tasks. ...
Balaraman Ravindran, Andrew G. Barto