An extension to rough c-means clustering

Authors:
Fan Li;Qihe Liu
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 7
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
Interval Set Clustering of Web Users with Rough K-Means

Journal of Intelligent Information Systems
Some refinements of rough k-means clustering

Pattern Recognition
Shadowed c-means: Integrating fuzzy and rough clustering

Pattern Recognition
Some new indexes of cluster validity

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Rough–Fuzzy Collaborative Clustering

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

An extension to rough c-means clustering algorithm based on boundary area elements discrimination

Transactions on Rough Sets XVI

Quantified Score

Hi-index	0.00

Visualization

Abstract

The original form of the Rough c-means algorithm does not distinguish between data points in the boundary area. This paper presents an extended Rough c-means algorithm in which the distinction between data points in the boundary area is captured and used in the clustering procedure. Experimental results indicate that the proposed algorithm can yield more desirable clustering results in comparison to the original form of the Rough c-means algorithm.