Note on two clustering algorithms for relational network data
James C. Bezdek, Richard J. Hathaway · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1990
In this note we describe and compare two fuzzy clustering algorithms based on optimizing penalty functions of relational data. More specifically, the AP algorithm of Windham is contrasted to the relational fuzzy c-means approach through a numerical example on a small artificial data set defined by Windham. Our results indicate that while the two algorithms seem to cluster objects using very different mathematical criteria, the numerical results can be quite similar. However, a second numerical example using a slightly distorted version of Windham's data seems to exhibit real differences between clusterings obtained by the two approaches. We discuss possible reasons for this, and pose some questions for further research.