Abstract
Clustering large data has the problem of not having all the data fit in the memory at one time. It is a challenge to apply fuzzy clustering algorithms to get a partition in a timely manner. In this paper, we compare the online fuzzy clustering and single pass fuzzy clustering algorithms, which can be used to cluster very large data sets which might be treated as streaming data, with fuzzy c-means. We introduce more meaningful partition comparison measurements based on cluster center location instead of using the difference in R <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> value. We obtained results on several large volumes of magnetic resonance images which indicate that the online FCM algorithm produces partitions which are very close to what you could get if you clustered all the data at one time. We also show online FCM outperforms single pass FCM and it can process streaming data as it comes without degradation in most cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
