.png){kind=icon}
.png){kind=icon}
Return
A k-segments algorithm for finding principal curves
.png){kind=icon}
OA
AI
DOI：10.1016/S0167-8655(02)00032-6.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines (PLs). New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
dimension reduction
feature extraction
polygonal line
principal curve
unsupervised learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W
Organization
No organization information available