IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i3d10.1007_s10878-020-00537-9.html
   My bibliography  Save this article

The bi-criteria seeding algorithms for two variants of k-means problem

Author

Listed:
  • Min Li

    (Shandong Normal University)

Abstract

The k-means problem is very classic and important in computer science and machine learning, so there are many variants presented depending on different backgrounds, such as the k-means problem with penalties, the spherical k-means clustering, and so on. Since the k-means problem is NP-hard, the research of its approximation algorithm is very hot. In this paper, we apply a bi-criteria seeding algorithm to both k-means problem with penalties and spherical k-means problem, and improve (upon) the performance guarantees given by the k-means++ algorithm for these two problems.

Suggested Citation

  • Min Li, 2022. "The bi-criteria seeding algorithms for two variants of k-means problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1693-1704, October.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00537-9
    DOI: 10.1007/s10878-020-00537-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00537-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00537-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang, 2018. "A local search approximation algorithm for a squared metric k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1168-1184, May.
    2. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    3. Min Li & Dachuan Xu & Jun Yue & Dongmei Zhang & Peng Zhang, 2020. "The seeding algorithm for k-means problem with penalties," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 15-32, January.
    4. Min Li & Dachuan Xu & Jun Yue & Dongmei Zhang, 2020. "The Parallel Seeding Algorithm for k-Means Problem with Penalties," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(04), pages 1-18, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peihuang Huang & Pei Yao & Zhendong Hao & Huihong Peng & Longkun Guo, 2021. "Improved Constrained k -Means Algorithm for Clustering with Domain Knowledge," Mathematics, MDPI, vol. 9(19), pages 1-14, September.
    2. Xiaoyun Tian & Dachuan Xu & Donglei Du & Ling Gai, 2022. "The spherical k-means++ algorithm via local search scheme," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2375-2394, November.
    3. Chenchen Wu & Donglei Du & Yue Kang, 0. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    4. Min Li, 0. "The bi-criteria seeding algorithms for two variants of k-means problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    5. Chenchen Wu & Donglei Du & Yue Kang, 2022. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1680-1692, October.
    6. Sai Ji & Dachuan Xu & Longkun Guo & Min Li & Dongmei Zhang, 2022. "The seeding algorithm for spherical k-means clustering with penalties," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1977-1994, October.
    7. Sai Ji & Dachuan Xu & Longkun Guo & Min Li & Dongmei Zhang, 0. "The seeding algorithm for spherical k-means clustering with penalties," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.

    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:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00537-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.