FINE: Fisher Information Non-parametric Embedding

02/14/2008
by   Kevin M. Carter, et al.
0

We consider the problems of clustering, classification, and visualization of high-dimensional data when no straightforward Euclidean representation exists. Typically, these tasks are performed by first reducing the high-dimensional data to some lower dimensional Euclidean space, as many manifold learning methods have been developed for this task. In many practical problems however, the assumption of a Euclidean manifold cannot be justified. In these cases, a more appropriate assumption would be that the data lies on a statistical manifold, or a manifold of probability density functions (PDFs). In this paper we propose using the properties of information geometry in order to define similarities between data sets using the Fisher information metric. We will show this metric can be approximated using entirely non-parametric methods, as the parameterization of the manifold is generally unknown. Furthermore, by using multi-dimensional scaling methods, we are able to embed the corresponding PDFs into a low-dimensional Euclidean space. This not only allows for classification of the data, but also visualization of the manifold. As a whole, we refer to our framework as Fisher Information Non-parametric Embedding (FINE), and illustrate its uses on a variety of practical problems, including bio-medical applications and document classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2010

An Explicit Nonlinear Mapping for Manifold Learning

Manifold learning is a hot research topic in the field of computer scien...
research
02/09/2022

Parametric t-Stochastic Neighbor Embedding With Quantum Neural Network

t-Stochastic Neighbor Embedding (t-SNE) is a non-parametric data visuali...
research
07/01/2022

A geometric framework for outlier detection in high-dimensional data

Outlier or anomaly detection is an important task in data analysis. We d...
research
12/18/2021

Manifold embedding data-driven mechanics

This article introduces a new data-driven approach that leverages a mani...
research
02/28/2018

Automatic topography of high-dimensional data sets by non-parametric Density Peak clustering

Data analysis in high-dimensional spaces aims at obtaining a synthetic d...
research
10/22/2018

Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning

One of the common tasks in unsupervised learning is dimensionality reduc...
research
06/10/2022

Fisher SAM: Information Geometry and Sharpness Aware Minimisation

Recent sharpness-aware minimisation (SAM) is known to find flat minima w...

Please sign up or login with your details

Forgot password? Click here to reset