2014
DOI: 10.1016/j.fss.2013.12.011
|View full text |Cite
|
Sign up to set email alerts
|

Interval-valued possibilistic fuzzy C-means clustering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 73 publications
(28 citation statements)
references
References 21 publications
0
27
0
1
Order By: Relevance
“…Among these papers [7,16,17,[23][24][25][26]32], they were all validated using databases of real images from varied sources and in combination, used several types of validation techniques, such as a visual appreciation of the end result, recognition rate, error rate, and number of produced segments. This leads to a highly-varied collection of experimental tests performed among these papers.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Among these papers [7,16,17,[23][24][25][26]32], they were all validated using databases of real images from varied sources and in combination, used several types of validation techniques, such as a visual appreciation of the end result, recognition rate, error rate, and number of produced segments. This leads to a highly-varied collection of experimental tests performed among these papers.…”
Section: Discussionmentioning
confidence: 99%
“…In Zexuan Ji et al (2014) [7], an interval-valued possibilistic fuzzy c-means clustering algorithm was proposed which uses fuzzy memberships and possibilistic typicalities in order to model uncertainty from data, thus overcoming footprint of uncertainty selection, type-reduction and defuzzification, which tend to require complex solutions for T2 FLS. The effectiveness of this approach was verified with image segmentation datasets from brain magnetic resonances as well as natural images.…”
Section: T2 Fs In Image Segmentationmentioning
confidence: 99%
See 1 more Smart Citation
“…(3) The land-use types are classified by FCM with different fuzzifiers, and the results are integrated using IT2 FS [6]. Due to its ability to handle the uncertainty of membership values, the IT2FCM is widely used, and many derivative methods of IT2FCM have been developed, including the interval type-2 fuzzy possibilistic C-means (IFPCM) [7], interval-valued possibilistic fuzzy C-means (IPFCM) [8], general type-2 fuzzy C-means (GT2 FCM) [9], interval type-2 fuzzy C-means clustering with spatial information (IIT2-FCM) [10], and kernel interval-valued fuzzy C-Means (KIFCM) clustering algorithms [11]. As noted by Zarinbal et al [12], in some of these methods, the type-2 fuzzy membership functions are defuzzified into type-1 fuzzy membership functions during each iteration, and the distances between a sample and cluster centers should be expressed as singleton values when used to calculate the lower and upper membership grades in a certain class; otherwise, in these cases, some information would be lost.…”
Section: Introductionmentioning
confidence: 99%
“…In general, the fuzzy C-means algorithm (FCM) [7][8][9][10][11][12] is more effective.FCM allows pixels to have relation with multiple clusters with varying degrees of membership. The conventional FCM algorithm is quite difficult to deal with patterns with different volumes.…”
Section: Introductionmentioning
confidence: 99%