Share Email Print

Proceedings Paper

Note on two clustering algorithms for relational network data
Author(s): James C. Bezdek; Richard J. Hathaway
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 1 January 1990
PDF: 10 pages
Proc. SPIE 1293, Applications of Artificial Intelligence VIII, (1 January 1990); doi: 10.1117/12.21077
Show Author Affiliations
James C. Bezdek, Univ. of West Florida (United States)
Richard J. Hathaway, Georgia Southern College (United States)

Published in SPIE Proceedings Vol. 1293:
Applications of Artificial Intelligence VIII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top