Wanyun Cui
ABSTRACT
Community search is important in social network analysis. For a given vertex in a graph, the goal is to find the best community the vertex belongs to. Intuitively, the best community for a given vertex should be in the vicinity of the vertex. However, existing solutions use \emph{global search} to find the best community. These algorithms, although straight-forward, are very costly, as all vertices in the graph may need to be visited. In this paper, we propose a \emph{local search} strategy, which searches in the neighborhood of a vertex to find the best community for the vertex. We show that, because the minimum degree measure used to evaluate the goodness of a community is not \emph{monotonic}, designing efficient local search solutions is a very challenging task. We present theories and algorithms of local search to address this challenge. The efficiency of our local search strategy is verified by extensive experiments on both synthetic networks and a variety of real networks with millions of nodes.
- M. E. J. Newman et al., "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, no. 2, p. 026113.Google Scholar
Cross Ref
- A. Broder et al., "Graph structure in the web," Comput. Netw., vol. 33, no. 1-6, pp. 309--320, June 2000. Google ScholarDigital Library
- G. Palla et al., "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, no. 7043, pp. 814--818.Google ScholarCross Ref
- R. Guimera et al., "Functional cartography of complex metabolic networks," Nature, vol. 433, no. 7028, pp. 895--900.Google ScholarCross Ref
- M. Sozio et al., "The community-search problem and how to plan a successful cocktail party," in KDD'10. Google ScholarDigital Library
- H. Zhuge et al., "Query routing in a peer-to-peer semantic link network," Computational Intelligience, vol. 21, no. 2, pp. 197--216.Google ScholarCross Ref
- B. Bollobás, "The evolution of sparse graphs," Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honor of Paul Erdos, Academic Press, pp. 35-57.Google Scholar
- M. Gaertler et al., "Dynamic analysis of the autonomous system graph," in IPS 2004, pp. 13--24Google Scholar
- S. B. Seidman., "Network structure and minimum degree," Social Networks, Vol. 5, pp. 269--287.Google ScholarCross Ref
- S. N. Dorogovtsev et al., "k-core organization of complex networks," Phys. Rev. Lett. Vol.96, pp. 040601.Google ScholarCross Ref
- A. Mislove et al., "Measurement and analysis of online social networks," in IMC'07. Google ScholarDigital Library
- A. Lancichinetti et al., "Benchmark graphs for testing community detection algorithms," Phys. Rev. E, vol. 78, no. 4, p. 046110.Google ScholarCross Ref
- U. Brandes et al., "On modularity clustering," TKDE, vol. 20, no. 2, pp. 172--188. Google ScholarDigital Library
- S. Fortunato et al., "Resolution limit in community detection," PNAS, vol. 104, no. 1, p. 36.Google Scholar
- U. N. Raghavan et al., "Near linear time algorithm to detect community structures in large-scale networks," Phys.Rev.E, vol. 76, p. 036106.Google ScholarCross Ref
- I. X. Y. Leung et al., "Towards real-time community detection in large networks," Phys.Rev.E, vol. 79, p. 066107.Google ScholarCross Ref
- K. Macropol et al., "Scalable discovery of best clusters on large graphs," in VLDB'10. Google ScholarDigital Library
- V. Satuluri et al., "Local graph sparsification for scalable clustering," in SIGMOD '11. Google ScholarDigital Library
- G. Palla et al., "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, no. 7043, pp. 814--818.Google ScholarCross Ref
- I. Derenyi et al., "Clique percolation in random networks," Phys. Rev. Letters, vol. 94, no. 16, p. 160202.Google ScholarCross Ref
- J. Reichardt et al., "Detecting fuzzy community structures in complex x networks with a potts model," Phys. Rev. Letters, vol. 93, no. 21, p. 218701.Google ScholarCross Ref
- Y. Zhou et al., "Graph clustering based on structural/attribute similarities," in VLDB'09. Google ScholarDigital Library
- B. Bollobas, Random Graphs. Cambridge University Press, 2001.Google Scholar
- M. E. J. Newman et al., "Random graphs with arbitrary degree distributions and their applications," Phys. Rev. E, vol. 64, no. 2, p. 026118.Google ScholarCross Ref
- B. Pittel et al., "Sudden emergence of a giant k-core in a random graph," J. Comb. Theory Ser. B, vol. 67, pp. 111--151. Google ScholarDigital Library
- J. I. Alvarez-hamelin et al., "Large scale networks fingerprinting and visualization using the k-core decomposition," in NIPS'06.Google Scholar
- S. Carmi et al., "From the cover: A model of internet topology using k-shell decomposition," PNAS, vol. 104, no. 27, pp. 11 150--11 154, 2007.Google ScholarCross Ref
- J. Cheng et al., "Efficient core decomposition in massive networks," in ICDE'11. Google ScholarDigital Library
- A. Clauset., "Finding local community structure in networks," Phys. Rev. E, vol. 72, p. 026132. 2005.Google ScholarCross Ref
- J. P. Bagrow, "Evaluating local community methods in networks" J. Stat. Mech., vol. 2008, p. 05001. 2008.Google ScholarCross Ref
- B. Viswanath et al., "An analysis of social network-based sybil defenses," SIGCOMM Comput. Commun. Rev., vol41, pp.363--374. Google ScholarDigital Library
- W. Cui et al., "Online Search of Overlapping Communities," in SIGMOD '13. Google ScholarDigital Library
Index Terms
- Local search of communities in large graphs
Recommendations
Truss-based Community Search over Large Directed Graphs
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataCommunity search enables personalized community discovery and has wide applications in large real-world graphs. While community search has been extensively studied for undirected graphs, the problem for directed graphs has received attention only ...
Querying k-truss community in large and dynamic graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataCommunity detection which discovers densely connected structures in a network has been studied a lot. In this paper, we study online community search which is practically useful but less studied in the literature. Given a query vertex in a graph, the ...
Online search of overlapping communities
SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of DataA great deal of research has been conducted on modeling and discovering communities in complex networks. In most real life networks, an object often participates in multiple overlapping communities. In view of this, recent research has focused on mining ...
Comments