The traditional Fuzzy C-means (FCM) algorithm is stable and easy to be implemented. However, the data elements in the cluster boundary of FCM are easily clustered into incorrect classes making the efficiency of FCM algorithm reduced. Aiming at solving this problem, this paper presents a Rough-FCM algorithm which is combined FCM algorithm with rough set according to new equations. We take the advantage of the positive region set and the boundary region set of rough set. First, Rough-FCM algorithm divides the data elements into the positive region set or the boundary region set of all classes according to the threshold we set. Second, it updates the cluster centers and membership matrixes with new equations. Thus, we can execute the second clustering based on first clustering of FCM. By comparing the experimental results of the Rough-FCM with K-means, DBSCAN and FCM according to four clustering evaluation indexes on both synthetic and real datasets, we evaluate our proposed algorithm and improve outcomes from most of datasets by adopting these three classic clustering algorithms mentioned above.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.