论文信息 - Learning Riemannian Metrics

Learning Riemannian Metrics

We propose a solution to the problem of estimating a Riemannian metric associated with a given differentiable manifold. The metric learning problem is based on minimizing the relative volume of a given set of points. We derive the details for a family of metrics on the multinomial simplex. The resulting metric has applications in text classification and bears some similarity to TFIDF representation of text documents.

Guy Lebanon | G. Lebanon | Guy Lebanon

[1] Michael I. Jordan,et al. Distance Metric Learning with Application to Clustering with Side-Information , 2002, NIPS.

[2] N. Čencov. Statistical Decision Rules and Optimal Inference , 2000 .

[3] Alan Thornton Gous,et al. Exponential and spherical subfamily models , 1998 .

[4] Thomas Hofmann,et al. Learning Curved Multinomial Subfamilies for Natural Language Processing and Information Retrieval , 2000, ICML.

[5] R. Kass. The Geometry of Asymptotic Inference , 1989 .

[6] Nello Cristianini,et al. Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..

[7] Guy Lebanon,et al. Computing the volume element of a family of metrics on the multinomial simplex , 2003 .

[8] Tom M. Mitchell,et al. Learning to Extract Symbolic Knowledge from the World Wide Web , 1998, AAAI/IAAI.

[9] M. Murray,et al. Differential Geometry and Statistics , 1993 .

[10] S T Roweis,et al. Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[11] Michael McGill,et al. Introduction to Modern Information Retrieval , 1983 .

[12] W. Boothby. An introduction to differentiable manifolds and Riemannian geometry , 1975 .