Parallel Fuzzy c-Means Clustering for Large Data Sets

@inproceedings{Kwok2002ParallelFC,
  title={Parallel Fuzzy c-Means Clustering for Large Data Sets},
  author={Terence Kwok and Kate Smith-Miles and Sebasti{\'a}n Lozano and David Taniar},
  booktitle={Euro-Par},
  year={2002}
}
The parallel fuzzy c-means (PFCM) algorithm for clustering large data sets is proposed in this paper. The proposed algorithm is designed to run on parallel computers of the Single Program Multiple Data (SPMD) model type with the Message Passing Interface (MPI). A comparison is made between PFCM and an existing parallel k-means (PKM) algorithm in terms of their parallelisation capability and scalability. In an implementation of PFCM to cluster a large data set from an insurance company, the… CONTINUE READING
Highly Cited
This paper has 70 citations. REVIEW CITATIONS
42 Citations
12 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

71 Citations

01020'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

A Parallel k-Prototypes Algorithm for Clustering Large Data Sets in Data Mining

  • M. K. Ng, H. Zhexue
  • Intelligent Data Engineering and Learning. 3
  • 1999
1 Excerpt

A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact, Well-separated Clusters

  • J. C. Dunn
  • J. Cybernetics. 3
  • 1973
3 Excerpts

Similar Papers

Loading similar papers…