Approximate closest community search in networks

Xin Huang, Laks V.S. Lakshmanan, Jeffrey Xu Yu, Hong Cheng

Research output: Contribution to journalConference articlepeer-review

93 Citations (Scopus)

Abstract

Recently, there has been significant interest in the study of the community search problem in social and information networks: given one or more query nodes, find densely connected communities containing the query nodes. However, most existing studies do not address the "free rider" issue, that is, nodes far away from query nodes and irrelevant to them are included in the detected community. Some state-of-the-art models have attempted to address this issue, but not only are their formulated problems NP-hard, they do not admit any approximations without restrictive assumptions, which may not always hold in practice. In this paper, given an undirected graph G and a set of query nodes Q, we study community search using the k-truss based community model. We formulate our problem of finding a closest truss community (CTC), as finding a connected k-truss subgraph with the largest k that contains Q, and has the minimum diameter among such subgraphs. We prove this problem is NP-hard. Furthermore, it is NP-hard to approximate the problem within a factor (2 - ε), for any ε > 0. However, we develop a greedy algorithmic framework, which first finds a CTC containing Q, and then iteratively removes the furthest nodes from Q, from the graph. The method achieves 2- approximation to the optimal solution. To further improve the efficiency, we make use of a compact truss index and develop efficient algorithms for k-truss identification and maintenance as nodes get eliminated. In addition, using bulk deletion optimization and local exploration strategies, we propose two more efficient algorithms. One of them trades some approximation quality for efficiency while the other is a very efficient heuristic. Extensive experiments on 6 real-world networks show the effectiveness and efficiency of our community model and search algorithms.

Original languageEnglish
Pages (from-to)276-287
Number of pages12
JournalProceedings of the VLDB Endowment
Volume9
Issue number4
DOIs
Publication statusPublished - Dec 2015
Event42nd International Conference on Very Large Data Bases, VLDB 2016 - New Delhi, India
Duration: 5 Sep 20169 Sep 2016

Scopus Subject Areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Approximate closest community search in networks'. Together they form a unique fingerprint.

Cite this