← Core Methods
Machine Learning › Core Methods ›

Metric Learning

2800 directly classified papers

Papers per year

Papers

Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs NIPS 2010
Worst-Case Linear Discriminant Analysis NIPS 2010
Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions NIPS 2010
Inductive Regularized Learning of Kernel Functions NIPS 2010
b-Bit Minwise Hashing for Estimating Three-Way Similarities NIPS 2010
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data JMLR 2010
Generative Local Metric Learning for Nearest Neighbor Classification NIPS 2010
REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization AISTATS 2010
Learning Kernels with Radiuses of Minimum Enclosing Balls NIPS 2010
Hilbert Space Embeddings and Metrics on Probability Measures JMLR 2010
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks AISTATS 2010
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation AISTATS 2010
Large Margin Multi-Task Metric Learning NIPS 2010
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization NIPS 2010
Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning NIPS 2010
Universal Kernels on Non-Standard Input Spaces NIPS 2010
Learning Translation Invariant Kernels for Classification JMLR 2010
Large Scale Online Learning of Image Similarity Through Ranking JMLR 2010
The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List JMLR 2009
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection JMLR 2009
Maximin affinity learning of image segmentation NIPS 2009
Learning Bregman Distance Functions and Its Application for Semi-Supervised Clustering NIPS 2009
Positive Semidefinite Metric Learning with Boosting NIPS 2009
Sparse and Locally Constant Gaussian Graphical Models NIPS 2009
Fast subtree kernels on graphs NIPS 2009