Principal components are a well established tool in dimension reduction. The extension to principal\ud curves allows for general smooth curves which pass through the middle of a multidimensional data\ud cloud. In this paper local principal curves are introduced, which are based on the localization of\ud principal component analysis. The proposed algorithm is able to identify closed curves as well as\ud multiple curveswhich may ormay not be connected. For the evaluation of the performance of principal\ud curves as tool for data reduction a measure of coverage is suggested. By use of simulated and real\ud data sets the approach is compared to various alternative concepts of principal curves
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.