Principal curves of oriented points: theoretical and computational improvements
DOI10.1007/s001800300145zbMath1050.62064OpenAlexW1594985570MaRDI QIDQ1887223
Mario Huerta, Pedro F. Delicado
Publication date: 24 November 2004
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001800300145
smoothingclusteringminimum spanning treeobject oriented programmingprincipal curvesbandwidth choice population pyramidsmultidimensional data set
Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25) Numerical smoothing, curve fitting (65D10) Applications of mathematical programming (90C90)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Multivariate adaptive regression splines
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- On central limit theorems in geometrical probability
- On Rohlf's method for the detection of outliers in multivariate data
- Self-consistency: A fundamental concept in statistics
- Principal curves of oriented points: theoretical and computational improvements
- Smoothing methods in statistics
- Generalization of the Gap Test for the Detection of Multivariate Outliers
- Probabilistic Principal Component Analysis
- Adaptive Principal Surfaces
- 10.1162/15324430152748227
- A k-segments algorithm for finding principal curves
- Principal curves with bounded turn
- Principal Curves
- Another look at principal curves and surfaces
This page was built for publication: Principal curves of oriented points: theoretical and computational improvements