Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/41071
Title: Journey to the centre of the star: Various ways of finding star centers in star clustering
Authors: Wijaya, D.T.
Bressan, S. 
Issue Date: 2007
Source: Wijaya, D.T.,Bressan, S. (2007). Journey to the centre of the star: Various ways of finding star centers in star clustering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4653 LNCS : 660-670. ScholarBank@NUS Repository.
Abstract: 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.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/41071
ISBN: 9783540744672
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

50
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.