A new algorithm for community identification in linked data

Abstract

In this paper, we propose four specifications which can be used for the evaluation of community identification algorithms. Furthermore, a novel algorithm VHITS meeting the four established specifications is presented. Basically, VHITS is based on a two-step approach. In the first step, the Nonnegative Matrix Factorization is used to estimate the community memberships. In the second step, a voting scheme is employed to identify the hubs and authorities of each community. VHITS is then compared to the HITS and PHITS algorithms. Experimental results show that VHITS is more adapted than HITS and PHITS to the task of community identification in citation networks. © 2008 Springer-Verlag Berlin Heidelberg.