J-MEANS

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 defined 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 search heuristics, K- and H-Means as well as with H-Means+, an improved version of the latter in which degeneracy is removed. Moreover, another heuristic, which fits into the variable neighborhood search metaheuristic framework and uses J-Means in its local search step, is proposed too. Results on standard test problems from the literature are reported. It appears that J-Means outperforms the other local search methods, quite substantially when many entities and clusters are considered.


References in zbMATH (referenced in 54 articles , 1 standard article )

Showing results 1 to 20 of 54.
Sorted by year (citations)

1 2 3 next

  1. Carrizosa, Emilio; Alguwaizani, Abdulrahman; Hansen, Pierre; Mladenović, Nenad: New heuristic for harmonic means clustering (2015)
  2. Zhikharevich, B.S.; Rusetskay, O.V.; Mladenović, N.: Clustering cities based on their development dynamics and variable neigborhood search (2015)
  3. Carrizosa, Emilio; Mladenović, Nenad; Todosijević, Raca: Variable neighborhood search for minimum sum-of-squares clustering on networks (2013)
  4. Alguwaizani, Abdulrahman: Degeneracy on $K$-means clustering (2012)
  5. Aloise, Daniel; Hansen, Pierre; Liberti, Leo: An improved column generation algorithm for minimum sum-of-squares clustering (2012)
  6. de Carvalho, Francisco de A.T.; Lechevallier, Yves; De Melo, Filipe M.: Partitioning hard clustering algorithms based on multiple dissimilarity matrices (2012)
  7. Hansen, Pierre; Ruiz, Manuel; Aloise, Daniel: A VNS heuristic for escaping local extrema entrapment in normalized cut clustering (2012)
  8. Alguwaizani, Abdulrahman; Hansen, Pierre; Mladenović, Nenad; Ngai, Eric: Variable neighborhood search for harmonic means clustering (2011)
  9. Aloise, Daniel; Hansen, Pierre: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (2011)
  10. Deng, Yumin; Bard, Jonathan F.: A reactive GRASP with path relinking for capacitated clustering (2011)
  11. Amiri, M.; Zandieh, M.; Yazdani, M.; Bagheri, A.: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (2010)
  12. Chiang, Mark Ming-Tso; Mirkin, Boris: Intelligent choice of the number of clusters in $K$-means clustering: an experimental study with different cluster spreads (2010)
  13. Galiev, Sh.I.; Karpova, M.A.: Optimization of multiple covering of a bounded set with circles (2010)
  14. Hansen, Pierre; Mladenović, Nenad; Moreno Pérez, José A.: Variable neighbourhood search: methods and applications (2010)
  15. Nascimento, Mariá C.V.; Toledo, Franklina M.B.; de Carvalho, André C.P.L.F.: Investigation of a new GRASP-based clustering algorithm applied to biological data (2010)
  16. Rezaee, Babak: A cluster validity index for fuzzy clustering (2010)
  17. Brusco, Michael J.; Köhn, Hans-Friedrich: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (2009)
  18. Mucherino, A.; Papajorgji, Petraq; Pardalos, P.M.: A survey of data mining techniques applied to agriculture (2009)
  19. Novick, Beth: Norm statistics and the complexity of clustering problems (2009)
  20. Audet, Charles; Béchard, Vincent; Le Digabel, Sébastien: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (2008)

1 2 3 next