research-article

Influential community search in large networks

Editors: Chen Li, Volker Markl Authors:

Rui MaoAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 8, Issue 5

Pages 509 - 520

https://doi.org/10.14778/2735479.2735484

Published: 01 January 2015 Publication History

Abstract

Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in a network, which has attracted much attention in recent years. However, all the previous studies on community search do not consider the influence of a community. In this paper, we introduce a novel community model called k-influential community based on the concept of k-core, which can capture the influence of a community. Based on the new community model, we propose a linear-time online search algorithm to find the top-r k-influential communities in a network. To further speed up the influential community search algorithm, we devise a linear-space index structure which supports efficient search of the top-r k-influential communities in optimal time. We also propose an efficient algorithm to maintain the index when the network is frequently updated. We conduct extensive experiments on 7 real-world large networks, and the results demonstrate the efficiency and effectiveness of the proposed methods.

References

[1]

T. Akiba, Y. Iwata, and Y. Yoshida. Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In CIKM, 2013.

Digital Library

[2]

V. Batagelj and M. Zaversnik. An O(m) algorithm for cores decomposition of networks. CoRR, cs.DS/0310049, 2003.

[3]

L. Chang, J. X. Yu, L. Qin, X. Lin, C. Liu, and W. Liang. Efficiently computing k-edge connected components via graph decomposition. In SIGMOD, 2013.

Digital Library

[4]

J. Cheng, Y. Ke, S. Chu, and M. T. Özsu. Efficient core decomposition in massive networks. In ICDE, 2011.

Digital Library

[5]

J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks. ACM Trans. Database Syst., 36(4): 21, 2011.

Digital Library

[6]

J. Cheng, L. Zhu, Y. Ke, and S. Chu. Fast algorithms for maximal clique enumeration with limited memory. In KDD, 2012.

Digital Library

[7]

N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1): 210--223, 1985.

Digital Library

[8]

J. Cohen. Trusses: Cohesive subgraphs for social network analysis. Technique report, 2005.

[9]

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009.

Digital Library

[10]

W. Cui, Y. Xiao, H. Wang, Y. Lu, and W. Wang. Online search of overlapping communities. In SIGMOD, 2013.

Digital Library

[11]

W. Cui, Y. Xiao, H. Wang, and W. Wang. Local search of communities in large graphs. In SIGMOD, 2014.

Digital Library

[12]

S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5): 75--174, 2010.

[13]

E. Gregori, L. Lenzini, and C. Orsini. k-dense communities in the internet as-level topology graph. Computer Networks, 57(1): 213--227, 2013.

Digital Library

[14]

X. Hu, Y. Tao, and C.-W. Chung. Massive graph triangulation. In SIGMOD, 2013.

Digital Library

[15]

X. Huang, H. Cheng, L. Qin, W. Tian, and J. X. Yu. Querying k-truss community in large and dynamic graphs. SIGMOD, 2014.

Digital Library

[16]

R. Li, J. X. Yu, and R. Mao. Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng., 26(10): 2453--2465, 2014.

[17]

M. C. Lin, F. J. Soulignac, and J. L. Szwarcfiter. Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci., 426: 75--90, 2012.

Digital Library

[18]

J. Moody and D. R. White. Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review, 68: 103--127, 2003.

[19]

K. Saito and T. Yamada. Extracting communities from complex networks by the k-dense method. In ICDM Workshops, 2006.

Digital Library

[20]

A. E. Sariyüce, B. Gedik, G. Jacques-Silva, K.-L. Wu, and Ü. V. Çatalyürek. Streaming algorithms for k-core decomposition. PVLDB, 6(6): 433--444, 2013.

Digital Library

[21]

S. B. Seidman. Network structure and minimum degree. Social networks, 5(3): 269--287, 1983.

[22]

M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. In KDD, 2010.

Digital Library

[23]

J. Ugander, L. Backstrom, C. Marlow, and J. Kleinberg. Structural diversity in social contagion. PNAS, 2011.

[24]

J. Wang and J. Cheng. Truss decomposition in massive networks. PVLDB, 5(9): 812--823, 2012.

Digital Library

[25]

N. Wang, J. Zhang, K.-L. Tan, and A. K. H. Tung. On triangulation-based dense neighborhood graphs discovery. PVLDB, 4(2): 58--68, 2010.

Digital Library

[26]

J. Xie, S. Kelley, and B. K. Szymanski. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv., 45(4): 43, 2013.

Digital Library

[27]

Y. Zhang and S. Parthasarathy. Extracting, analyzing and visualizing triangle k-core motifs within networks. In ICDE, 2012.

Digital Library

[28]

F. Zhao and A. K. H. Tung. Large scale cohesive subgraphs discovery for social network visual analysis. PVLDB, 6(2): 85--96, 2012.

Digital Library

[29]

R. Zhou, C. Liu, J. X. Yu, W. Liang, B. Chen, and J. Li. Finding maximal k-edge-connected subgraphs from a large graph. In EDBT, 2012.

Digital Library

Cited By

Guo ZChen ZSun XLiu W(2025)H-dominant skyline community search in multi-valued networksThe Journal of Supercomputing10.1007/s11227-024-06679-581:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11227-024-06679-5
Zhang YLi RZhang QQin HQin LWang G(2024)Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic GraphsProceedings of the VLDB Endowment10.14778/3681954.368195817:11(2722-2734)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681958
Zeng YMa CFang Y(2024)Distributed Shortest Distance Labeling on Large-Scale GraphsProceedings of the VLDB Endowment10.14778/3675034.367505317:10(2641-2653)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.14778/3675034.3675053
Show More Cited By

Influential community search in large networks
1. Information systems
  1. Data management systems
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Keyword aware influential community search in large attributed graphs
Abstract
Influential community search (ICS) on a graph finds a closely connected group of vertices having a dominance over other groups of vertices. The ICS has many applications in recommendations, event organization, and so on. In this paper, ...
Highlights
- The query considers user preference (as keywords) for influential community search.
Influential Community Search Over Large Heterogeneous Information Networks
Spatial Data and Intelligence
Abstract
Community search (CS) aims to find a cohesive community that satisfies query conditions in a given information network. Recent studies have introduced the CS problem into heterogeneous information networks (HINs) that are composed of multi-typed ...
Personalized Top-n Influential Community Search over Large Social Networks
Web and Big Data
Abstract
User-centered analysis is one of the aims of online community search. In this paper, we study personalized top-n influential community search that has a practical application. Given an evolving social network, where every edge has a propagation ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 8, Issue 5

January 2015

181 pages

ISSN:2150-8097

Editors:
Chen Li
University of California, Irvine
,
Volker Markl
TU Berlin

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 January 2015

Published in PVLDB Volume 8, Issue 5

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

79
Total Citations
View Citations
812
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)3

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Guo ZChen ZSun XLiu W(2025)H-dominant skyline community search in multi-valued networksThe Journal of Supercomputing10.1007/s11227-024-06679-581:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11227-024-06679-5
Zhang YLi RZhang QQin HQin LWang G(2024)Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic GraphsProceedings of the VLDB Endowment10.14778/3681954.368195817:11(2722-2734)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681958
Zeng YMa CFang Y(2024)Distributed Shortest Distance Labeling on Large-Scale GraphsProceedings of the VLDB Endowment10.14778/3675034.367505317:10(2641-2653)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.14778/3675034.3675053
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
Xing BTan YZhou JDu M(2024)Truss community search in uncertain graphsKnowledge and Information Systems10.1007/s10115-024-02215-266:12(7739-7773)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s10115-024-02215-2
Matsugu SKobayashi SShiokawa H(2024)An Efficient Indexing Method for Dynamic Graph kNNDatabase and Expert Systems Applications10.1007/978-3-031-68309-1_7(81-89)Online publication date: 26-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68309-1_7
Zhou YFang YLuo WYe Y(2023)Influential Community Search over Large Heterogeneous Information NetworksProceedings of the VLDB Endowment10.14778/3594512.359453216:8(2047-2060)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.14778/3594512.3594532
Yang JZhong MZhu YQian TLiu MYu J(2023)Scalable Time-Range k-Core Query on Temporal GraphsProceedings of the VLDB Endowment10.14778/3579075.357908916:5(1168-1180)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.14778/3579075.3579089
Li QMa HLi ZChang L(2023)Multiresolution Local Spectral Attributed Community SearchACM Transactions on the Web10.1145/362458018:1(1-28)Online publication date: 3-Nov-2023
https://dl.acm.org/doi/10.1145/3624580
Zhang FLinghu QXie JWang KLin XZhang WSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)Quantifying Node Importance over Network Structural StabilityProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599480(3217-3228)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599480
Show More Cited By

View Options

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents