Sciweavers

567 search results - page 44 / 114
» Learning All Subfunctions of a Function
Sort
View
150
Voted
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 3 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
123
Voted
STACS
1999
Springer
15 years 6 months ago
Costs of General Purpose Learning
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
John Case, Keh-Jiann Chen, Sanjay Jain
130
Voted
CIKM
2010
Springer
15 years 1 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
125
Voted
EMNLP
2008
15 years 4 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an
141
Voted
NIPS
2008
15 years 4 months ago
Implicit Mixtures of Restricted Boltzmann Machines
We present a mixture model whose components are Restricted Boltzmann Machines (RBMs). This possibility has not been considered before because computing the partition function of a...
Vinod Nair, Geoffrey E. Hinton