Estimating and computing density based distance metrics

Authors:
Sajama;Alon Orlitsky
Affiliations:
University of california at San Diego;University of california at San Diego
Venue:
ICML '05 Proceedings of the 22nd international conference on Machine learning
Year:
2005

Citing 4
Cited 1

Learning from Labeled and Unlabeled Data using Graph Mincuts

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Semi-supervised learning using randomized mincuts

ICML '04 Proceedings of the twenty-first international conference on Machine learning
On information regularization

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Learning riemannian metrics

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Position regularized Support Vector Domain Description

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Density-based distance metrics have applications in semi-supervised learning, nonlinear interpolation and clustering. We consider density-based metrics induced by Riemannian manifold structures and estimate them using kernel density estimators for the underlying data distribution. We lower bound the rate of convergence of these plug-in path-length estimates and hence of the metric, as the sample size increases. We present an upper bound on the rate of convergence of all estimators of the metric. We also show that the metric can be consistently computed using the shortest path algorithm on a suitably constructed graph on the data samples and lower bound the convergence rate of the computation error. We present experiments illustrating the use of the metrics for semi-supervised classification and non-linear interpolation.