Dimension reduction by local principal component analysis
Neural Computation
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
Learning and Design of Principal Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Another look at principal curves and surfaces
Journal of Multivariate Analysis
Piecewise Linear Skeletonization Using Principal Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity preserving principal curve: an optimal 1-D feature extractor for data representation
IEEE Transactions on Neural Networks
Exploring US Business Cycles with Bivariate Loops Using Penalized Spline Regression
Computational Economics
Hi-index | 0.00 |
Principal components are a well established tool in dimension reduction. The extension to principal curves allows for general smooth curves which pass through the middle of a multidimensional data cloud. In this paper local principal curves are introduced, which are based on the localization of principal component analysis. The proposed algorithm is able to identify closed curves as well as multiple curves which may or may not be connected. For the evaluation of the performance of principal curves as tool for data reduction a measure of coverage is suggested. By use of simulated and real data sets the approach is compared to various alternative concepts of principal curves.