The Star algorithm is an effective and efficient algorithm for graph clustering. We propose a series of novel, yet simple, metrics for the selection of Star centers in the Star algorithm and its variants. We empirically study the performance of off-line, standard and extended, and on-line versions of the Star algorithm adapted to the various metrics and show that one of the proposed metrics outperforms all others in both effectiveness and efficiency of clustering. We empirically study the sensitivity of the metrics to the threshold value of the algorithm and show improvement with respect to this aspect too. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Wijaya, D. T., & Bressan, S. (2007). Journey to the centre of the star: Various ways of finding star centers in star clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4653 LNCS, pp. 660–670). Springer Verlag. https://doi.org/10.1007/978-3-540-74469-6_64
Mendeley helps you to discover research relevant for your work.