K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
From MaRDI portal
Publication:3336517
DOI10.1109/TPAMI.1984.4767478zbMath0546.62037OpenAlexW2073849744WikidataQ52696618 ScholiaQ52696618MaRDI QIDQ3336517
No author found.
Publication date: 1984
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tpami.1984.4767478
iterative procedurefuzzy setspattern recognitionnumerical taxonomyISODATAcharacterization of local optimalityconvergence of K-means type clustering algorithms
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical optimization and variational techniques (65K10) Probabilistic methods, stochastic differential equations (65C99)
Related Items (61)
On the minimum of the mean-squared error in 2-means clustering ⋮ Local convergence of the fuzzy c-means algorithms ⋮ Fuzzy c-means: optimality of solutions and effective termination of the algorithm ⋮ Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems ⋮ Application of honey-bee mating optimization algorithm on clustering ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ The \(k\)-means range algorithm for personalized data clustering in e-commerce ⋮ Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima ⋮ Multidimensional data clustering utilizing hybrid search strategies ⋮ Parameter modification for clustering criteria ⋮ A local search approximation algorithm for \(k\)-means clustering ⋮ A convergence theorem for graph shift-type algorithms ⋮ Clustering and the perturbed spatial median ⋮ A multi-granularity locally optimal prototype-based approach for classification ⋮ Band depth based initialization of K-means for functional data clustering ⋮ Self-organising fuzzy logic classifier ⋮ Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective ⋮ A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization ⋮ A Multi-Fidelity Model Approach for Simultaneous Scheduling of Machines and Vehicles in Flexible Manufacturing Systems ⋮ Automatic clustering using genetic algorithms ⋮ A computational study of several relocation methods for \(k\)-means algorithms. ⋮ Clustering with missing features: a penalized dissimilarity measure based approach ⋮ Modeling differences in the dimensionality of multiblock data by means of clusterwise simultaneous component analysis ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization ⋮ Data Clustering with Actuarial Applications ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Sample-weighted clustering methods ⋮ Constrained-storage multistage vector quantization based on genetic algorithms ⋮ Higher order mobile coverage control with applications to clustering of discrete sets ⋮ Initializing \(k\)-means clustering by bootstrap and data depth ⋮ Novel meta-heuristic algorithms for clustering web documents ⋮ On clustering tree structured data with categorical nature ⋮ Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing ⋮ Genetic algorithm for text clustering based on latent semantic indexing ⋮ Quantization-based clustering algorithm ⋮ PCA image coding with iterative clustering ⋮ An initialization method for the \(K\)-means algorithm using neighborhood model ⋮ A mixed-integer programming approach to the clustering problem with an application in customer segmentation ⋮ Combinatorial particle swarm optimization (CPSO) for partitional clustering problem ⋮ A genetic approach to the automatic clustering problem ⋮ Time series \(k\)-means: a new \(k\)-means type smooth subspace clustering for time series data ⋮ When do birds of a feather flock together? \(k\)-means, proximity, and conic programming ⋮ The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures ⋮ Clustering-based initialization for non-negative matrix factorization ⋮ Three-mode partitioning ⋮ Multi-view spectral clustering for uncertain objects ⋮ Plasmopara viticola germination virulence forecasting via piece-wise affine identification for hybrid systems ⋮ A tabu search approach for the minimum sum-of-squares clustering problem ⋮ Density-based O-Means clustering algorithm using minimum spanning tree ⋮ Unnamed Item ⋮ ADAPTIVE HYPER-FUZZY PARTITION PARTICLE SWARM OPTIMIZATION CLUSTERING ALGORITHM ⋮ Piece-wise affine identification in dialysis ⋮ Nearest \(q\)-flat to \(m\) points ⋮ A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems ⋮ Clustering categorical data sets using tabu search techniques ⋮ An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\) ⋮ The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm ⋮ Interactive clustering and merging with a new fuzzy expected value ⋮ Scenery image recognition and interpretation using fuzzy inference neural networks ⋮ Application of ant \(K\)-means on clustering analysis ⋮ A clustering technique for the identification of piecewise affine systems
This page was built for publication: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
