FINE: fisher information nonparametric embedding.
We consider the problems of clustering, classification, and visualization of high-dimensional data when no straightforward euclidean representation exists. In this paper, we propose using the properties of information geometry and statistical manifolds in order to define similarities between data sets using the Fisher information distance. We will show that this metric can be approximated using entirely nonparametric methods, as the parameterization and geometry of the manifold is generally unknown. Furthermore, by using multidimensional scaling methods, we are able to reconstruct the statistical manifold in a low-dimensional euclidean space; enabling effective learning on the data. As a whole, we refer to our framework as Fisher Information Nonparametric Embedding (FINE) and illustrate its uses on practical problems, including a biomedical application and document classification.
Carter
Kevin M
KM
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA. kmcarter@umich.edu
Raich
Raviv
R
Finn
William G
WG
Hero
Alfred O
AO
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003198:Computer Simulation; D016208:Databases, Factual; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*; D014584:User-Computer Interface