research-article

Core decomposition of uncertain graphs

Authors:

Francesco Bonchi,

Francesco Gullo,

Andreas Kaltenbrunner,

Yana VolkovichAuthors Info & Claims

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

Pages 1316 - 1325

https://doi.org/10.1145/2623330.2623655

Published: 24 August 2014 Publication History

Abstract

Core decomposition has proven to be a useful primitive for a wide range of graph analyses. One of its most appealing features is that, unlike other notions of dense subgraphs, it can be computed linearly in the size of the input graph. In this paper we provide an analogous tool for uncertain graphs, i.e., graphs whose edges are assigned a probability of existence. The fact that core decomposition can be computed efficiently in deterministic graphs does not guarantee efficiency in uncertain graphs, where even the simplest graph operations may become computationally intensive. Here we show that core decomposition of uncertain graphs can be carried out efficiently as well.

We extensively evaluate our definitions and methods on a number of real-world datasets and applications, such as influence maximization and task-driven team formation.

Supplementary Material

MP4 File (p1316-sidebyside.mp4)

Download
335.98 MB

References

[1]

E. Adar and C. Re. Managing Uncertainty in Social Networks. IEEE Data Eng. Bull., 30(2):15--22, 2007.

[2]

J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS, 2005.

Digital Library

[3]

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

Digital Library

[4]

S. Asthana, O. D. King, F. D. Gibbons, and F. P. Roth. Predicting Protein Complex Membership using Probabilistic Network Reliability. Genome Res., 14:1170--1175, 2004.

[5]

V. Batagelj and M. Zaversnik. Fast algorithms for deter mining (generalized) core groups in social networks. Advances in Data Analysis and Classification, 5(2):129--145, 2011.

Digital Library

[6]

D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. JMLR, 3:993--1022, 2003.

Digital Library

[7]

P. Boldi, F. Bonchi, A. Gionis, and T. Tassa. Injecting Uncertainty in Graphs for Identity Obfuscation. PVLDB, 5(11):1376--1387, 2012.

Digital Library

[8]

X. H. Chen, A. P. Dempster, and J. S. Liu. Weighted finite population sampling to maximize entropy. Biometrika, 81:457--469, 1994.

[9]

N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, pages 864--875, 2004.

Digital Library

[10]

D. Eppstein, M. Loffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In ISAAC, 2010.

[11]

A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010.

Digital Library

[12]

A. Goyal, W. Lu, and L. V. Lakshmanan. Celf++: optimizing the greedy algorithm for influence maximization in social networks. In WWW, pages 47--48, 2011.

Digital Library

[13]

J. Healy, J. Janssen, E. E. Milios, and W. Aiello. Characterization of graphs using degree cores. In WAW, 2006.

[14]

R. Jin, L. Liu, and C. C. Aggarwal. Discovering Highly Reliable Subgraphs in Uncertain Graphs. In KDD, 2011.

Digital Library

[15]

R. Jin, L. Liu, B. Ding, and H. Wang. Distance-Constraint Reachability Computation in Uncertain Graphs. PVLDB, 4(9):551--562, 2011.

Digital Library

[16]

D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.

Digital Library

[17]

M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse. Identifying influential spreaders in complex networks. Nature Physics 6, 888, 2010.

[18]

G. Kollios, M. Potamias, and E. Terzi. Clustering large probabilistic graphs. TKDE, 25(2):325--336, 2013.

Digital Library

[19]

G. Kortsarz and D. Peleg. Generating sparse 2-spanners. J. Algorithms, 17(2):222--236, 1994.

Digital Library

[20]

D. L.-Nowell and J. Kleinberg. The Link Prediction Problem for Social Networks. In CIKM, 2003.

[21]

V. E. Lee, N. Ruan, R. Jin, and C. C. Aggarwal. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. 2010.

[22]

L. Liu, R. Jin, C. Aggrawal, and Y. Shen. Reliable clustering on uncertain graphs. In ICDM, 2012.

Digital Library

[23]

K. Pearson. Tables of the Incomplete Beta-Function. Cambridge University Press, 1968.

[24]

M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-Nearest Neighbors in Uncertain Graphs. PVLDB, 3(1):997--1008, 2010.

Digital Library

[25]

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

[26]

P. Sevon, L. Eronen, P. Hintsanen, K. Kulovesi, and H. Toivonen. Link Discovery in Graphs Derived from Biological Databases. In DILS, 2006.

Digital Library

[27]

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

Digital Library

[28]

L. G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM J. on Computing, 8(3):410--421, 1979.

[29]

E. W. Weisstein. Binomial distribution. From MathWorld--A Wolfram Web Resource. Last visited on 16/5/2013, http://mathworld.wolfram.com/BinomialDistribution.html.

[30]

S. Wuchty and E. Almaas. Peeling the yeast protein network. Proteomics, 5(2):444--449, Feb. 2005.

[31]

Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases. PVLDB, 5(9):800--811, 2012.

Digital Library

[32]

H. Zhang, H. Zhao, W. Cai, J. Liu, and W. Zhou. Using the k-core decomposition to analyze the static structure of large-scale software systems. The Journal of Supercomputing, 53(2):352--369, 2010.

[33]

L. Zou, P. Peng, and D. Zhao. Top-K Possible Shortest Path Query over a Large Uncertain Graph. In WISE, 2011.

Digital Library

[34]

Z. Zou, H. Gao, and J. Li. Discovering Frequent Subgraphs over Uncertain Graph Databases under Probabilistic Semantics. In KDD, 2010.

Digital Library

Cited By

Sun ZHuang XXu JBonchi FChang L(2025)Probabilistic Truss Decomposition on Uncertain Graphs: Indexing and Dynamic MaintenanceACM Transactions on Database Systems10.1145/3721428Online publication date: 3-Mar-2025
https://doi.org/10.1145/3721428
Zhang WYang ZWen DLi WZhang WLin X(2025)Accelerating Core Decomposition in Billion-Scale HypergraphsProceedings of the ACM on Management of Data10.1145/37096563:1(1-27)Online publication date: 11-Feb-2025
https://dl.acm.org/doi/10.1145/3709656
Qin HSen GLi RChen HYuan YWang G(2025)Colorful Star Motif Counting: Concepts, Algorithms and ApplicationsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.351499737:3(1105-1125)Online publication date: Mar-2025
https://doi.org/10.1109/TKDE.2024.3514997
Show More Cited By

Index Terms

Core decomposition of uncertain graphs
1. Information systems
  1. Information systems applications
    1. Data mining
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Distance-generalized Core Decomposition
SIGMOD '19: Proceedings of the 2019 International Conference on Management of Data

The k-core of a graph is defined as the maximal subgraph in which every vertex is connected to at least k other vertices within that subgraph. In this work we introduce a distance-based generalization of the notion of k-core, which we refer to as the $(...
Bitruss Decomposition of Bipartite Graphs
DASFAA 2016: Proceedings, Part II, of the 21st International Conference on Database Systems for Advanced Applications - Volume 9643

In this paper, we propose bitruss, a new notion of a dense subgraph of a bipartite graph. Specifically, the k-bitruss of a bipartite graph is the largest edge-induced subgraph H such that every edge of H is contained in at least k rectangles within H. ...
Density Decomposition of Bipartite Graphs
SIGMOD

Mining dense subgraphs in a bipartite graph is a fundamental task in bipartite graph analysis, with numerous applications in community detection, fraud detection, and e-commerce recommendation. Existing dense subgraph models, such as biclique, k-biplex, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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

August 2014

2028 pages

ISBN:9781450329569

DOI:10.1145/2623330

General Chairs:
Sofus Macskassy
Facebook
,
Claudia Perlich
Dstillery
,
Program Chairs:
Jure Leskovec
Stanford University
,
Wei Wang
UCLA
,
Rayid Ghani
University of Chicago

Copyright © 2014 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: 24 August 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

KDD '14

Sponsor:

KDD '14: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 24 - 27, 2014

New York, New York, USA

Acceptance Rates

KDD '14 Paper Acceptance Rate 151 of 1,036 submissions, 15%;

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

Upcoming Conference

KDD '25

Sponsor:
sigkdd
sigkdd

The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 3 - 7, 2025

Toronto , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

117
Total Citations
View Citations
1,048
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)4

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sun ZHuang XXu JBonchi FChang L(2025)Probabilistic Truss Decomposition on Uncertain Graphs: Indexing and Dynamic MaintenanceACM Transactions on Database Systems10.1145/3721428Online publication date: 3-Mar-2025
https://doi.org/10.1145/3721428
Zhang WYang ZWen DLi WZhang WLin X(2025)Accelerating Core Decomposition in Billion-Scale HypergraphsProceedings of the ACM on Management of Data10.1145/37096563:1(1-27)Online publication date: 11-Feb-2025
https://dl.acm.org/doi/10.1145/3709656
Qin HSen GLi RChen HYuan YWang G(2025)Colorful Star Motif Counting: Concepts, Algorithms and ApplicationsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.351499737:3(1105-1125)Online publication date: Mar-2025
https://doi.org/10.1109/TKDE.2024.3514997
Makse HZava MMakse HZava M(2025)Mathematical Theories of Influencers in Complex NetworksThe Science of Influencers and Superspreaders10.1007/978-3-031-78058-5_1(1-143)Online publication date: 19-Feb-2025
https://doi.org/10.1007/978-3-031-78058-5_1
Luo WFang YLin CZhou Y(2024)Efficient Parallel D-Core Decomposition at ScaleProceedings of the VLDB Endowment10.14778/3675034.367505417:10(2654-2667)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.14778/3675034.3675054
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
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
Liu QShun JZablotchi ILee IChabbi MSteuwer M(2024)Parallel k-Core Decomposition with Batched Updates and Asynchronous ReadsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638508(286-300)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638508
Wang ZShi QChen JWang CSong MWang X(2024)Fast Query Answering by Labeling Index on Uncertain Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00311(4058-4071)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00311
Wang RLiu DZou Z(2024)FocusCore Decomposition of Multilayer Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00218(2792-2804)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00218
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 Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten