An Improved Random Walk Algorithm Based on Correlation Coefficient to Find Scientific Communities

Published: 01 Jan 2008, Last Modified: 06 Dec 2024CSSE (1) 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: With the growth of publishing scientific literature on the World Wide Web, there is a great demand for clustering online scientific literature by using the citation patterns. A scientific community in the citation graph represents related papers on a single topic. In this paper we improve the random walk graph clustering algorithm to find scientific communities by using correlation coefficient in the citation graph as the similarity metric. Our experiment results show that the approach performs better than the original random walk graph clustering method.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview