By Topic

A note on the Gustafson-Kessel and adaptive fuzzy clustering algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Krishnapuram, R. ; Dept. of Math. & Comput. Sci., Colorado Sch. of Mines, Golden, CO, USA ; Kim, J.

In this letter, we show that the Gustafson-Kessel (G-K) algorithm (1979) and the original adaptive fuzzy clustering (AFC) algorithm can be thought of as special cases of a more general algorithm. Our analysis shows that the G-K algorithm is better suited for ellipsoidal clusters of equal volume, whereas the original AFC algorithm is better suited for linear clusters. We also discuss a new variation of these algorithms, which can be used to improve the results of the G-K and AFC algorithms in some cases

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:7 ,  Issue: 4 )