3 papers
cs.SI2025
Influence Strength Estimation in Hyperbolic Space for Social Influence Maximization
Hongliang Qiao, Shanshan Feng, Min Zhou +5
The Influence Maximization (IM) problem aims to find a small set of influential users to maximize their influence spread in a social network. Traditional methods rely on fixed diff…
cs.LG2024
You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning
Tianmeng Yang, Jiahao Meng, Min Zhou +4
Recent research on the robustness of Graph Neural Networks (GNNs) under noises or attacks has attracted great attention due to its importance in real-world applications. Most previ…
cs.LG2023
MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation
Junfeng Liu, Min Zhou, Shuai Ma +1
Graph Edit Distance (GED) is a general and domain-agnostic metric to measure graph similarity, widely used in graph search or retrieving tasks. However, the exact GED computation i…