PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Improved learning of Riemannian metrics for exploratory analysis
Jaakko Peltonen, Arto Klami and Samuel Kaski
Neural Networks Volume 17, Number 8-9, pp. 1087-1100, 2004.

Abstract

Preprint abstract: We have earlier introduced a principle for learning metrics, which shows how metric-based methods can be made to focus on discriminative properties of data. The main applications are in supervising unsupervised learning to model interesting variation in data, instead of modeling all variation as plain unsupervised learning does. The metrics are derived by approximations to an information-geometric formulation. In this paper we review the theory, introduce better approximations to the distances, and show how to apply them in two different kinds of unsupervised methods: prototype-based and pairwise-distance based. The two examples are self-organizing maps and multidimensional scaling (Sammon's mapping). © Elsevier Ltd

EPrint Type:Article
Additional Information:http://www.cis.hut.fi/sami/miabstracts/nn04.html
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Theory & Algorithms
ID Code:286
Deposited By:Jaakko Peltonen
Deposited On:23 November 2004