Comparison of Distributed K-Means and Distributed Fuzzy C-Means Algorithms for Text Clustering
Text clustering has been developed in distributed system due to increasing data. The popular algorithms like K-Means (KM) and Fuzzy C-Means (FCM) are combined with MapReduce algorithm in Hadoop Environment to be distributable and parallelizable. The problem is performance comparison between Distribu...
Main Authors: | I Made Artha Agastya, Teguh Bharata Adji, Noor Akhmad Setiawan |
---|---|
Format: | Article |
Language: | English |
Published: |
Komunitas Ilmuwan dan Profesional Muslim Indonesia
2017-06-01
|
Series: | Communications in Science and Technology |
Subjects: | |
Online Access: | https://cst.kipmi.or.id/index.php/cst/article/view/46/16 |
Similar Items
-
Distributed Text Mining in R
by: Theußl, Stefan, et al.
Published: (2011) -
A tm Plug-In for Distributed Text Mining in R
by: Stefan Theussl, et al.
Published: (2012-11-01) -
A tm Plug-In for Distributed Text Mining in R
by: Theußl, Stefan, et al.
Published: (2012) -
Power-Law Distributed Graph Generation With MapReduce
by: Renzo Angles, et al.
Published: (2021-01-01) -
Clustering large datasets using K-means modified inter and intra clustering (KM-I2C) in Hadoop
by: Chowdam Sreedhar, et al.
Published: (2017-09-01)