2011 | OriginalPaper | Buchkapitel
Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
verfasst von : Charu Puri, Naveen Kumar
Erschienen in: Transactions on Rough Sets XIV
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.