scientific article
From MaRDI portal
Publication:3174068
zbMath1222.68318MaRDI QIDQ3174068
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/teboulle07a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nonsmooth optimizationclusteringsmoothing algorithmsconvex analysisdeterministic annealingfixed point methodsexpectation maximizationk-means algorithmnonlinear meansdistance-like functionsBregman and Csiszar divergencesinformation theory and entropy methodssupport and asymptotic functions
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
GMM based simultaneous reconstruction and segmentation in X-ray CT application ⋮ On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences ⋮ A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA ⋮ Global optimization issues in deep network regression: an overview ⋮ Clustering of high throughput gene expression data ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Clustering and the perturbed spatial median ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ One-dimensional center-based l 1-clustering method ⋮ Model-based multiple rigid object detection and registration in unstructured range data ⋮ Global minimization for continuous multiphase partitioning problems using a dual approach ⋮ Partitional clustering via successive transportation problems ⋮ Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective ⋮ Data clustering for circle detection ⋮ Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment ⋮ A new fuzzy \(c\)-means method with total variation regularization for segmentation of images with noisy and incomplete data ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Interpretation and optimization of the \(k\)-means algorithm. ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Weiszfeld's method: old and new results ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ Optimizing cluster structures with inner product induced norm based dissimilarity measures: theoretical development and convergence analysis ⋮ On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis ⋮ Probabilistic d-clustering ⋮ Axiomatic generalization of the membership degree weighting function for fuzzy \(C\) means clustering: theoretical development and convergence analysis ⋮ Contour approximation of data: a duality theory ⋮ On a robust approach to search for cluster centers ⋮ Center-based l1–clustering method ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ A fast method for simultaneous reconstruction and segmentation in X-ray CT application
Uses Software
