Relational Gustafson Kessel Clustering Using Medoids and Triangulation
Thomas A. Runkler · 2005
This paper deals with clustering relational data that can be (at least approximately) represented by object data with ellipsoidal clusters. Conventional relational clustering models such as relational fuzzy c-means or relational fuzzy c-medoids produce bad results for this family of relational data, because they do not consider the cluster shape. In this paper, we develop a Gustafson Kessel model where the cluster centers are medoids. For relational data, the scatter matrices and the matrix distances are locally computed using triangulation. The resulting RGKMdd algorithm produces very good results for the family of relational data specified above