Generalized principal component analysis
Research exposition (monographs, survey articles) pertaining to statistics (62-02) Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image analysis in multivariate analysis (62H35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Generalized principal component analysis deals with many fundamental concepts, facts, and principles in engineering, computation, statistics and mathematics. This book is an introductory graduate course for students in data science, machine learning, and signal processing. It can also be used as an advanced course for students in computer vision, estimation theory, and systems theory. The book is organized into four parts, 13 chapters, and 3 appendices. Chapter 1 gives an introduction to the basic problems, and concepts studied in the book. Part I deals with methods for modeling data with a single low-dimensional linear subspace or nonlinear submanifold. It covers Chapters 2 to 4. Chapter 2 gives a review of classical principal components analysis theory and methods for subspace estimation. Chapter 3 deals with estimation of a subspace when the data are incomplete or corrupted. Chapter 4 shows how to extend previous methods to nonlinear submanifolds. Part II covers complementary approaches for modeling data with a mixture of multiple subspaces. Chapter 5 to 8 are included in this Part. Chapter 5 studies the algebraic properties of mixture subspaces. Chapter 6 presents statistical methods for estimating mixture subspace models. The focus of Chapter 7 is to explore the nonparametric spectral clustering method for subspace clustering. Chapter 8 introduces convex optimization techniques to find affinity matrices for subspace clustering. Part III presents applications of the methods and algorithms studied in earlier chapters. It covers Chapters 9 to 13. Chapter 9 shows how to cluster image patches into multiple subspaces for building sparse representations of natural images. Chapter 10 shows how to segment natural images into multiple regions corresponding to different textures. Chapter 11 shows how to segment multiple moving objects in sequences of images. Chapter 12 studies the temporal segmentation problem. Chapter 13, titled ``Final words, discusses a few related topics that are not explicitly covered in the book because many of them are still open and active research areas. Part IV is dedicated to the appendices. They cover relevant concepts and results in optimization, mathematical statistics, and algebraic geometry in order to make the book self-contained. The book is a good text for researchers, and advanced undergraduate and graduate students of several disciplines, among others computer vision, mathematical statistics, and engineering.
- scientific article; zbMATH DE number 4094599
- Towards theory of generic principal component analysis
- Principal Components Regression by Using Generalized Principal Components Analysis
- Generalized structured component analysis
- Classification and Generalized Principal Component Analysis
- scientific article; zbMATH DE number 775112
- Principal component estimation for generalized linear regression
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
- Resolution of ideals associated to subspace arrangements
- Distance geometry and data science
- Low-rank models in visual analysis
- The image-based multiscale multigrid solver, preconditioner, and reduced order model
- New robust PCA for outliers and heavy sparse noises' detection via affine transformation, the \(L_{\ast, w}\) and \(L_{2,1}\) norms, and spatial weight matrix in high-dimensional images: from the perspective of signal processing
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Linearization of resolutions via products
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- Generalized low rank models
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Analysis of Components for Generalization using Multidimensional Scaling
- Low-rank inducing norms with optimality interpretations
- scientific article; zbMATH DE number 1395620 (Why is no real title available?)
- Tensor methods for nonlinear matrix completion
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Tensor symmetrization and its applications in generalized principal component analysis
- A general theory for subspace-sparse recovery
- scientific article; zbMATH DE number 7626713 (Why is no real title available?)
- Nonlinear subspace clustering using non-convex Schatten-p norm regularization
- Spectral imaging based on 2D diffraction patterns and robust principal component analysis
- Parallel transport unfolding: a connection-based manifold learning approach
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Filtrated algebraic subspace clustering
- Local homology transfer and stratification learning
- A generalization of principal component analysis to K sets of variables.
- Subspace clustering for panel data with interactive effects
- Robust PCA for high‐dimensional data based on characteristic transformation
- Pursuit of a discriminative representation for multiple subspaces via sequential games
- Nonlinear algebra and applications
- A hybrid classifier based on the generalized Heronian mean operator and fuzzy robust PCA algorithms
- Optimal modeling of nonlinear systems: method of variable injections
- Natural model reduction for kinetic equations
- Monomial-agnostic computation of vanishing ideals
- Parsimonious feature extraction methods: extending robust probabilistic projections with generalized skew-t
- Recent advances in principal component analysis for directional data
- Learning from similar linear representations: adaptivity, minimaxity, and robustness
- Parameterized complexity of feature selection for categorical data clustering
- Auto-associative models and generalized principal component analysis
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs
- ANOVA Gaussian process modeling for high-dimensional stochastic computational models
This page was built for publication: Generalized principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356522)
