J-MEANS: A new local search heuristic for minimum sum of squares clustering
From MaRDI portal
Publication:5957595
DOI10.1016/S0031-3203(99)00216-2zbMATH Open1012.68873OpenAlexW2091292848WikidataQ127740626 ScholiaQ127740626MaRDI QIDQ5957595FDOQ5957595
Authors: Pierre Hansen, Nenad Mladenović 
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
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A classification EM algorithm for clustering and two stochastic versions
- Title not available (Why is that?)
- Another interpretation of the EM algorithm for mixture distributions
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Location-Allocation Problems
- Title not available (Why is that?)
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Variable neighborhood search
- Title not available (Why is that?)
- A new adaptive multi-start technique for combinatorial global optimizations
- Variable neighborhood search for the p-median
- Degeneracy in the multi-source Weber problem
- Experiments in projection and clustering by simulated annealing
- A Branch and Bound Clustering Algorithm
- 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
Cited In (64)
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection
- On the Optimization Models for Automatic Grouping of Industrial Products by Homogeneous Production Batches
- An investigation on compound neighborhoods for VRPTW
- A derivative-free algorithm for refining numerical microaggregation solutions
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
- \(k\)-means genetic algorithms with greedy genetic operators
- A scatter search approach for the minimum sum-of-squares clustering problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Solving the wire-harness design problem at a European car manufacturer
- New heuristic for harmonic means clustering
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Sequential combination methods for data clustering analysis
- The capacitated centred clustering problem
- Variable neighborhood search for harmonic means clustering
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search: Principles and applications
- K-medoids inverse regression
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- On strategies to fix degenerate \(k\)-means solutions
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Variable neighbourhood search: methods and applications
- Candidate groups search for K-harmonic means data clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Norm statistics and the complexity of clustering problems
- A reactive GRASP with path relinking for capacitated clustering
- Latent group detection in functional partially linear regression models
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- J-MEANS
- K-means clustering via a nonconvex optimization approach
- An algorithm for minimizing clustering functions
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Local optimization method with global multidimensional search
- Improving a centroid-based clustering by using suitable centroids from another clustering
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- GAPS: A clustering method using a new point symmetry-based distance measure
- A survey of data mining techniques applied to agriculture
- Partitioning hard clustering algorithms based on multiple dissimilarity matrices
- Clustering approach in maintenance of capillary railway network
- Grouping cities based of their socio-economic indicators
- \(K\)-harmonic means data clustering with simulated annealing heuristic
- \(K\)-harmonic means data clustering with tabu-search method
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Application of the cross-entropy method to clustering and vector quantization
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Design of hybrids for the minimum sum-of-squares clustering problem
- Fuzzy J-means: a new heuristic for fuzzy clustering
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- The hyperbolic smoothing clustering method
- An incremental clustering algorithm based on hyperbolic smoothing
- Degeneracy on \(K\)-means clustering
- Clustering cities based on their development dynamics and variable neigborhood search
- J-means and I-means for minimum sum-of-squares clustering on networks
Uses Software
This page was built for publication: J-MEANS: A new local search heuristic for minimum sum of squares clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957595)
