IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v37y2020i04ns0217595920400059.html
   My bibliography  Save this article

The Parallel Seeding Algorithm for k-Means Problem with Penalties

Author

Listed:
  • Min Li

    (School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China)

  • Dachuan Xu

    (Department of Operations Research and Scientific Computing, Beijing University of Technology, Beijing 100124, P. R. China)

  • Jun Yue

    (School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China)

  • Dongmei Zhang

    (School of Computer Science and Technology, Shandong Jianzhu University, Jinan 250101, P. R. China)

Abstract

As a classic NP-hard problem in machine learning and computational geometry, the k-means problem aims to partition a data point set into k clusters such that the sum of the squared distance from each point to its nearest center is minimized. The k-means problem with penalties, denoted by k-MPWP, generalizing the k-means problem, allows that some points can be paid some penalties instead of being clustered. In this paper, we study the seeding algorithm of k-MPWP and propose a parallel seeding algorithm for k-MPWP along with the corresponding theoretical analysis.

Suggested Citation

  • 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.
    • Handle: RePEc:wsi:apjorx:v:37:y:2020:i:04:n:s0217595920400059
    DOI: 10.1142/S0217595920400059
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595920400059
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595920400059?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. 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.
    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.

    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:wsi:apjorx:v:37:y:2020:i:04:n:s0217595920400059. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.