The Community-search Problem And How To Plan A Successful Cocktail Party

Abstract

A lot of research in graph mining has been devoted in the discovery of communities. Most of the work has focused in the scenario where communities need to be discovered with only reference to the input graph. However, for many interesting applications one is interested in finding the community formed by a given set of nodes. In this paper we study a query-dependent variant of the community-detection problem, which we call the <i>community-search problem</i>: given a graph <i>G</i>, and a set of <i>query nodes</i> in the graph, we seek to find a subgraph of <i>G</i> that contains the query nodes and it is densely connected. We motivate a measure of density based on minimum degree and distance constraints, and we develop an <i>optimum greedy</i> algorithm for this measure. We proceed by characterizing a class of <i>monotone</i> constraints and we generalize our algorithm to compute optimum solutions satisfying any set of monotone constraints. Finally we modify the greedy algorithm and we present two heuristic algorithms that find communities of size no greater than a specified upper bound. Our experimental evaluation on real datasets demonstrates the efficiency of the proposed algorithms and the quality of the solutions we obtain.