2017
DOI: 10.1016/j.ins.2017.07.005
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic annealing Gustafson-Kessel fuzzy clustering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2018
2018
2025
2025

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 40 publications
0
15
0
Order By: Relevance
“…The improved possibilistic c‐means (IPCM) clustering, as a derivative algorithm of FCM and PCM, offers both the fuzzy membership values and typical values simultaneously (Zhang & Leung, 2004). Gustafson–Kessel (GK) clustering recognizes the clustering structures of different data shapes by replacing Euclidean distance with Mahalanobis distance in the objective function (Chaomurilige, Yu, & Yang, 2017). Fuzzy clustering algorithms are applied to classify tea varieties, which can achieve rapid, effective, and nondestructive identification effect.…”
Section: Introductionmentioning
confidence: 99%
“…The improved possibilistic c‐means (IPCM) clustering, as a derivative algorithm of FCM and PCM, offers both the fuzzy membership values and typical values simultaneously (Zhang & Leung, 2004). Gustafson–Kessel (GK) clustering recognizes the clustering structures of different data shapes by replacing Euclidean distance with Mahalanobis distance in the objective function (Chaomurilige, Yu, & Yang, 2017). Fuzzy clustering algorithms are applied to classify tea varieties, which can achieve rapid, effective, and nondestructive identification effect.…”
Section: Introductionmentioning
confidence: 99%
“…For partitioning the dynamic data of state variable an interval adaptive similarity mechanism is adopted to define interval operation regions represented by interval membership functions, with different formats and orientations, adapted to the topological structure associated to the variability of dynamic data, in order to minimize the filtering errors (Babuska 1998 ; Höppner et al. 1999 ; Chaomurilige and Yang 2017 ).
Fig.
…”
Section: Resultsmentioning
confidence: 99%
“…The alternative approach is to use 3D images to segment a region of interest first then perform the object classification on a much smaller 3D voxel structure which will decreases the hardware requirements needed and the computing time. Multiple studies showed that the results accuracy increases if the region of interest (ROI) is extracted first with the subsequent object classification (El-Dahshan et al, 2014;Shankar et al, 2016;Yu and Yang, 2017).…”
Section: D Analysis Vs 3d Reconstructionsmentioning
confidence: 99%
“…For brain tumor segmentation El-dashan et al were able to produce the classification accuracy of 99% using a Feedback Pulse-Coupled Neural Network (FPCNN), a type of CNN architecture, for ROI segmentation and a feed forward ANN for image classification (El-Dahshan et al, 2014). Shankar et al achieved an accuracy of 95.67% using the Gustafson-Kessel fuzzy clustering algorithm for classification (Shankar et al, 2016;Yu and Yang, 2017). Alakwaa et al's implementation used a CNN inspired architecture called U-Net to extract the ROI and the subsequent 3D CNN to classify the abnormal vs. normal tissue in the lung images (Ronneberger et al, 2015).…”
Section: Model and Diagnostic Performancementioning
confidence: 99%