Sciweavers

79 search results - page 6 / 16
» Efficiently Learning the Metric with Side-Information
Sort
View
68
Voted
ICML
2009
IEEE
16 years 14 days ago
Learning instance specific distances using metric propagation
In many real-world applications, such as image retrieval, it would be natural to measure the distances from one instance to others using instance specific distance which captures ...
De-Chuan Zhan, Ming Li, Yu-Feng Li, Zhi-Hua Zhou
143
Voted
ECCV
2010
Springer
15 years 3 months ago
Discriminative Tracking by Metric Learning
We present a discriminative model that casts appearance modeling and visual matching into a single objective for visual tracking. Most previous discriminative models for visual tra...
ICML
2009
IEEE
16 years 14 days ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 6 days ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
ICML
2006
IEEE
16 years 14 days ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty