Skip to main content
Springer Nature Link
Log in

J-means and I-means for minimum sum-of-squares clustering on networks

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Given a graph, the Edge minimum sum-of-squares clustering problem requires finding p prototypes (cluster centres) by minimizing the sum of their squared distances from a set of vertices to their nearest prototype, where a prototype can be either a vertex or an inner point of an edge. In this paper we have implemented Variable neighborhood search based heuristic for solving it. We consider three different local search procedures, K-means, J-means, and a new I-means heuristic. Experimental results indicate that the implemented VNS-based heuristic produces the best known results in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245–248 (2009)

    Article  Google Scholar 

  2. Aloise, D., Hansen, P., Liberti, L.: An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131, 195–220 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beasley, J.E.: A note on solving large p-median problems. Eur. J. Oper. Res. 21, 270–273 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brimberg, J., Mladenović, N.: Degeneracy in the multi-source Weber problem. Math. Program. 85, 213–220 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Carrizosa, E., Mladenović, N., Todosijević, R.: Sum-of-squares clustering on networks. Yugosl. J. Oper. Res. 21, 157–161 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Carrizosa, E., Mladenović, N., Todosijević, R.: Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur. J. Oper. Res. 230, 356–363 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenović, N.: New heuristic for harmonic means clustering. J. Global Optim. 1–17 (2015)

  8. Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79, 191–215 (1997)

    MathSciNet  MATH  Google Scholar 

  9. Hansen, P., Mladenović, N.: J-Means: a new local search heuristic for minimum sum of squares clustering. Pattern Recognit. 34, 405–413 (2001)

    Article  MATH  Google Scholar 

  10. Hansen, P., Ngai, E., Cheung, B., Mladenović, N.: Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering. J. Classif. 22, 287–310 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hansen, P., Mladenović, N., Moreno-Pérez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)

    MATH  Google Scholar 

  13. Hooker, J.N., Garfinkel, R.S., Chen, C.K.: Finite dominating sets for network location problems. Oper. Res. 39, 100–118 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The work was conducted at National Research University Higher School of Economics and supported by RSF Grant 14-41-00039.

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova street, Nizhny Novgorod, 603093, Russia

    Alexey Nikolaev

  2. LAMIH, Université de Valenciennes et du Hainaut-Cambresis, Campus Mont Houy, 59313, Valenciennes Cedex 9, France

    Nenad Mladenović & Raca Todosijević

  3. Mathematical Institute, Serbian Academy of Science and Arts, 11000, Belgrade, Serbia

    Nenad Mladenović & Raca Todosijević

Authors
  1. Alexey Nikolaev
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Nenad Mladenović
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Raca Todosijević
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Alexey Nikolaev.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nikolaev, A., Mladenović, N. & Todosijević, R. J-means and I-means for minimum sum-of-squares clustering on networks. Optim Lett 11, 359–376 (2017). https://doi.org/10.1007/s11590-015-0974-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0974-4

Keywords