Translator Disclaimer
Paper
1 January 1990 Note on two clustering algorithms for relational network data
Author Affiliations +
Abstract
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
James C. Bezdek and Richard J. Hathaway "Note on two clustering algorithms for relational network data", Proc. SPIE 1293, Applications of Artificial Intelligence VIII, (1 January 1990); https://doi.org/10.1117/12.21077
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top