An incremental clustering algorithm based on compact sets with radius α

Abstract

In this paper, we present an incremental clustering algorithm in the logical combinatorial approach to pattern recognition, which finds incrementally the β0-compact sets with radius a of an object collection. The proposed algorithm allows generating an intermediate subset of clusters between the β0-connected components and β0-compact sets (including both of them as particular cases). The evaluation experiments on standard document collections show that the proposed algorithm out-performs the algorithms that obtain the β0-connected components and the β0-compact sets. © Springer-Verlag Berlin Heidelberg 2005.