In this paper we present a graph-based clustering method particularly suited for dealing with data that do not come from a Gaussian or a spherical distribution. It can be used for detecting clusters of any size and shape, without the need of specifying neither the actual number of clusters nor other parameters. The method has been tested on data coming from two different computer vision applications. A comparison with other three state-of-the-art algorithms was also provided, demonstrating the effectiveness of the proposed approach. © 2007 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Foggia, P., Percannella, G., Sansone, C., & Vento, M. (2007). A graph-based clustering method and its applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4729 LNCS, pp. 277–287). https://doi.org/10.1007/978-3-540-75555-5_26
Mendeley helps you to discover research relevant for your work.