作者: Niina Päivinen
DOI: 10.1016/J.PATREC.2004.09.039
关键词:
摘要: In this study a novel approach to graph-theoretic clustering is presented. A algorithm which uses structure called scale-free minimum spanning tree presented and its performance compared with standard k-means methods. The results show that the proposed method potential procedure after some further analysis done.