“…In order to avoid the limitations of well known clustering algorithms such as the hierarchical methods, the k -means, the fuzzy means, and the Expectation Maximization algorithm (Everitt et al, 2001, Bardaine et al, 2006, Becker et al, 2006, we propose a fast, sequential, graph based algorithm that exploits the structure of the similarity graph and produces a single cluster in each iteration. The proposed algorithm (Pikoulis et al, 2006) emphasizes on the quality of the produced clusters by introducing a suitable measure to evaluate the participation of each object to a cluster and by expressing the overall quality of the cluster as a function of the participations of the individuals that comprise it. Each iteration is a two -step procedure.…”