A fast and recursive algorithm for clustering large datasets with \(k\)-medians

DOI10.1016/j.csda.2011.11.019zbMath1243.62087arXiv1101.4179OpenAlexW2003188728MaRDI QIDQ434902

Jean-Marie Monnez, Peggy Cénac, Hervé Cardot

Publication date: 16 July 2012

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.4179

zbMATH Keywords

stochastic approximationrecursive estimatorsaveraginghigh dimensional datastochastic gradient\(k\)-medoidsonline clusteringpartitioning around medoidsRobbins-Monro

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Stochastic approximation (62L20) Sequential estimation (62L12)

Related Items

Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence, Clustering transformed compositional data usingK-means, with applications in gene expression and bicycle sharing system data, Online estimation of hazard rate under random censoring, Streaming constrained binary logistic regression with online standardized data, Multiobjective semisupervised learning with a right‐censored endpoint adapted to the multiple imputation framework, Bayesian Quadrature, Energy Minimization, and Space-Filling Design, Online estimation of integrated squared density derivatives, Widening the scope of an eigenvector stochastic approximation process and application to streaming PCA and related methods, A compact law of the iterated logarithm for online estimator of hazard rate under random censoring, Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm, Fast estimation of the median covariation matrix with application to online robust principal components analysis, Recursive estimators of integrated squared density derivatives

Uses Software

• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Online wavelet-based density estimation for non-stationary streaming data
• A general trimming approach to robust cluster analysis
• Editorial: Machine learning and robust data mining
• \(L_1\)-quantization and clustering in Banach spaces
• A review of robust clustering methods
• Almost sure convergence of stochastic gradient processes with matrix step sizes
• On a Geometric Notion of Quantiles for Multivariate Data
• Large-Scale Machine Learning with Stochastic Gradient Descent
• Stochastic Approximation for Multivariate and Functional Median
• Hybrid hierarchical clustering with applications to microarray data
• Finding Groups in Data
• Acceleration of Stochastic Approximation by Averaging
• Printer graphics for clustering
• Asymptotic behaviour of classification maximum likelihood estimates
• Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
• Robustness Properties of k Means and Trimmed k Means
• Data Clustering: Theory, Algorithms, and Applications