Hao-Zhe Yin

Efficient Hyper-Truss Decomposition over Hypergraphs

Cohesive subgraph mining in hypergraphs has recently attracted increasing research attention due to its broad applicability in domains such as social networks, co-authorship networks, and recommendation systems. An important model, the hyper k -truss, is defined as a maximal cohesive subgraph in which each hyper-ed...