Principal Manifolds for Data Visualization and Dimension ReductionAlexander N. Gorban, Balázs Kégl, Donald C. Wunsch, Andrei Zinovyev Springer Science & Business Media, 2007. gada 11. sept. - 340 lappuses In 1901, Karl Pearson invented Principal Component Analysis (PCA). Since then, PCA serves as a prototype for many other tools of data analysis, visualization and dimension reduction: Independent Component Analysis (ICA), Multidimensional Scaling (MDS), Nonlinear PCA (NLPCA), Self Organizing Maps (SOM), etc. The book starts with the quote of the classical Pearson definition of PCA and includes reviews of various methods: NLPCA, ICA, MDS, embedding and clustering algorithms, principal manifolds and SOM. New approaches to NLPCA, principal manifolds, branching principal components and topology preserving mappings are described as well. Presentation of algorithms is supplemented by case studies, from engineering to astronomy, but mostly of biological data: analysis of microarray and metabolite data. The volume ends with a tutorial "PCA and K-means decipher genome". The book is meant to be useful for practitioners in applied data analysis in life sciences, engineering, physics and chemistry; it will also be valuable to PhD students and researchers in computer sciences, applied mathematics and statistics. |
No grāmatas satura
1.–5. rezultāts no 16.
... machine learning which significantly extends Pearson's initial “geometrical” approach. It is a common practice in general discussions on machine learning (a) (b) Fig. 2. An ill-defined unsupervised learning problem. Which Preface VII.
... unsupervised learning problem. Which curve describes the data better, (a) a short curve that is “far” from the data, or (b) a long curve that follows the data closely? to use the dichotomy of supervised and unsupervised learning to ...
... Clustering, another important sub-domain of unsupervised learning, can also be formalized in this framework: the clustering “manifold” is a finite partitioning of the input space, in the simplest case represented as a finite set of ...
... unsupervised paradigm (building all the layers except for the last using, for example, an autoassociative objective function [12]). These new areas share the ambitious goal of embedding manifold learning into artificial intelligence in ...
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
Saturs
1 | |
References | 39 |
References | 65 |
References | 91 |
References | 127 |
The Iterative Extraction Approach to Clustering | 151 |
References | 174 |
Components | 192 |
Principal Trees | 219 |
of Bacterial Genomes | 229 |
Diffusion Maps a Probabilistic Interpretation for Spectral | 238 |
On Bounds for Diffusion Discrepancy and Fill Distance | 261 |
References | 269 |
Dimensionality Reduction and Microarray Data | 293 |
References | 307 |
PCA and KMeans Decipher Genome | 309 |
Citi izdevumi - Skatīt visu
Principal Manifolds for Data Visualization and Dimension Reduction Alexander N. Gorban,Balázs Kégl,Donald C. Wunsch,Andrei Zinovyev Ierobežota priekšskatīšana - 2007 |
Principal Manifolds for Data Visualization and Dimension Reduction Alexander N. Gorban,Balázs Kégl,Donald C. Wunsch,Andrei Zinovyev Priekšskatījums nav pieejams - 2009 |