Path Based Clustering assigns two objects to the same cluster if they are connected by a path with high similarity between adjacent objects on the path. In this paper, we propose a fast agglomerative algorithm to minimize the Path Based Clustering cost function. To enhance the reliability of the clustering results a stochastic resampling method is used to generate candidate solutions which are merged to yield empirical assignment probabilities of objects to clusters. The resampling algorithm measures the reliability of the clustering solution and, based on their stability, determines the number of clusters. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Fischer, B., & Buhmann, J. M. (2002). Data resampling for path based clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2449 LNCS, pp. 206–214). Springer Verlag. https://doi.org/10.1007/3-540-45783-6_26
Mendeley helps you to discover research relevant for your work.