Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
