Advertisement
Published in:
2011 | OriginalPaper | Chapter
Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
Authors : Charu Puri, Naveen Kumar
Published in: Transactions on Rough Sets XIV
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Fuzzy techniques have been used for handling vague boundaries of arbitrarily oriented clusters. However, traditional clustering algorithms tend to break down in high dimensional spaces due to inherent sparsity of data. We propose a modification in the objective function of Gustafson-Kessel clustering algorithm for projected clustering and prove the convergence of the resulting algorithm. We present the results of applying the proposed projected Gustafson-Kessel clustering algorithm to synthetic and UCI data sets, and also suggest a way of extending it to a rough set based algorithm.