IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v76y2020i4d10.1007_s10898-019-00779-w.html
   My bibliography  Save this article

The seeding algorithms for spherical k-means clustering

Author

Listed:
  • Min Li

    (Shandong Normal University)

  • Dachuan Xu

    (Beijing University of Technology)

  • Dongmei Zhang

    (Shandong Jianzhu University)

  • Juan Zou

    (Qufu Normal University)

Abstract

In order to cluster the textual data with high dimension in modern data analysis, the spherical k-means clustering is presented. It aims to partition the given points with unit length into k sets so as to minimize the within-cluster sum of cosine dissimilarity. In this paper, we mainly study seeding algorithms for spherical k-means clustering, for its special case (with separable sets), as well as for its generalized problem ($$\alpha $$α-spherical k-means clustering). About the spherical k-means clustering with separable sets, an approximate algorithm with a constant factor is presented. Moreover, it can be generalized to the $$\alpha $$α-spherical separable k-means clustering. By slickly constructing a useful function, we also show that the famous seeding algorithms such as k-means++ and k-means|| for k-means problem can be applied directly to solve the $$\alpha $$α-spherical k-means clustering. Except for theoretical analysis, the numerical experiment is also included.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:76:y:2020:i:4:d:10.1007_s10898-019-00779-w
    DOI: 10.1007/s10898-019-00779-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00779-w
    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/s10898-019-00779-w?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. 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).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.

    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. Curci, Ylenia & Mongeau Ospina, Christian A., 2016. "Investigating biofuels through network analysis," Energy Policy, Elsevier, vol. 97(C), pages 60-72.
    2. Lazar, Drew & Lin, Lizhen, 2017. "Scale and curvature effects in principal geodesic analysis," Journal of Multivariate Analysis, Elsevier, vol. 153(C), pages 64-82.
    3. 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.
    4. 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.
    5. 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.
    6. Francesco Trebbi & Eric Weese, 2019. "Insurgency and Small Wars: Estimation of Unobserved Coalition Structures," Econometrica, Econometric Society, vol. 87(2), pages 463-496, March.
    7. 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).
    8. 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.
    9. 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.
    10. Diana Purwitasari & Chastine Fatichah & Surya Sumpeno & Christian Steglich & Mauridhi Hery Purnomo, 2020. "Identifying collaboration dynamics of bipartite author-topic networks with the influences of interest changes," Scientometrics, Springer;Akadémiai Kiadó, vol. 122(3), pages 1407-1443, March.
    11. Adelaide Figueiredo, 2017. "Clustering Directions Based on the Estimation of a Mixture of Von Mises-Fisher Distributions," The Open Statistics and Probability Journal, Bentham Open, vol. 8(1), pages 39-52, December.
    12. Xavier Bry & Lionel Cucala, 2022. "A von Mises–Fisher mixture model for clustering numerical and categorical variables," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 16(2), pages 429-455, June.
    13. 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.
    14. repec:kob:wpaper:1628 is not listed on IDEAS
    15. Sergio Bolívar & Alicia Nieto-Reyes & Heather L. Rogers, 2023. "Statistical Depth for Text Data: An Application to the Classification of Healthcare Data," Mathematics, MDPI, vol. 11(1), pages 1-20, January.
    16. Kirschstein, Thomas & Liebscher, Steffen & Pandolfo, Giuseppe & Porzio, Giovanni C. & Ragozini, Giancarlo, 2019. "On finite-sample robustness of directional location estimators," Computational Statistics & Data Analysis, Elsevier, vol. 133(C), pages 53-75.
    17. 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.

    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:jglopt:v:76:y:2020:i:4:d:10.1007_s10898-019-00779-w. 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.