IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v233y2025icp311-329.html
   My bibliography  Save this article

Improved fuzzy C-means clustering algorithm based on fuzzy particle swarm optimization for solving data clustering problems

Author

Listed:
  • Zhang, Hongkang
  • Huang, Shao-Lun

Abstract

The fuzzy c-means (FCM) clustering algorithm is adversely affected by its sensitivity to initial values and its low clustering accuracy. To mitigate these shortcomings, we proposed an improved fuzzy particle swarm optimization-fuzzy C-Means (IFPSO-FCM) algorithm to resolve the data-clustering challenges. In this algorithm, key enhancements included initializing clustering centers using Mahalanobis distances to alleviate the sensitivity to initial values. An objective function based on both inter- and intra-cluster evaluations was proposed to address the premature convergence. A modified particle swarm algorithm was designed to optimize the clustering centers. The proposed algorithm was applied to analyze the IRIS and WINE datasets, as well as to cluster and segment classical test images. The results indicated that the algorithm improved the stability of the analysis results while preserving high clustering accuracy and convergence speed, achieving an excellent performance compared with existing methods. Moreover, it exhibited superior performance in the analysis of fuzzy multi-shadow gray images.

Suggested Citation

  • Zhang, Hongkang & Huang, Shao-Lun, 2025. "Improved fuzzy C-means clustering algorithm based on fuzzy particle swarm optimization for solving data clustering problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 233(C), pages 311-329.
  • Handle: RePEc:eee:matcom:v:233:y:2025:i:c:p:311-329
    DOI: 10.1016/j.matcom.2025.02.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425000485
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.02.012?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.

    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:eee:matcom:v:233:y:2025:i:c:p:311-329. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.