IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i8d10.1007_s00180-025-01616-3.html
   My bibliography  Save this article

An improved preconditioned unsupervised K-means clustering algorithm

Author

Listed:
  • Tiantian Sun

    (South China Normal University
    Xiangtan University)

  • Xiaofei Peng

    (South China Normal University)

  • Wenxiu Ge

    (South China Normal University)

  • Weiwei Xu

    (Nanjing University of Information Science and Technology)

Abstract

The Unsupervised K-means clustering (UKM) algorithm has attracted the attention of many researchers because it can automatically identify the number of clusters without requiring any parameter selection. However, it may produce poor clustering results on datasets with Gaussian mixtures. In this paper, we consider the preconditioned UKM algorithm, where the truncated UKM algorithm is first used as a preconditioning strategy. To further enhance the algorithm’s performance, we introduce a circular modification strategy. In particular, we determine whether to use the above strategies based on the Bayesian Information Criterion (BIC). The experimental results reveal that the proposed algorithms have a higher clustering accuracy than the UKM algorithm when applied to Gaussian mixture datasets.

Suggested Citation

  • Tiantian Sun & Xiaofei Peng & Wenxiu Ge & Weiwei Xu, 2025. "An improved preconditioned unsupervised K-means clustering algorithm," Computational Statistics, Springer, vol. 40(8), pages 4187-4207, November.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:8:d:10.1007_s00180-025-01616-3
    DOI: 10.1007/s00180-025-01616-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-025-01616-3
    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/s00180-025-01616-3?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:compst:v:40:y:2025:i:8:d:10.1007_s00180-025-01616-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.