IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i4d10.1007_s10878-021-00737-x.html
   My bibliography  Save this article

The spherical k-means++ algorithm via local search scheme

Author

Listed:
  • Xiaoyun Tian

    (Beijing University of Technology)

  • Dachuan Xu

    (Beijing University of Technology)

  • Donglei Du

    (University of New Brunswick)

  • Ling Gai

    (Donghua University)

Abstract

The spherical k-means problem (SKMP) is an important variant of the k-means clustering problem (KMP). In this paper, we consider the SKMP, which aims to divide the n points in a given data point set $${\mathcal {S}}$$ S into k clusters so as to minimize the total sum of the cosine dissimilarity measure from each data point to their respective closest cluster center. Our main contribution is to design an expected constant approximation algorithm for the SKMP by integrating the seeding algorithm for the KMP and the local search technique. By utilizing the structure of the clusters, we further obtain an improved LocalSearch++ algorithm involving $$\varepsilon k$$ ε k local search steps.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00737-x
    DOI: 10.1007/s10878-021-00737-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00737-x
    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-021-00737-x?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. Min Li & Dachuan Xu & Dongmei Zhang & Juan Zou, 2020. "The seeding algorithms for spherical k-means clustering," Journal of Global Optimization, Springer, vol. 76(4), pages 695-708, April.
    2. Hornik, Kurt & Feinerer, Ingo & Kober, Martin & Buchta, Christian, 2012. "Spherical k-Means Clustering," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 50(i10).
    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. 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.
    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. Yishui Wang & Chenchen Wu & Dongmei Zhang & Juan Zou, 2022. "An approximation algorithm for the spherical k-means problem with outliers by local search," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2410-2422, November.
    5. Curci, Ylenia & Mongeau Ospina, Christian A., 2016. "Investigating biofuels through network analysis," Energy Policy, Elsevier, vol. 97(C), pages 60-72.
    6. Egu, Oscar & Bonnel, Patrick, 2021. "Medium-term public transit route ridership forecasting: What, how and why? A case study in Lyon," Transport Policy, Elsevier, vol. 105(C), pages 124-133.
    7. Min Li & Dachuan Xu & Dongmei Zhang & Juan Zou, 2020. "The seeding algorithms for spherical k-means clustering," Journal of Global Optimization, Springer, vol. 76(4), pages 695-708, April.
    8. Lazar, Drew & Lin, Lizhen, 2017. "Scale and curvature effects in principal geodesic analysis," Journal of Multivariate Analysis, Elsevier, vol. 153(C), pages 64-82.
    9. Lüdering Jochen & Winker Peter, 2016. "Forward or Backward Looking? The Economic Discourse and the Observed Reality," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 236(4), pages 483-515, August.
    10. Jinqi Su & Changhong Dong & Ke Su & Lin He, 2023. "Research on the Construction of Digital Economy Index System Based on K-means-SA Algorithm," SAGE Open, , vol. 13(4), pages 21582440231, December.
    11. Arthur Pewsey & Eduardo García-Portugués, 2021. "Recent advances in directional statistics," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 1-58, March.
    12. Francesco Trebbi & Eric Weese, 2019. "Insurgency and Small Wars: Estimation of Unobserved Coalition Structures," Econometrica, Econometric Society, vol. 87(2), pages 463-496, March.
    13. 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.
    14. 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.
    15. Fei Chen & Zhiyang Wang & Yu He, 2023. "A Deep Neural Network-Based Optimal Scheduling Decision-Making Method for Microgrids," Energies, MDPI, vol. 16(22), pages 1-17, November.
    16. Dong, Aqi & Melnykov, Volodymyr, 2024. "Contaminated Kent mixture model for clustering non-spherical directional data with heavy tails or scatter," Statistics & Probability Letters, Elsevier, vol. 208(C).
    17. Peipei You & Sitao Li & Chengren Li & Chao Zhang & Hailang Zhou & Huicai Wang & Huiru Zhao & Yihang Zhao, 2023. "Price-Based Demand Response: A Three-Stage Monthly Time-of-Use Tariff Optimization Model," Energies, MDPI, vol. 16(23), pages 1-20, November.
    18. repec:kob:wpaper:1628 is not listed on IDEAS
    19. Swapnajit Chakraborti & Shubhamoy Dey, 2019. "Analysis of Competitor Intelligence in the Era of Big Data: An Integrated System Using Text Summarization Based on Global Optimization," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 61(3), pages 345-355, June.
    20. Quanmin Guo & Jiahao Liang & Hanlei Wang, 2023. "Night Vision Anti-Halation Algorithm of Different-Source Image Fusion Based on Low-Frequency Sequence Generation," Mathematics, MDPI, vol. 11(10), pages 1-24, May.
    21. Juan José Fernández-Durán & María Mercedes Gregorio-Domínguez, 2021. "Consumer Segmentation Based on Use Patterns," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 72-88, April.

    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:4:d:10.1007_s10878-021-00737-x. 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.