Construction Algorithm of Principal Curves in the Sense of Limit

Publisher:
Springer
Publication Type:
Conference Proceeding
Citation:
AI 2005: Advances in Artificial Intelligence, 18th Australian Joint Conference on Artificial Intelligence Proceedings, 2005, pp. 264 - 273
Issue Date:
2005-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2005003087.pdf260.86 kB
Adobe PDF
Principal curves have been defined as self-consistent, smooth, one-dimensional curves which pass through the middle of a multidimensional data set. They are nonlinear generalization of the first Principal Component. In this paper, we take a new approach by defining principal curves as continuous curves based on the local tangent space in the sense of limit. It is proved that this new principal curves not only satisfy the self-consistent property, but also are the unique existence for any given open covering. Based on the new definition, a new practical algorithm for constructing principal curves is given. And the convergence properties of this algorithm are analyzed. The new construction algorithm of principal curves is illustrated on some simulated data sets.
Please use this identifier to cite or link to this item: