Learning a tree of metrics with disjoint visual features

K Grauman, F Sha, S Hwang - Advances in neural …, 2011 - proceedings.neurips.cc
We introduce an approach to learn discriminative visual representations while exploiting
external semantic knowledge about object category relationships. Given a hierarchical …

Learning a mixture of sparse distance metrics for classification and dimensionality reduction

Y Hong, Q Li, J Jiang, Z Tu - 2011 International Conference on …, 2011 - ieeexplore.ieee.org
This paper extends the neighborhood components analysis method (NCA) to learning a
mixture of sparse distance metrics for classification and dimensionality reduction. We …

Hierarchical distance metric learning for large margin nearest neighbor classification

S Sun, Q Chen - International Journal of Pattern Recognition and …, 2011 - World Scientific
Distance metric learning is a powerful tool to improve performance in classification,
clustering and regression tasks. Many techniques have been proposed for distance metric …

Low rank metric learning with manifold regularization

G Zhong, K Huang, CL Liu - 2011 IEEE 11th International …, 2011 - ieeexplore.ieee.org
In this paper, we present a semi-supervised method to learn a low rank Mahalanobis
distance function. Based on an approximation to the projection distance from a manifold, we …

SERAPH: Semi-supervised metric learning paradigm with hyper sparsity

G Niu, B Dai, M Yamada, M Sugiyama - arXiv preprint arXiv:1105.0167, 2011 - arxiv.org
We propose a general information-theoretic approach called Seraph (SEmi-supervised
metRic leArning Paradigm with Hyper-sparsity) for metric learning that does not rely upon …

Sparse kernel regression for traffic flow forecasting

R Huang, S Sun, Y Liu - Advances in Neural Networks–ISNN 2011: 8th …, 2011 - Springer
In this paper, a new kernel regression algorithm with sparse distance metric is proposed and
applied to the traffic flow forecasting. The sparse kernel regression model is established by …