Norie Fu1, Vorapong Suppakitpaisarn1,2. 1. JST, ERATO Kawarabayashi Large Graph Project, Global Research Center for Big Data Mathematics, National Institute of Informatics (NII), 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-0003 Japan. 2. Department of Computer Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033 Japan.
Abstract
BACKGROUND: While the temporal networks have a wide range of applications such as opportunistic communication, there are not many clustering algorithms specifically proposed for them. METHODS: Based on betweenness centrality for periodic graphs, we give a clustering pseudo-polynomial time algorithm for temporal networks, in which the transit value is always positive and the least common multiple of all transit values is bounded. RESULTS: Our experimental results show that the centrality of networks with 125 nodes and 455 edges can be efficiently computed in 3.2 s. Not only the clustering results using the infinite betweenness centrality for this kind of networks are better, but also the nodes with biggest influences are more precisely detected when the betweenness centrality is computed over the periodic graph. CONCLUSION: The algorithm provides a better result for temporal social networks with an acceptable running time.
BACKGROUND: While the temporal networks have a wide range of applications such as opportunistic communication, there are not many clustering algorithms specifically proposed for them. METHODS: Based on betweenness centrality for periodic graphs, we give a clustering pseudo-polynomial time algorithm for temporal networks, in which the transit value is always positive and the least common multiple of all transit values is bounded. RESULTS: Our experimental results show that the centrality of networks with 125 nodes and 455 edges can be efficiently computed in 3.2 s. Not only the clustering results using the infinite betweenness centrality for this kind of networks are better, but also the nodes with biggest influences are more precisely detected when the betweenness centrality is computed over the periodic graph. CONCLUSION: The algorithm provides a better result for temporal social networks with an acceptable running time.
Entities:
Keywords:
Clustering algorithm; Efficient algorithms for social computing; Opportunistic network; Periodic graph; Social influence
Authors: Lucas Lacasa; Bartolo Luque; Fernando Ballesteros; Jordi Luque; Juan Carlos Nuño Journal: Proc Natl Acad Sci U S A Date: 2008-03-24 Impact factor: 11.205