• DocumentCode
    3315744
  • Title

    Single Pass Fuzzy C Means

  • Author

    Hore, Prodip ; Hall, Lawrence O. ; Goldgof, Dmitry B.

  • Author_Institution
    Univ. of South Florida, Tampa
  • fYear
    2007
  • fDate
    23-26 July 2007
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    Recently several algorithms for clustering large data sets or streaming data sets have been proposed. Most of them address the crisp case of clustering, which cannot be easily generalized to the fuzzy case. In this paper, we propose a simple single pass (through the data) fuzzy c means algorithm that neither uses any complicated data structure nor any complicated data compression techniques, yet produces data partitions comparable to fuzzy c means. We also show our simple single pass fuzzy c means clustering algorithm when compared to fuzzy c means produces excellent speed-ups in clustering and thus can be used even if the data can be fully loaded in memory. Experimental results using five real data sets are provided.
  • Keywords
    fuzzy set theory; pattern clustering; data streaming; large data set clustering; single pass fuzzy C means algorithm; Clustering algorithms; Data analysis; Data compression; Data structures; Fuzzy sets; Image sampling; Intrusion detection; Partitioning algorithms; Sampling methods; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems Conference, 2007. FUZZ-IEEE 2007. IEEE International
  • Conference_Location
    London
  • ISSN
    1098-7584
  • Print_ISBN
    1-4244-1209-9
  • Electronic_ISBN
    1098-7584
  • Type

    conf

  • DOI
    10.1109/FUZZY.2007.4295372
  • Filename
    4295372