Skip to content
Conference

Operationalization Matters: When Graph-Aware Learning Adds Value for IC-Based Influence Approximation

Aug 2026 · International Conference on Multimedia Analysis and Pattern Recognition · pp. 508-513 · 0 citations · 20 references

Abstract

Approximating Monte Carlo Independent Cascade (MC-IC) influence rankings with a learned surrogate is only meaningful if the target itself is clearly defined. We study this dependency on the Twitch Gamers graph under two IC operationalizations, keeping the graph, labeled-node sample, split, Monte Carlo budget, and evaluation protocol fixed while using regime-aligned feature policies. Under the structural weighted-cascade regime, binary top-k labels are too unstable for the primary target; in this setting, the best raw-attribute GNN, GCN, remains below degree centrality (ρ = 0.808 vs. 0.826). Under the source-community operationalization, degree centrality becomes uninformative (ρ = −0.006), and raw-attribute GraphSAGE outperforms the pre-specified flat linear-regression (LR) baseline (ρ = 0.915 vs. 0.884). Trained surrogates provide sub-second full-graph inference, whereas MC label generation takes hundreds to about two thousand seconds on the frozen labeled subset. The central finding is conditional: on this graph, neighborhood-aware surrogates add value beyond strong structural, flat, and shallow-embedding alternatives when the target construction moves influence signal away from local degree structure. A supplementary 1-hop neighbor-aggregation diagnostic reaches a Spearman correlation comparable to that of standard Graph-SAGE in the source-community regime, suggesting that part of the observed gain may be attributable to local neighborhood aggregation rather than to learned message passing specifically. The source code and dataset are available at https://github.com/qvinhx89/operationalization-matters-influence.

View source

Similar papers

Preprint Aug 2026

FlowNeg: GFlowNet-Guided Diverse Hard Negative Sampling for Knowledge Graph Embedding

FlowNeg is introduced, a context-conditioned hierarchical generative flow network that amortizes reward-proportional sampling without normalizing a composite reward over the entity set: given a positive triple and corruption side, it selects a type, then an entity.

Ibne Farabi Shihab, Naoshin Anzum Hridi, Joyanta J. Mondal · 0 citations
#machine learning Preprint Aug 2026

BLADE: Distilled LLM Regularization for Calibrated Knowledge Graph Completion

BLADE is presented, a variational model that separates latent truth from graph recording and distills offline language-model judgments into a frozen teacher regularizer and claims calibration only for the declared candidate distributions, not for all unobserved triples.

Ibne Farabi Shihab, Rabeya Bosri Tamanna, Abdo El Karaky et al. · 0 citations

Fair Graph Learning Needs Expressiveness: Rethinking Fairness from the Spectral Perspective

It is formally proved that GNN architectures lacking spectral expressiveness impose strict constraints on the representation space, so that harmful linear correlations between sensitive attributes and target prediction logits are preserved whenever a low-expressive backbone is paired with a debiasing operator acting wi...

Ming-Qi Yang, Zhao-Yu Liu · 0 citations
Preprint Aug 2026

Adapting Knowledge Graphs for Behavior Denoising in Sequential Recommendation

Sequential recommendation predicts the next item from a user's interaction history, but not every interaction is equally informative. Real logs combine persistent preferences with temporary needs, exploration, and incidental behavior, so some interactions can distort history representations or provide unreliable superv...

Zichun Jin, Zihan Zhou, Yinan Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily

Graph Neural Networks perform well on homophilic graphs but struggle in heterophilic settings, where connected nodes often carry dissimilar labels, so architecture and representation cannot be treated as independent evaluation factors.

Priyanath Maji, Sidharth Gaur, Rajavinoth Paul Durai · 0 citations
#machine learning Review Sep 2026

HoTS: Homophily-Aware Temperature Scaling for Graph Neural Network Calibration

Homophily-aware Temperature Scaling (HoTS), a simple post-hoc calibrator that assigns each node a positive scalar temperature from entropy-based logit concentration and estimated local homophily, achieves the best mean Expected Calibration Error (ECE) of 4.79%, the best average rank, and the most reliable confidence ra...

Inwoo Tae, Yoon-Jeong Hwang, Yongjae Lee · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.