J-MEANS: A new local search heuristic for minimum sum of squares clustering

DOI10.1016/S0031-3203(99)00216-2zbMath1012.68873OpenAlexW2091292848WikidataQ127740626 ScholiaQ127740626MaRDI QIDQ5957595

Nenad Mladenović, Pierre Hansen

Publication date: 3 June 2003

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(99)00216-2

zbMATH Keywords

J-meanslocal search heuristic

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (63)

Sequential combination methods for data clustering analysis ⋮ A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ Clustering cities based on their development dynamics and variable neigborhood search ⋮ Investigation of a new GRASP-based clustering algorithm applied to biological data ⋮ An algorithm for minimizing clustering functions ⋮ The hyperbolic smoothing clustering method ⋮ K-medoids inverse regression ⋮ Application of the cross-entropy method to clustering and vector quantization ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ \(K\)-harmonic means data clustering with simulated annealing heuristic ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ New heuristic for harmonic means clustering ⋮ An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems ⋮ Grouping cities based of their socio-economic indicators ⋮ Clustering approach in maintenance of capillary railway network ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ Latent group detection in functional partially linear regression models ⋮ Fast modified global \(k\)-means algorithm for incremental cluster construction ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ Variable neighborhood search for harmonic means clustering ⋮ Partitioning hard clustering algorithms based on multiple dissimilarity matrices ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ \(K\)-harmonic means data clustering with tabu-search method ⋮ Design of hybrids for the minimum sum-of-squares clustering problem ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ J-means and I-means for minimum sum-of-squares clustering on networks ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ A scatter search approach for the minimum sum-of-squares clustering problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighborhood search: Principles and applications ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering ⋮ Solving thep-Center problem with Tabu Search and Variable Neighborhood Search ⋮ A derivative-free algorithm for refining numerical microaggregation solutions ⋮ GAPS: A clustering method using a new point symmetry-based distance measure ⋮ Candidate groups search for K-harmonic means data clustering ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ On the Optimization Models for Automatic Grouping of Industrial Products by Homogeneous Production Batches ⋮ VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm ⋮ Norm statistics and the complexity of clustering problems ⋮ Variable neighbourhood search: Methods and applications ⋮ A survey of data mining techniques applied to agriculture ⋮ Degeneracy on K-means clustering ⋮ Improving a centroid-based clustering by using suitable centroids from another clustering ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems ⋮ Local optimization method with global multidimensional search ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ The capacitated centred clustering problem ⋮ Fuzzy J-means: a new heuristic for fuzzy clustering ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks ⋮ K-means clustering via a nonconvex optimization approach ⋮ Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments in projection and clustering by simulated annealing
• Another interpretation of the EM algorithm for mixture distributions
• Degeneracy in the multi-source Weber problem
• A new adaptive multi-start technique for combinatorial global optimizations
• Variable neighborhood search
• A classification EM algorithm for clustering and two stochastic versions
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Location-Allocation Problems
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• TSPLIB—A Traveling Salesman Problem Library
• A Branch and Bound Clustering Algorithm
• Variable neighborhood search for the p-median
• A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
• Evaluation of a Branch and Bound Algorithm for Clustering

This page was built for publication: J-MEANS: A new local search heuristic for minimum sum of squares clustering