Robust and sparse k-means clustering for high-dimensional data
Open Access
- 19 March 2019
- journal article
- research article
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 13 (4) , 905-932
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Österreichische Forschungsförderungsgesellschaft (843550)
- Vienna Science and Technology Fund (ICT12-010)
This publication has 30 references indexed in Scilit:
- A comparative study of efficient initialization methods for the k-means clustering algorithmExpert Systems with Applications, 2013
- A Framework for Feature Selection in ClusteringJournal of the American Statistical Association, 2010
- Robust partitional clustering by outlier and density insensitive seedingPattern Recognition Letters, 2009
- A general trimming approach to robust cluster AnalysisThe Annals of Statistics, 2008
- Variable Selection for Model-Based ClusteringJournal of the American Statistical Association, 2006
- Finding the Number of Clusters in a DatasetJournal of the American Statistical Association, 2003
- Estimating the Number of Clusters in a Data Set Via the Gap StatisticJournal of the Royal Statistical Society Series B: Statistical Methodology, 2001
- Quantitative analysis of 16-17th century archaeological glass vessels using PLS regression of EPXMA and? -XRF dataJournal of Chemometrics, 2000
- LOFACM SIGMOD Record, 2000
- Robustness properties of S-estimators of multivariate location and shape in high dimensionThe Annals of Statistics, 1996