Impartial trimmed \(k\)-means for functional data
From MaRDI portal
Publication:1020146
DOI10.1016/J.CSDA.2006.07.011zbMath1162.62377OpenAlexW2100038527MaRDI QIDQ1020146
Ricardo Fraiman, Juan Antonio Cuesta-Albertos
Publication date: 29 May 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2006.07.011
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics in engineering and industry; control charts (62P30)
Related Items (21)
Functional \(k\)-means inverse regression ⋮ A robust algorithm for template curve estimation based on manifold embedding ⋮ Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence ⋮ A partial overview of the theory of statistics with functional data ⋮ Robust clustering of functional directional data ⋮ Robust clustering for functional data based on trimming and constraints ⋮ Functional data clustering: a survey ⋮ Spatial functional normal mixed effect approach for curve classification ⋮ Cluster analysis with cellwise trimming and applications for the robust clustering of curves ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ A review of robust clustering methods ⋮ Supervised classification of geometrical objects by integrating currents and functional data analysis ⋮ \(k\)-mean alignment for curve clustering ⋮ Supervised classification for functional data: a weighted distance approach ⋮ Functional classification of ornamental stone using machine learning techniques ⋮ M-estimators and trimmed means: from Hilbert-valued to fuzzy set-valued data ⋮ Empirical analysis of the maximum asymptotic bias of location estimators for fuzzy number-valued data ⋮ Statistics for functional data ⋮ On the using of modal curves for radar waveforms classification ⋮ Factor-based comparison of groups of curves ⋮ Robust clustering tools based on optimal transportation
Cites Work
- The strong law of large numbers for k-means and best possible nets of Banach valued random variables
- Strong law of large numbers for measures of central tendency and dispersion of random variables in compact metric spaces
- Strong consistency of k-means clustering
- Best approximations to random variables based on trimming procedures
- Robust principal component analysis for functional data. (With comments)
- Trimmed \(k\)-means: An attempt to robustify quantizers
- On uniqueness and symmetry of self-consistent points of univariate continuous distributions
- Uniqueness of principal points for univariate distributions
- Medidas de centralización multidimensionales (Ley fuerte de los grandes números)
- Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function
- Optimal Grouping, Spacing, Stratification, and Piecewise Constant Approximation
- Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions
This page was built for publication: Impartial trimmed \(k\)-means for functional data