Sciweavers

1172 search results - page 19 / 235
» From Data Distributions to Regularization in Invariant Learn...
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 12 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
AAAI
2010
13 years 12 months ago
Facial Age Estimation by Learning from Label Distributions
One of the main difficulties in facial age estimation is the lack of sufficient training data for many ages. Fortunately, the faces at close ages look similar since aging is a slo...
Xin Geng, Kate Smith-Miles, Zhi-Hua Zhou
AAAI
2008
14 years 22 days ago
Classification by Discriminative Regularization
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin ...
ICONIP
2009
13 years 8 months ago
Learning Gaussian Process Models from Uncertain Data
It is generally assumed in the traditional formulation of supervised learning that only the outputs data are uncertain. However, this assumption might be too strong for some learni...
Patrick Dallaire, Camille Besse, Brahim Chaib-draa