Rethinking Local Community Detection: Query Nodes Replacement

Local community detection for a given set of query nodes attracts much research attention recently. The query nodes play essential roles in the detection effectiveness. Existing methods perform well when a query node is from the target community core region. However, they struggle with the query-bias issue and especially perform unsatisfactorily when the query nodes come from different communities or when certain query nodes are from communities overlapping region or community boundary region. To address above issues, we consider from a new angle, to replace these original “intractable” query nodes with new detection-friendly query nodes. In this paper, we propose an effective ATP (Amplified Topology Potential) algorithm to detect core nodes of the target communities w.r.t. original query nodes. For one query node, ATP first builds a query-oriented topology potential field around the query node by aggregating random walk with restart scores. Then it amplifies the topology potential value to make core nodes of target communities easily distinguished. Graph-size-independent fast approximation strategies are also proposed together with sound theoretical foundations. Extensive experiments on four real networks using ten state-of-the-art local community detection methods verify the improvement in detection effectiveness and efficiency by the replacing strategy for the tough query cases.

[1]  Teresa M. Przytycka,et al.  Chapter 5: Network Biology Approach to Complex Diseases , 2012, PLoS Comput. Biol..

[2]  Gan Wen Community Discovery Method in Networks Based on Topological Potential , 2009 .

[3]  Laks V. S. Lakshmanan,et al.  Community Search over Big Graphs: Models, Algorithms, and Opportunities , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[4]  Wei Cheng,et al.  Memory-based random walk for multi-query local community detection , 2019, Knowledge and Information Systems.

[5]  Nicola Barbieri,et al.  Efficient and effective community search , 2015, Data Mining and Knowledge Discovery.

[6]  Jun Hu,et al.  A Novel Measurement of Structure Properties in Complex Networks , 2009, Complex.

[7]  Jing Li,et al.  Robust Local Community Detection: On Free Rider Effect and Its Elimination , 2015, Proc. VLDB Endow..

[8]  Derong Shen,et al.  Searching overlapping communities for group query , 2015, World Wide Web.

[9]  Xiang Zhang,et al.  Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures , 2016, Proc. VLDB Endow..

[10]  Jeffrey Xu Yu,et al.  Querying k-truss community in large and dynamic graphs , 2014, SIGMOD Conference.

[11]  Kun He,et al.  Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach , 2015, WWW.

[12]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[13]  Xiang Zhang,et al.  Constrained Local Graph Clustering by Colored Random Walk , 2019, WWW.

[14]  Jure Leskovec,et al.  Tensor Spectral Clustering for Partitioning Higher-order Network Structures , 2015, SDM.

[15]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[16]  Wei Cheng,et al.  Many Heads are Better than One: Local Community Detection by the Multi-walker Chain , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[17]  Xiaodong Li,et al.  Effective Community Search over Large Spatial Graphs , 2017, Proc. VLDB Endow..

[18]  Jinhui Tang,et al.  Overlapping community detection based on node location analysis , 2016, Knowl. Based Syst..

[19]  Haixun Wang,et al.  Online search of overlapping communities , 2013, SIGMOD '13.

[20]  Wei Cheng,et al.  The multi-walker chain and its application in local community detection , 2018, Knowledge and Information Systems.

[21]  Shaoda Chen,et al.  A Community Detection Algorithm Based on Topology Potential and Spectral Clustering , 2014, TheScientificWorldJournal.

[22]  H. Hakonarson,et al.  Analysing biological pathways in genome-wide association studies , 2010, Nature Reviews Genetics.

[23]  Peixiang Zhao,et al.  Truss-based Community Search: a Truss-equivalence Based Indexing Approach , 2017, Proc. VLDB Endow..

[24]  Ulrike von Luxburg,et al.  Multi-agent Random Walks for Local Clustering on Graphs , 2010, 2010 IEEE International Conference on Data Mining.

[25]  Laks V. S. Lakshmanan,et al.  Community Search over Big Graphs , 2019, Synthesis Lectures on Data Management.

[26]  Wei Wang,et al.  On Multi-query Local Community Detection , 2018, 2018 IEEE International Conference on Data Mining (ICDM).

[27]  Christos Faloutsos,et al.  Automatic multimedia cross-modal correlation discovery , 2004, KDD.

[28]  David F. Gleich,et al.  Heat kernel based community detection , 2014, KDD.

[29]  Yuchen Bian,et al.  Local Community Detection in Multiple Networks , 2020, KDD.

[30]  Inderjit S. Dhillon,et al.  Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion , 2015, IEEE Transactions on Knowledge and Data Engineering.

[31]  Kun He,et al.  Detecting Overlapping Communities from Local Spectral Subspaces , 2015, 2015 IEEE International Conference on Data Mining.

[32]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[34]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[35]  Xiang Zhang,et al.  Second-order random walk-based proximity measures in graph analysis: formulations and algorithms , 2018, The VLDB Journal.