Finding Principal Paths in Data Space
- 25 December 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 30 (8) , 2449-2462
Abstract
In this paper, we introduce the concept of principal paths in data space; we show that this is a well-characterized problem from the point of view of cognition, and that it can lead to salient insights in the analyzed data enabling topological/holistic descriptions. These paths, interestingly, can be interpreted as local principal curves, and in this paper, we suggest that they are analogous to what, in the statistical mechanics realm, are called minimum free-energy paths. Here, we move that concept from physics to data space and compute them in both the original and the kernel space. The algorithm is a regularized version of the well-known k -means clustering algorithm. The regularization parameter is derived via an in-sample model selection process based on the Bayesian evidence maximization. Interestingly, we show that this choice for the regularization parameter consistently leads to the same manifold even when changing the number of clusters. We apply the method to common data sets, dynamical systems, and, in particular, to molecular dynamics trajectories showing the generality, the usefulness of the approach and its superiority with respect to other related approaches.Keywords
This publication has 26 references indexed in Scilit:
- Topology and dataBulletin of the American Mathematical Society, 2009
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Analytical inversion of symmetric tridiagonal matricesJournal of Physics A: General Physics, 1996
- Principal CurvesJournal of the American Statistical Association, 1989
- A method for determining reaction paths in large molecules: Application to myoglobinChemical Physics Letters, 1987
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- Self-organized formation of topologically correct feature mapsBiological Cybernetics, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- LIII. On lines and planes of closest fit to systems of points in spaceJournal of Computers in Education, 1901