2012
DOI: 10.5402/2012/929085
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Fuzzy C-Means Clustering with Improved Fuzzy Partitions and Shadowed Sets

Abstract: Clustering involves grouping data points together according to some measure of similarity. Clustering is one of the most significant unsupervised learning problems and do not need any labeled data. There are many clustering algorithms, among which fuzzy c-means (FCM) is one of the most popular approaches. FCM has an objective function based on Euclidean distance. Some improved versions of FCM with rather different objective functions are proposed in recent years. Generalized Improved fuzzy partitions FCM (GIFP… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 17 publications
(19 reference statements)
0
4
0
Order By: Relevance
“…The corpus has 30,000 annotated sentences that are not classified (about 49,8000 words). Therefore, a fuzzy c‐means clustering algorithm (Zabihi & Akbarzadeh, ) was performed in order to make the corpus applicable for test on the ontology. About 73 different clusters were found, of which four clusters were selected (peaks of clusters by number of documents), but the number of classified documents in each cluster still were not sufficient.…”
Section: Resultsmentioning
confidence: 99%
“…The corpus has 30,000 annotated sentences that are not classified (about 49,8000 words). Therefore, a fuzzy c‐means clustering algorithm (Zabihi & Akbarzadeh, ) was performed in order to make the corpus applicable for test on the ontology. About 73 different clusters were found, of which four clusters were selected (peaks of clusters by number of documents), but the number of classified documents in each cluster still were not sufficient.…”
Section: Resultsmentioning
confidence: 99%
“…Several fuzzy clustering algorithms employ distance criteria including FCM, which uses reverse distance for fuzzy membership. In this case, feature vectors are part of all clusters with a zero to one coefficient (Webb 2003;Zabihi and Akbarzadeh-T 2012) .…”
Section: Fuzzy C-means (Fcm) Clusteringmentioning
confidence: 99%
“…Because of the constraints in ( 1 ), all points must completely allocate their memberships to each cluster [ 19 ]. The fuzzy weight centre of gravity of the data is used to define the cluster centre (centroid)X.…”
Section: The Proposed Mr-lsdgm Techniquementioning
confidence: 99%