New heuristic for harmonic means clustering

DOI10.1007/s10898-014-0175-1zbMath1334.90137OpenAlexW1980552542MaRDI QIDQ887198

Nenad Mladenović, Pierre Hansen, Abdulrahman Alguwaizani, Emilio Carrizosa

Publication date: 28 October 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107643

zbMATH Keywords

clusteringdegeneracyvariable neighborhood search\(K\)-harmonic means heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

On strategies to fix degenerate \(k\)-means solutions, J-means and I-means for minimum sum-of-squares clustering on networks, K-means clustering via a nonconvex optimization approach

Uses Software

• J-MEANS
• UCI-ml

Cites Work

• Unnamed Item
• Two optimal double inequalities between power mean and logarithmic mean
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
• Variable neighborhood search for harmonic means clustering
• A new sharp double inequality for generalized heronian, harmonic and power means
• An initialization method for the \(K\)-means algorithm using neighborhood model
• Attraction probabilities in variable neighborhood search
• NP-hardness of Euclidean sum-of-squares clustering
• Variable neighbourhood search: Methods and applications
• Degeneracy in the multi-source Weber problem
• Variable neighborhood search
• Minimum sum of squares clustering in a low dimensional space
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Numerical methods for fuzzy clustering
• Sum-of-squares clustering on networks
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• J-MEANS: A new local search heuristic for minimum sum of squares clustering