Variable neighborhood search for minimum sum-of-squares clustering on networks
نویسندگان
چکیده
منابع مشابه
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملOn the Complexity of Minimum Sum-of-Squares Clustering
To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We examine causes for such confusion and in the process show that a recent proof of Drineas et al. in Machine Learning 56, 9–33, 2004 is not valid and unlikely to be salvaged.
متن کاملAn Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Since minimum sum-of-squares clustering (MSSC) is an NP hard combinatorial optimization problem, applying techniques from global optimization appears to be promising for reliably clustering numerical data. In this paper, concepts of combinatorial heuristic optimization are considered for approaching the MSSC: An iterated local search (ILS) approach is proposed which is capable of finding (near-...
متن کاملJ-MEANS: a new local search heuristic for minimum sum of squares clustering
A new local search heuristic, called J-Means, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solution is deened by all possible centroid-to-entity relocations followed by corresponding changes of assignments. Moves are made in such neighborhoods until a local optimum is reached. The new heuristic is compared with two other well-known local...
متن کاملA scatter search approach for the minimum sum-of-squares clustering problem
A metaheuristic procedure based on the Scatter Search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum Sum-of-Squares Clustering. This algorithm incorporates procedures based on different strategies, such as Local Search, GRASP, Tabu Search or Path Relinking. The aim is to obtain quality solutions with short computation times. A series of computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2013
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.04.027