Article

Efficient Truss Computation for Large Hypergraphs

Authors:

Guoren WangAuthors Info & Claims

Web Information Systems Engineering – WISE 2022: 23rd International Conference, Biarritz, France, November 1–3, 2022, Proceedings

Pages 290 - 305

https://doi.org/10.1007/978-3-031-20891-1_21

Published: 31 October 2022 Publication History

Abstract

Cohesive subgraph mining has been applied in many areas, including social networks, cooperation networks, and biological networks. The k-truss of a graph is the maximal subgraph in which each edge is contained in at least k triangles. Existing k-truss models are defined solely in pairwise graphs and are hence unsuitable for hypergraphs. In this paper, we propose a novel problem, named

(k, α, β)

-truss computation in hypergraphs. We then propose two hypergraph conversions. The first converts a hypergraph into a pairwise graph, while the second converts it into a projected graph. We further propose two algorithms for computing

(k, α, β)

-truss in hypergraphs based on these two types of conversions. Experiments show that our

(k, α, β)

-truss model is effective and our algorithms are efficient in large hypergraphs.

References

[1]

Batagelj V and Zaversnik M An o(m) algorithm for cores decomposition of networks Comput. Sci. 2003 1 6 34-37

[2]

Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205–216. ACM (2013)

[3]

Cohen, J.: Trusses: cohesive subgraphs for social network analysis. national security agency technical report (2008)

[4]

Fang Y, Yang Y, Zhang W, Lin X, and Cao X Effective and efficient community search over large heterogeneous information networks Proc. VLDB Endow. 2020 13 6 854-867

[5]

Hu AL and Chan KC Utilizing both topological and attribute information for protein complex identification in PPI networks IEEE/ACM Trans. Comput. Biol. Bioinf. 2013 10 3 780-792

[6]

Hu, S., Wu, X., Chan, T.H.: Maintaining densest subsets efficiently in evolving hypergraphs. In: CIKM, pp. 929–938. ACM (2017)

[7]

Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311–1322. ACM (2014)

[8]

Lee, G., Choe, M., Shin, K.: How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. In: WWW, pp. 3396–3407 (2021)

[9]

Lee G, Ko J, and Shin K Hypergraph motifs: concepts, algorithms, and discoveries Proc. VLDB Endow. 2020 13 11 2256-2269

[10]

Leng M, Sun LY, Bian JN, and Yu-Chun MA An o(m) algorithm for cores decomposition of undirected hypergraph J. Chin. Comput. Syst. 2013 34 2568-2573

[11]

Liu H, Latecki LJ, and Yan S Dense subgraph partition of positive hypergraphs IEEE Trans. Pattern Anal. Mach. Intell. 2015 37 3 541-554

[12]

Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: SIGMOD, pp. 2183–2197. ACM (2020)

[13]

Luo, Q., Yu, D., Cai, Z., Lin, X., Cheng, X.: Hypercore maintenance in dynamic hypergraphs. In: ICDE, pp. 2051–2056 (2021)

[14]

Palla G, Deranyi I, Farkas I, and Vicsek T Uncovering the overlapping community structure of complex networks in nature and society Nature 2005 435 7043 814

[15]

Pu L and Faltings B Flach PA, De Bie T, and Cristianini N Hypergraph learning with hyperedge expansion Machine Learning and Knowledge Discovery in Databases 2012 Heidelberg Springer 410-425

[16]

Seidman SB Network structure and minimum degree Soc. Netw. 1983 5 3 269-287

[17]

Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: SIGKDD, pp. 939–948 (2010)

[18]

Sun, B., Chan, T.H., Sozio, M.: Fully dynamic approximate k-core decomposition in hypergraphs. ACM Trans. Knowl. Discov. Data 14(4), 39:1–39:21 (2020)

[19]

Wang J and Cheng J Truss decomposition in massive networks Proc. VLDB Endow. 2012 5 9 812-823

[20]

Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y.: Efficient and effective community search on large-scale bipartite graphs. In: ICDE, pp. 85–96 (2021)

[21]

Yang, Y., Fang, Y., Lin, X., Zhang, W.: Effective and efficient truss computation over large heterogeneous information networks. In: ICDE, pp. 901–912. IEEE (2020)

[22]

Yoon, S., Song, H., Shin, K., Yi, Y.: How much and when do we need higher-order informationin hypergraphs? A case study on hyperedge prediction. In: WWW, pp. 2627–2633 (2020)

[23]

Zou Z Navathe SB, Wu W, Shekhar S, Du X, Wang XS, and Xiong H Bitruss decomposition of bipartite graphs Database Systems for Advanced Applications 2016 Cham Springer 218-233

Cited By

Kim DKim JLim SJeong HFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core ApproachProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615275(4013-4017)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3615275

Index Terms

Efficient Truss Computation for Large Hypergraphs

Index terms have been assigned to the content through auto-classification.

Recommendations

Covering Non-uniform Hypergraphs

A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let (H) denote the cardinality of a minimum cover in the hypergraph H, and let us denote by g(n) the maximum of (H) taken over all hypergraphs H with n vertices and with no ...
Odd cycles and Θ-cycles in hypergraphs

A @Q-cycle of a hypergraph is a cycle including an edge that contains at least three base points of the cycle. We show that if a hypergraph H=(V,E) has no @Q-cycle, and |e|>=3, for every edge e@__ __E, then @__ __"e"@__ __"E(|e|-1)=<2|V|-2 with equality ...
Hypergraphs with large domination number and with edge sizes at least three

Let H=(V,E) be a hypergraph with vertex set V and edge set E. A dominating set in H is a subset of vertices D@__ __V such that for every vertex v@__ __V@__ __D there exists an edge e@__ __E for which v@__ __e and e@__ __D<>0@__ __. The domination number ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Web Information Systems Engineering – WISE 2022: 23rd International Conference, Biarritz, France, November 1–3, 2022, Proceedings

Oct 2022

657 pages

ISBN:978-3-031-20890-4

DOI:10.1007/978-3-031-20891-1

Editors:
Richard Chbeir
University of Pau and Pays de l'Adour, Anglet, France
,
Helen Huang
The University of Queensland, Brisbane, QLD, Australia
,
Fabrizio Silvestri
Sapienza Università di Roma, Rome, Italy
,
Yannis Manolopoulos
Open University of Cyprus, Nicosia, Cyprus
,
Yanchun Zhang
The New Cyber Research Department, Peng Cheng Laboratory, Shenzhen, China

© The Author(s), under exclusive license to Springer Nature Switzerland AG 2022.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 31 October 2022

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kim DKim JLim SJeong HFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core ApproachProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615275(4013-4017)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3615275

View Options

View options

Media

Figures

Other

Tables

View Table of Contents