Title

Efficient Cluster Identification Algorithm

Document Type

Article

Peer Reviewed

1

Publication Date

1-1-1987

Journal/Book/Conference Title

IEEE Transactions on Systems, Man and Cybernetics

Abstract

Clustering of large-scale binary matrices requires a considerable computational effort. In some cases this effort is lost since the matrix is not decomposable into mutually separable submatrices. A cluster identification algorithm that has relatively low computational time complexity O(2mn) is developed. It allows checking for the existence of clusters and determines the number of mutually separable clusters. A modified cluster-identification algorithm for clustering nondiagonally structured matrices is also presented. The two algorithms are illustrated by numerical examples.

Keywords

Sustainability

Published Article/Book Citation

IEEE Transactions on Systems, Man and Cybernetics, SMC-17:4 (1987) pp.696-699.

This document is currently not available here.

Share

COinS
 

URL

http://ir.uiowa.edu/mie_pubs/79