Sciweavers

1419 search results - page 127 / 284
» Approximation Methods for Supervised Learning
Sort
View
JMLR
2006
186views more  JMLR 2006»
15 years 16 days ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
171
Voted

Publication
218views
13 years 5 months ago
Comparing Visual Feature Coding for Learning Disjoint Camera Dependencies
This paper systematically investigates the effectiveness of different visual feature coding schemes for facilitating the learning of time-delayed dependencies among disjoint multi-...
Xiatian Zhu, Shaogang Gong, and Chen Change Loy
ICML
2009
IEEE
15 years 7 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider
97
Voted
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 7 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
JMLR
2010
172views more  JMLR 2010»
14 years 7 months ago
Modeling annotator expertise: Learning when everybody knows a bit of something
Supervised learning from multiple labeling sources is an increasingly important problem in machine learning and data mining. This paper develops a probabilistic approach to this p...
Yan Yan, Rómer Rosales, Glenn Fung, Mark W....