IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4939-0742-7_3.html
   My bibliography  Save this book chapter

Experiments with a Non-convex Variance-Based Clustering Criterion

In: Clusters, Orders, and Trees: Methods and Applications

Author

Listed:
  • Rodrigo F. Toso

    (Rutgers University)

  • Evgeny V. Bauman

    (Markov Processes International)

  • Casimir A. Kulikowski

    (Rutgers University)

  • Ilya B. Muchnik

    (DIMACS, Rutgers University)

Abstract

This paper investigates the effectiveness of a variance-based clustering criterion whose construct is similar to the popular minimum sum-of-squares or k-means criterion, except for two distinguishing characteristics: its ability to discriminate clusters by means of quadratic boundaries and its functional form, for which convexity does not hold. Using a recently proposed iterative local search heuristic that is suitable for general variance-based criteria—convex or not, the first to our knowledge that offers such broad support—the alternative criterion has performed remarkably well. In our experimental results, it is shown to be better suited for the majority of the heterogeneous real-world data sets selected. In conclusion, we offer strong reasons to believe that this criterion can be used by practitioners as an alternative to k-means clustering.

Suggested Citation

  • Rodrigo F. Toso & Evgeny V. Bauman & Casimir A. Kulikowski & Ilya B. Muchnik, 2014. "Experiments with a Non-convex Variance-Based Clustering Criterion," Springer Optimization and Its Applications, in: Fuad Aleskerov & Boris Goldengorin & Panos M. Pardalos (ed.), Clusters, Orders, and Trees: Methods and Applications, edition 127, pages 51-62, Springer.
    • Handle: RePEc:spr:spochp:978-1-4939-0742-7_3
    DOI: 10.1007/978-1-4939-0742-7_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4939-0742-7_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.