Local Community Detection in Dynamic Graphs Using Personalized Centrality†
AbstractAnalyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive. Furthermore, many real data sets are constantly changing, and require algorithms to update as the graph evolves. This work addresses the topic of local community detection, or seed set expansion, using personalized centrality measures, specifically PageRank and Katz centrality. We present a method to efficiently update local communities in dynamic graphs. By updating the personalized ranking vectors, we can incrementally update the corresponding local community. Applying our methods to real-world graphs, we are able to obtain speedups of up to 60× compared to static recomputation while maintaining an average recall of 0.94 of the highly ranked vertices returned. Next, we investigate how approximations of a centrality vector affect the resulting local community. Specifically, our method guarantees that the vertices returned in the community are the highly ranked vertices from a personalized centrality metric. View Full-Text
Share & Cite This Article
Nathan, E.; Zakrzewska, A.; Riedy, J.; Bader, D.A. Local Community Detection in Dynamic Graphs Using Personalized Centrality. Algorithms 2017, 10, 102.
Nathan E, Zakrzewska A, Riedy J, Bader DA. Local Community Detection in Dynamic Graphs Using Personalized Centrality. Algorithms. 2017; 10(3):102.Chicago/Turabian Style
Nathan, Eisha; Zakrzewska, Anita; Riedy, Jason; Bader, David A. 2017. "Local Community Detection in Dynamic Graphs Using Personalized Centrality." Algorithms 10, no. 3: 102.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.