Elastic map

From Wikipedia, the free encyclopedia

"Elastic net" redirects here. For the statistical regularization technique, see Elastic net regularization.

Linear PCA versus nonlinear Principal Manifolds^[1] for visualization of breast cancer microarray data: a) Configuration of nodes and 2D Principal Surface in the 3D PCA linear manifold. The dataset is curved and can not be mapped adequately on a 2D principal plane; b) The distribution in the internal 2D non-linear principal surface coordinates (ELMap2D) together with an estimation of the density of points; c) The same as b), but for the linear 2D PCA manifold (PCA2D). The “basal” breast cancer subtype is visualized more adequately with ELMap2D and some features of the distribution become better resolved in comparison to PCA2D. Principal manifolds are produced by the elastic maps algorithm. Data are available for public competition.^[2] Software is available for free non-commercial use.^[3]^[4]

Elastic maps provide a tool for nonlinear dimensionality reduction. By their construction, they are system of elastic springs embedded in the data space.^[1] This system approximates a low-dimensional manifold. The elastic coefficients of this system allow the switch from completely unstructured k-means clustering (zero elasticity) to the estimators located closely to linear PCA manifolds (for high bending and low stretching modules). With some intermediate values of the elasticity coefficients, this system effectively approximates non-linear principal manifolds. This approach is based on a mechanical analogy between principal manifolds, that are passing through "the middle" of data distribution, and elastic membranes and plates. The method was developed by A.N. Gorban, A.Y. Zinovyev and A.A. Pitenko in 1996–1998.

Energy of elastic map

Let data set be a set of vectors $S$ in a finite-dimensional Euclidean space. The elastic map is represented by a set of nodes $W_{j}$ in the same space. Each datapoint $s\in S$ has a host node, namely the closest node $W_{j}$ (if there are several closest nodes then one takes the node with the smallest number). The data set $S$ is divided on classes $K_{j}=\{s\ |\ W_{j}{\mbox{ is a host of }}s\}$ .

The approximation energy D is the distortion

$D={\frac {1}{2}}\sum _{{j=1}}^{k}\sum _{{s\in K_{j}}}\|s-W_{j}\|^{2}$ ,

this is the energy of the springs with unit elasticity which connect each data point with its host node. It is possible to apply weighting factors to the terms of this sum, for example to reflect the standard deviation of the probability density function of any subset of data points $\{s_{i}\}$ .

On the set of nodes an additional structure is defined. Some pairs of nodes, $(W_{i},W_{j})$ , are connected by elastic edges. Call this set of pairs $E$ . Some triplets of nodes, $(W_{i},W_{j},W_{k})$ , form bending ribs. Call this set of triplets $G$ .

The stretching energy is $U_{{E}}={\frac {1}{2}}\lambda \sum _{{(W_{i},W_{j})\in E}}\|W_{i}-W_{j}\|^{2}$ ,

The bending energy is $U_{G}={\frac {1}{2}}\mu \sum _{{(W_{i},W_{j},W_{l})\in G}}\|W_{i}-2W_{j}+W_{l}\|^{2}$ ,

where $\lambda$ and $\mu$ are the stretching and bending moduli respectively. The stretching energy is sometimes referred to as the "membrane" term, while the bending energy is referred to as the "thin plate" term.^[6]

For example, on the 2D rectangular grid the elastic edges are just vertical and horizontal edges (pairs of closest vertices) and the bending ribs are the vertical or horizontal triplets of consecutive (closest) vertices.

The total energy of the elastic map is thus $U=D+U_{E}+U_{G}.$

The position of the nodes $\{W_{j}\}$ is determined by the mechanical equilibrium of the elastic map, i.e. its location is such that it minimizes the total energy $U$ .

Expectation-maximization algorithm

For a given splitting of the dataset $S$ in classes $K_{j}$ minimization of the quadratic functional $U$ is a linear problem with the sparse matrix of coefficients. Therefore, similarly to PCA or k-means, a splitting method is used:

For given $\{W_{j}\}$ find $\{K_{j}\}$ ;
For given $\{K_{j}\}$ minimize $U$ and find $\{W_{j}\}$ ;
If no change, terminate.

This expectation-maximization algorithm guarantees a local minimum of $U$ . For improving the approximation various additional methods are proposed. For example, the softening strategy is used. This strategy starts with a rigid grids (small length, small bending and large elasticity modules $\lambda$ and $\mu$ coefficients) and finishes with soft grids (small $\lambda$ and $\mu$ ). The training goes in several epochs, each epoch with its own grid rigidness. Another adaptive strategy is growing net: one starts from small amount of nodes and gradually adds new nodes. Each epoch goes with its own number of nodes.

Applications

Application of principal curves build by the elastic maps method: Nonlinear quality of life index.^[5] Points represent data of the UN 171 countries in 4-dimensional space formed by the values of 4 indicators: gross product per capita, life expectancy, infant mortality, tuberculosis incidence. Different forms and colors correspond to various geographical locations and years. Red bold line represents the principal curve, approximating the dataset.

Most important applications are in bioinformatics^[7] ,^[8] for exploratory data analysis and visualisation of multidimensional data, for data visualisation in economics, social and political sciences,^[9] as an auxiliary tool for data mapping in geographic informational systems and for visualisation of data of various nature.

Recently, the method is adapted as a support tool in the decision process underlying the selection, optimization, and management of financial portfolios.^[10]

References

↑ 1.0 1.1 A. N. Gorban, A. Y. Zinovyev, Principal Graphs and Manifolds, In: Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods and Techniques, Olivas E.S. et al Eds. Information Science Reference, IGI Global: Hershey, PA, USA, 2009. 28–59.
↑ Wang, Y., Klijn, J.G., Zhang, Y., Sieuwerts, A.M., Look, M.P., Yang, F., Talantov, D., Timmermans, M., Meijer-van Gelder, M.E., Yu, J. et al.: Gene expression profiles to predict distant metastasis of lymph-node-negative primary breast cancer. Lancet 365, 671–679 (2005); Data online
↑ A. Zinovyev, ViDaExpert - Multidimensional Data Visualization Tool (free for non-commercial use). Institut Curie, Paris.
↑ A. Zinovyev, ViDaExpert overview, IHES (Institut des Hautes Études Scientifiques), Bures-Sur-Yvette, Île-de-France.
↑ A. N. Gorban, A. Zinovyev, Principal manifolds and graphs in practice: from molecular biology to dynamical systems, International Journal of Neural Systems, Vol. 20, No. 3 (2010) 219–232.
↑ Michael Kass, Andrew Witkin, Demetri Terzopoulos, Snakes: Active contour models, Int.J. Computer Vision, 1988 vol 1-4 pp.321-331
↑ A.N. Gorban, B. Kegl, D. Wunsch, A. Zinovyev (Eds.), Principal Manifolds for Data Visualisation and Dimension Reduction, LNCSE 58, Springer: Berlin – Heidelberg – New York, 2007. ISBN 978-3-540-73749-0
↑ M. Chacón, M. Lévano, H. Allende, H. Nowak, Detection of Gene Expressions in Microarrays by Applying Iteratively Elastic Neural Net, In: B. Beliczynski et al. (Eds.), Lecture Notes in Computer Sciences, Vol. 4432, Springer: Berlin – Heidelberg 2007, 355–363.
↑ A. Zinovyev, Data visualization in political and social sciences, In: SAGE "International Encyclopedia of Political Science", Badie, B., Berg-Schlosser, D., Morlino, L. A. (Eds.), 2011.
↑ M. Resta, Portfolio optimization through elastic maps: Some evidence from the Italian stock exchange, Knowledge-Based Intelligent Information and Engineering Systems, B. Apolloni, R.J. Howlett and L. Jain (eds.), Lecture Notes in Computer Science, Vol. 4693, Springer: Berlin – Heidelberg, 2010, 635-641.

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.