Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence
From MaRDI portal
Publication:3452592
DOI10.1137/140974365zbMath1327.62311arXiv1501.01320OpenAlexW2964316201MaRDI QIDQ3452592
Adam M. Johansen, Neil Cade, Matthew Thorpe, Florian Theil
Publication date: 13 November 2015
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01320
Related Items
Consistency of modularity clustering on random geometric graphs, Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems, Pointwise convergence in probability of general smoothing splines, Convergence theorems for varying measures under convexity conditions and applications, Asymptotic analysis of the Ginzburg–Landau functional on point clouds, Uniform Fatou's lemma, A variational approach to the consistency of spectral clustering, Fatou's Lemma for Weakly Converging Measures under the Uniform Integrability Condition, Analysis of $p$-Laplacian Regularization in Semisupervised Learning, Large data and zero noise limits of graph-based semi-supervised learning algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A statistical perspective on ill-posed inverse problems (with discussion)
- Impartial trimmed \(k\)-means for functional data
- On the convergence properties of the EM algorithm
- The strong law of large numbers for k-means and best possible nets of Banach valued random variables
- Strong consistency of k-means clustering
- A central limit theorem for k-means clustering
- Asymptotic distributions for clustering criteria
- An introduction to \(\Gamma\)-convergence
- Asymptotic equivalence of nonparametric regression and white noise
- Clustering functional data
- Bayesian aspects of some nonparametric problems
- On minimizing sequences for \(k\)-centres
- \(L_1\)-quantization and clustering in Banach spaces
- Posterior contraction rates for the Bayesian approach to linear ill-posed inverse problems
- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers
- On the Performance of Clustering in Hilbert Spaces
- The minimax distortion redundancy in empirical quantizer design
- Least squares quantization in PCM
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Fatou's Lemma for Weakly Converging Probabilities
- Theory for penalised spline regression
- Stability of k-Means Clustering
- Nonparametric Roughness Penalties for Probability Densities
- MAP estimators and their consistency in Bayesian nonparametric inverse problems
