Structure learning via meta-hyperedge for dynamic rumor detection

X Sun, H Yin, B Liu, Q Meng, J Cao… - IEEE transactions on …, 2022 - ieeexplore.ieee.org
Online social networks have greatly facilitated our lives but have also propagated the
spreading of rumours. Traditional works mostly find rumors from content, but content can be …

Multi-level hyperedge distillation for social linking prediction on sparsely observed networks

X Sun, H Yin, B Liu, H Chen, Q Meng, W Han… - Proceedings of the Web …, 2021 - dl.acm.org
Social linking prediction is one of the most fundamental problems in online social networks
and has attracted researchers' persistent attention. Most of the existing works predict …

Higher-order clustering in complex heterogeneous networks

AG Carranza, RA Rossi, A Rao, E Koh - Proceedings of the 26th ACM …, 2020 - dl.acm.org
Heterogeneous networks are seemingly ubiquitous in the real world. Yet, most graph mining
methods such as clustering have mostly focused on homogeneous graphs by ignoring …

Mining Small Subgraphs in Massive Graphs

Y Santoso - 2023 - dspace.library.uvic.ca
Graph or network analysis is a much needed method of analysis as it can reveal some
insights that will not be obvious through other methods. In a graph, entities are represented …