21 March 2001 Relational data clustering with incomplete data
Author Affiliations +
Abstract
We consider the problem of clustering a set of objects which are represented by rational data in the form of a dissimilarity matrix which has missing values. Three methods are developed to estimate the missing values, all based on simple triangle inequality-based approximation schemes. With few exceptions, any relational clustering algorithm can then be applied to the completed data matrix to obtain nice clusters. We illustrate our approach by clustering incomplete data built from several data sets. The primary clustering method chosen for our numerical experiments is the non-Euclidean relational fuzzy c-means algorithm. Our examples show that satisfactory clusters can still be obtained even when roughly half of the distance values are missing before completion.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Richard J. Hathaway, Richard J. Hathaway, Dessa D. Overstreet, Dessa D. Overstreet, Thomas E. Murphy, Thomas E. Murphy, James C. Bezdek, James C. Bezdek, } "Relational data clustering with incomplete data", Proc. SPIE 4390, Applications and Science of Computational Intelligence IV, (21 March 2001); doi: 10.1117/12.421178; https://doi.org/10.1117/12.421178
PROCEEDINGS
8 PAGES


SHARE
Back to Top