IDEAS home Printed from https://ideas.repec.org/a/igg/jdwm00/v8y2012i4p82-107.html
   My bibliography  Save this article

Weighted Fuzzy-Possibilistic C-Means Over Large Data Sets

Author

Listed:
  • Renxia Wan

    (School of Electronics and Information Engineering, Tongji University, Shanghai, China & College of Information and Computation Science, Beifang University of Nationalities, Yinchuan, Ningxia, China)

  • Yuelin Gao

    (College of Information and Computation Science, Beifang University of Nationalities, Yinchuan, Ningxia, China)

  • Caixia Li

    (Information Office, Donghua University, Shanghai, China)

Abstract

Up to now, several algorithms for clustering large data sets have been presented. Most clustering approaches for data sets are the crisp ones, which cannot be well suitable to the fuzzy case. In this paper, the authors explore a single pass approach to fuzzy possibilistic clustering over large data set. The basic idea of the proposed approach (weighted fuzzy-possibilistic c-means, WFPCM) is to use a modified possibilistic c-means (PCM) algorithm to cluster the weighted data points and centroids with one data segment as a unit. Experimental results on both synthetic and real data sets show that WFPCM can save significant memory usage when comparing with the fuzzy c-means (FCM) algorithm and the possibilistic c-means (PCM) algorithm. Furthermore, the proposed algorithm is of an excellent immunity to noise and can avoid splitting or merging the exact clusters into some inaccurate clusters, and ensures the integrity and purity of the natural classes.

Suggested Citation

  • Renxia Wan & Yuelin Gao & Caixia Li, 2012. "Weighted Fuzzy-Possibilistic C-Means Over Large Data Sets," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 8(4), pages 82-107, October.
    • Handle: RePEc:igg:jdwm00:v:8:y:2012:i:4:p:82-107
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdwm.2012100104
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jdwm00:v:8:y:2012:i:4:p:82-107. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.