Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/23878 
Year of Publication: 
2003
Series/Report no.: 
Discussion Paper No. 320
Publisher: 
Ludwig-Maximilians-Universität München, Sonderforschungsbereich 386 - Statistische Analyse diskreter Strukturen, München
Abstract: 
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 p-dimensional 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 performance of data reduction obtained by principal curves a measure of coverage is suggested. The selection of tuning parameters is considered explicitely yielding an algorithm which is easy to apply. By use of simulated and real data sets the approach is compared to various alternative concepts of principal curves.
Subjects: 
Local smoothing
mean shift
principal components
principal curves
Persistent Identifier of the first edition: 
Document Type: 
Working Paper

Files in This Item:
File
Size
346.19 kB
1.05 MB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.