2007
DOI: 10.1109/tsmcb.2007.906578
|View full text |Cite
|
Sign up to set email alerts
|

Rough Set Based Generalized Fuzzy $C$ -Means Algorithm and Quantitative Indices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
95
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 206 publications
(95 citation statements)
references
References 14 publications
0
95
0
Order By: Relevance
“…The diagram represented below describes the division of the system, the processes performed by it and the flow of information across the modules of the system. And the new centroid may be calculated based on the weighting average of the crisp lower approximation and fuzzy boundary for better results [7]. The notion of rough sets was introduced by Pawlak [6] in the year 1982 as an extension of the crisp sets.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The diagram represented below describes the division of the system, the processes performed by it and the flow of information across the modules of the system. And the new centroid may be calculated based on the weighting average of the crisp lower approximation and fuzzy boundary for better results [7]. The notion of rough sets was introduced by Pawlak [6] in the year 1982 as an extension of the crisp sets.…”
Section: Methodsmentioning
confidence: 99%
“…Each partition is represented by a set of three parameters, namely, a cluster prototype (centroid), a crisp lower approximation, and a fuzzy boundary. approximation influencing the fuzziness of the final partition may be obtained [7].…”
Section: It Involvesmentioning
confidence: 99%
See 1 more Smart Citation
“…In the article [22], the CGS algorithm was applied on only two Axial-T2 MR images and was not compared previously with any existing clustering methods. In this paper, the proposed methodology is applied on six Axial-T2 MR images and a comparative study is done with PSO [23], K-Means [29] and FCM [30] based segmentation methods with both qualitative and quantitative measurement index (i.e Dunn Index [24,25]). Finally, statistical significance in the performances of the methods has been tested.…”
Section: Related Workmentioning
confidence: 99%
“…In the proposed method, a quantitative measurement index called as Dunn Index [24,25] is used to measure the performance of clustering algorithm. Dunn index is defined as following:…”
Section: Fig 2 An Example Of a Part Of Genotypementioning
confidence: 99%