research-article

The community-search problem and how to plan a successful cocktail party

Authors:

Mauro Sozio and

Aristides GionisAuthors Info & Claims

KDD '10: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

July 2010

Pages 939 - 948

https://doi.org/10.1145/1835804.1835923

Published: 25 July 2010 Publication History

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 community-search problem: given a graph G, and a set of query nodes in the graph, we seek to find a subgraph of G 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 optimum greedy algorithm for this measure. We proceed by characterizing a class of monotone 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.

Supplementary Material

MOV File (kdd2010_sozio_csp_01.mov)

Download
150.06 MB

References

[1]

G. Agarwal and D. Kempe. Modularity-maximizing network communities via mathematical programming. European Physics Journal B, 66(3), 2008.

[2]

R. Andersen and K. Chellapilla. Finding dense subgraphs with size bounds. In WAW, 2009.

Digital Library

[3]

R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.

Digital Library

[4]

Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. In SWAT, 1996.

Digital Library

[5]

S. Asur and S. Parthasarathy. A viewpoint-based approach for interaction graph analysis. In KDD, 2009.

Digital Library

[6]

U. Brandes, D. Delling, M. Gaertler, R. G¨orke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. TKDE, 20(2):172--188, 2008.

Digital Library

[7]

M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, 2000.

Digital Library

[8]

J. Cheng, Y. Ke,W. Ng, and J. X. Yu. Context-aware object connection discovery in large graphs. In ICDE, 2009.

Digital Library

[9]

Y. Dourisboure, F. Geraci, and M. Pellegrini. Extraction and classification of dense communities in the web. In WWW, 2007.

Digital Library

[10]

C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, 2004.

Digital Library

[11]

U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29:2001, 1999.

[12]

G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD, 2000.

Digital Library

[13]

G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of web communities. Computer, 35(3):66--71, 2002.

Digital Library

[14]

S. Fortunato and M. Barthelemy. Resolution limit in community detection. PNAS, 104(1), 2007.

[15]

D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.

Digital Library

[16]

M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the USA, 99(12):7821--7826, 2002.

[17]

J. Hastad. Clique is hard to approximate within n^1--µ. Electronic Colloquium on Computational Complexity (ECCC), 4(38), 1997.

[18]

G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. JSC, 20(1), 1998.

Digital Library

[19]

G. Kasneci, S. Elbassuoni, and G. Weikum. Ming: mining informative entity relationship subgraphs. In CIKM, 2009.

Digital Library

[20]

S. Khuller and B. Saha. On finding dense subgraphs. In ICALP, 2009.

Digital Library

[21]

Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity graphs in networks. TKDD, 1(3), 2007.

Digital Library

[22]

B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics). Springer, 2007.

Digital Library

[23]

L. Kou, G. Markowsky, and L. Berman. A fast algorithm for steiner trees. Acta Informatica, 15(2):141--145, 1981

Digital Library

[24]

T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, 2009.

Digital Library

[25]

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, 2008.

Digital Library

[26]

M. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69, 2003.

[27]

P. Sevon, L. Eronen, P. Hintsanen, K. Kulovesi, and H. Toivonen. Link discovery in graphs derived from biological databases. In DILS, 2006.

Digital Library

[28]

H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD, 2006.

Digital Library

[29]

S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.

Cited By

Liu JZhong Y(2024)An Algorithm for Finding Optimal k-Core in Attribute NetworksApplied Sciences10.3390/app1403125614:3(1256)Online publication date: 2-Feb-2024
https://doi.org/10.3390/app14031256
Liao XLiu QHuang XXu J(2024)Truss-Based Community Search over Streaming Directed GraphsProceedings of the VLDB Endowment10.14778/3659437.365944017:8(1816-1829)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659440
Lin LYuan PLi RZhu CQin HJin HJia T(2024)QTCS: Efficient Query-Centered Temporal Community SearchProceedings of the VLDB Endowment10.14778/3648160.364816317:6(1187-1199)Online publication date: 3-May-2024
https://doi.org/10.14778/3648160.3648163
Show More Cited By

Index Terms

The community-search problem and how to plan a successful cocktail party
1. Information systems
  1. Information systems applications
    1. Data mining
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

The K-clique Densest Subgraph Problem
WWW '15: Proceedings of the 24th International Conference on World Wide Web

Numerous graph mining applications rely on detecting subgraphs which are large near-cliques. Since formulations that are geared towards finding large near-cliques are hard and frequently inapproximable due to connections with the Maximum Clique problem, ...
Read More
Clique Percolation Method: Memory Efficient Almost Exact Communities
Advanced Data Mining and Applications
Abstract
Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the last twenty years. The most popular method designed to find ...
Read More
1-Homogeneous Graphs with Cocktail Party μ-Graphs

Let Γ be a graph with diameter d ≥ 2. Recall Γ is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of Γ the distance partition
{{z ∈ V(Γ) | ∂(z, y) = i, ∂(x, z) = j} | 0 ≤ i, j ≤ d}
is equitable and its parameters do not depend on the ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

KDD '10: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

July 2010

1240 pages

ISBN:9781450300551

DOI:10.1145/1835804

General Chairs:
Bharat Rao
Siemens
,
Balaji Krishnapuram
Siemens
,
Program Chairs:
Andrew Tomkins
Google Inc.
,
Qiang Yang
Hong Kong University of Science and Technology

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

KDD '10

Sponsor:

KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

July 25 - 28, 2010

DC, Washington, USA

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '24

Sponsor:
sigkdd
sigkdd

The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 25 - 29, 2024

Barcelona , Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

342
Total Citations
View Citations
1,987
Total Downloads

Downloads (Last 12 months)159
Downloads (Last 6 weeks)8

Other Metrics

View Author Metrics

Citations

Cited By

Liu JZhong Y(2024)An Algorithm for Finding Optimal k-Core in Attribute NetworksApplied Sciences10.3390/app1403125614:3(1256)Online publication date: 2-Feb-2024
https://doi.org/10.3390/app14031256
Liao XLiu QHuang XXu J(2024)Truss-Based Community Search over Streaming Directed GraphsProceedings of the VLDB Endowment10.14778/3659437.365944017:8(1816-1829)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659440
Lin LYuan PLi RZhu CQin HJin HJia T(2024)QTCS: Efficient Query-Centered Temporal Community SearchProceedings of the VLDB Endowment10.14778/3648160.364816317:6(1187-1199)Online publication date: 3-May-2024
https://doi.org/10.14778/3648160.3648163
Luo CZhu YLiu QGao YChen LXu J(2024)MCR-Tree: An Efficient Index for Multi-dimensional Core SearchProceedings of the ACM on Management of Data10.1145/36549562:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654956
Almaslukh ALiu YMagdy A(2024)Scalable Spatio-Temporal Top-k Interaction Queries on Dynamic CommunitiesACM Transactions on Spatial Algorithms and Systems10.1145/3648374Online publication date: 16-Feb-2024
https://doi.org/10.1145/3648374
Balalau OBonchi FChan TGullo FSozio MXie H(2024)Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted HypergraphsACM Transactions on Knowledge Discovery from Data10.1145/363941018:4(1-21)Online publication date: 12-Feb-2024
https://dl.acm.org/doi/10.1145/3639410
Huang YGleich DVeldt NChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized MethodsProceedings of the ACM on Web Conference 202410.1145/3589334.3645624(881-892)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645624
Zhong MYang JZhu YQian TLiu MYu J(2024)A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal {X})$-Core QueryIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3349310(1-15)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3349310
Ni LLi QZhang YLuo WSheng V(2024)LSADEN: Local Spatial-aware Community Detection in Evolving Geo-social NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3348975(1-16)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3348975
Haldar NLi JAkhtar NJia YMian A(2024)Co-Engaged Location Group Search in Location-Based Social NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3327405(1-16)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3327405
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents