Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
The smart document retrieval project
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
The cluster hypothesis revisited
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Static and dynamic information organization with star clusters
Proceedings of the seventh international conference on Information and knowledge management
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Ricochet: A Family of Unconstrained Algorithms for Graph Clustering
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
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.