Skip to main content
SpringerLink
Log in

Truss decomposition of uncertain graphs

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

The k-truss of a graph is the largest edge-induced subgraph such that every edge is contained in at least k triangles within the subgraph, where a triangle is a cycle consisting of three vertices. As a new notion of cohesive subgraphs, truss has recently attracted a lot of research attentions in the database and data mining fields. At the same time, uncertainty is an intrinsic property of massive graph data, and truss decomposition (i.e., finding all k-trusses of a graph) has become a key primitive on uncertain graphs. In this paper, we study the truss decomposition problem on uncertain graphs, that is, finding all highly probable k-trusses of an uncertain graph. We first give an formal statement of the truss decomposition problem on uncertain graphs. Then, we prove that the truss decomposition of an uncertain graph attains two elegant properties, namely uniqueness and hierarchy. We show that the truss decomposition of an uncertain graph can be found in \(O(m^{1.5}Q)\) time by proposing an in-memory algorithm called \(\mathtt {TD_{mem}}\), where m is the number of edges of the uncertain graph, and Q is at most the maximum number of common neighbors of the endpoints of an edge. When an uncertain graph is too large to fit into main memory, we propose an external-memory algorithm \(\mathtt {TD_{I/O}}\) to find the truss decomposition of the uncertain graph. Extensive experiments have been carried out to evaluate the practical performance of the proposed algorithms. The experimental results verify that both \(\mathtt {TD_{mem}}\) and \(\mathtt {TD_{I/O}}\) are efficient when an uncertain graph is small enough to fit into main memory, and that \(\mathtt {TD_{I/O}}\) is much faster than \(\mathtt {TD_{mem}}\) when the graph is too large to fit into main memory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27

Similar content being viewed by others

References

  1. Boldi P, Bonchi F, Gionis A, Tassa T (2012) Injecting uncertainty in graphs for identity obfuscation. Proc VLDB Endow (PVLDB) 5(11):1376–1387

    Article  Google Scholar 

  2. Bonchi F, Gullo F, Kaltenbrunner A, Vokovich Y (2014) Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’14), pp 1316–1325

  3. Chakrabarti D, Zhan Y, Faloutsos C (2004) R-MAT: A recursive model for graph mining. In: Proceedings of the 4th SIAM international conference on data mining (SDM’04), pp 442–446

  4. Cheng Y, Yuan Y, Wang G, Qiao B, Wang Z (2014) Efficient sampling methods for shortest path query over uncertain graphs. In: Proceedings of the 19th international conference on database systems for advanced applications (DASFAA’14), pp 124–140

  5. Chu S, Cheng J (2012) Triangle listing in massive networks. ACM Trans Knowl Discov Data (TKDD) 6(4):17

    Google Scholar 

  6. Cohen J (2008) Trusses: cohesive subgraphs for social network analysis. Technical Report

  7. Cohen J (2009) Graph twiddling in a mapreduce world. Comput Sci Eng 11(4):29–41

    Article  Google Scholar 

  8. Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying \(k\)-truss community in large and dynamic graphs. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’14), pp 1311–1322

  9. Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’11), pp 992–1000

  10. Jin R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow (PVLDB) 4(9):551–562

    Article  Google Scholar 

  11. Khan A, Bonchi F, Gionis A, Gullo F (2014) Fast reliability search in uncertain graphs. In: Proceedings of the 17th international conference on extending database technology (EDBT’14), pp 535–546

  12. Kollios G, Potamias M, Terzi E (2013) Clustering large probabilistic graphs. IEEE Trans Knowl Data Eng (TKDE) 25(2):325–336

    Article  Google Scholar 

  13. Kong X, Ragin AB, Wang X, Yu PS (2013) Discriminative feature selection for uncertain graph classification. In: Proceedings of the 13th SIAM international conference on data mining (SDM’13), pp 82–93

  14. Leskovec J (2013) Stanford large network dataset collection. http://snap.stanford.edu/data/

  15. Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J 21(6):753–777

    Article  Google Scholar 

  16. Li R, Yu JX, Mao R, Jin T (2014) Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling. In: Proceedings of the 30th IEEE international conference on data engineering (ICDE’14), pp 892–903

  17. Lian X, Chen L (2011) Efficient query answering in probabilistic RDF graphs. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’11), pp 157–168

  18. Liu L, Jin R, Aggarwal CC, Shen Y (2012) Reliable clustering on uncertain graphs. In: Proceedings of the 12th IEEE international conference on data mining (ICDM’12), pp 459–468

  19. Papapetrou O, Ioannou E, Skoutas D (2011) Efficient discovery of frequent subgraph patterns in uncertain graph databases. In: Proceedings of the 14th international conference on extending database technology (EDBT’11), pp 355–366

  20. Parchas P, Gullo F, Papadias D, Bonchi F (2014) The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: Proceedings of the ACM SIGMOD international conference on managementof data (SIGMOD’14), pp 967–978

  21. Potamias M, Bonchi F, Gionis A, Kollios G (2010) k-nearest neighbors in uncertain graphs. Proc VLDB Endow (PVLDB) 3(1):997–1008

    Article  Google Scholar 

  22. Schank T (2007) Algorithmic aspects of trianlge-based network analysis. Ph.D. thesis, Universität Karlsruhe, Fakultätfür Informatik

  23. Song S, Zou Z, Liu K (2016) Triangle-based representative possible worlds of uncertain graphs. In: Proceedings of the 21st international conference on database systems for advanced applications (DASFAA’16)

  24. Wang J, Cheng J (2012) Truss decomposition in massive networks. Proc VLDB Endow (PVLDB) 5(9):812–823

    Article  Google Scholar 

  25. Wang N, Parthasarathy S, Tan K, Tung AKH (2008) CSV: visualizing and mining cohesive subgraphs. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’08), pp 445–458

  26. Yuan Y, Chen L, Wang G (2010) Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Proceedings of the 15th international conference on database systems for advanced applications (DASFAA’10), pp 155–170

  27. Yuan Y, Wang G, Chen L, Wang H (2012) Efficient subgraph similarity search on large probabilistic graph databases. Proc VLDB Endow (PVLDB) 5(9):800–811

    Article  Google Scholar 

  28. Yuan Y, Wang G, Chen L, Wang H (2013) Efficient keyword search on uncertain graph data. IEEE Trans Knowl Data Eng (TKDE) 25(12):2767–2779

    Article  Google Scholar 

  29. Yuan Y, Wang G, Wang H, Chen L (2011) Efficient subgraph search over large uncertain graphs. Proc VLDB Endow (PVLDB) 4(11):876–886

    Google Scholar 

  30. Zhang Y, Parthasarathy S (2012) Extracting analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of the 28th IEEE international conference on data engineering (ICDE’12), pp 1049–1060

  31. Zhao F, Tung AKH (2012) Large scale cohesive subgraphs discovery for social network visual analysis. Proc VLDB Endow (PVLDB) 6(2):85–96

    Article  Google Scholar 

  32. Zhu R, Zou Z, Li J (2015) Top-\(k\) reliability search on uncertain graphs. In: Proceedings of the 15th IEEE international conference on data mining (ICDM’15), pp 659–668

  33. Zhu R, Zou Z, Li J (2016) SimRank computation on uncertain graphs. In: Proceedings of the 32nd IEEE international conference on data engineering (ICDE’16)

  34. Zou Z (2013) Polynomial-time algorithm for finding denest subgraphs in uncertain graphs. In: Proceedings of the 11th workshop on mining and learning with graphs (MLG’13)

  35. Zou Z, Gao H, Li J (2010) Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’10), pp 633–642

  36. Zou Z, Li J (2013) Structural-context similarities for uncertain graphs. In: Proceedings of the 13th IEEE international conference on data mining (ICDM’13), pp 1325–1330

  37. Zou Z, Li J, Gao H, Zhang S (2009) Frequent subgraph pattern mining on uncertain graph data. Proceedings of the 18th ACM conference on information and knowledge management (CIKM’09), pp 583–592

  38. Zou Z, Li J, Gao H, Zhang S (2010) Finding top-k maximal cliques in an uncertain graph. In: Proceedings of the 26th IEEE international conference on data engineering (ICDE’10), pp 649–652

  39. Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng (TKDE) 22(9):1203–1218

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the 973 Program of China (No. 2011CB036202), the NSF of China (No. 61532015 and No. 61173023) and the HIT-Tencent Open Research Fund. We also thank Dr. Francesco Bochi for sharing their datasets.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang, China

    Zhaonian Zou & Rong Zhu

Authors
  1. Zhaonian Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhaonian Zou.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zou, Z., Zhu, R. Truss decomposition of uncertain graphs. Knowl Inf Syst 50, 197–230 (2017). https://doi.org/10.1007/s10115-016-0943-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-016-0943-y

Keywords

Search

Navigation