Abstract: AP algorithm takes all data as potential clustering centers. But it is not appropriate for subspace clustering. AP subspace clustering algorithm based on attributes relation matrix(ARMAP) is asynchronous soft subspace clustering algorithm. This algorithm first calculates attribute relation matrix through neighborhood of attribute a. The candidate of all interesting subspaces is achieved by looking for the maximum sub-matrixes of attribute relation matrix which contain only 1. Finally, all subspace clusters can be gotten through AP clustering on interesting subspaces. The method obtains interesting subspaces correctly and reduces time and space complexity at the same time. It keeps the advantages of AP clustering and overcome the shortage of it.

Key words: clustering analysis; subspace clustering; AP clustering; relation matrix