메뉴 건너뛰기




Volumn 23, Issue 8, 2002, Pages 1009-1017

A k-segments algorithm for finding principal curves

Author keywords

Dimension reduction; Feature extraction; Polygonal line; Principal curve; Unsupervised learning

Indexed keywords

ALGORITHMS; PERFORMANCE;

EID: 0036605005     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00032-6     Document Type: Article
Times cited : (97)

References (12)
  • 2
    • 0032849056 scopus 로고    scopus 로고
    • Principal curves: A new technique for indirect and direct gradient analysis
    • (1999) Ecology , vol.80 , Issue.7 , pp. 2237-2253
    • Deáth, G.1
  • 3
    • 0028748949 scopus 로고
    • Growing cell structures - A self-organizing network for unsupervised and supervised learning
    • (1994) Neural Networks , vol.7 , Issue.9 , pp. 1441-1460
    • Fritzke, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.