Sciweavers

79 search results - page 7 / 16
» Efficiently Learning the Metric with Side-Information
Sort
View
ICCV
2009
IEEE
1019views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Similarity Functions for Categorization: from Monolithic to Category Specific
Similarity metrics that are learned from labeled training data can be advantageous in terms of performance and/or efficiency. These learned metrics can then be used in conjuncti...
Boris Babenko, Steve Branson, Serge Belongie
84
Voted
ICML
2005
IEEE
16 years 14 days 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
120
Voted
CVPR
2010
IEEE
15 years 8 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain
NIPS
2004
15 years 1 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
COLT
2008
Springer
15 years 1 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor