The proposed regularized role detection method, for appropriate regularization weight parameter reduces prediction errors compared to other techniques, and trace analysis of the transition matrices indicates that the method yields a more stable system, that is, individuals are more likely to stay in their roles with fewer arbitrary transitions.
Abstract
This paper introduces a dynamic role discovery technique in temporal dynamic networks, utilizing temporally regularized Non-negative Matrix Factorization (NMF). Our technique differs from existing dynamic role analysis techniques by creating a consistent set of roles across all time periods, as well as a universal transition matrix that describes the probability of transitioning between roles. We also apply a regularization penalty to ensure that role membership does not change dramatically between time periods making our model more robust against real-world noise. We test our data on five real-world and one synthetically simulated dataset using both engineered and automatically generated features. We demonstrate that the proposed regularized role detection method, for appropriate regularization weight parameter reduces prediction errors compared to other techniques. Furthermore, trace analysis of the transition matrices indicates that our method yields a more stable system, that is, individuals are more likely to stay in their roles with fewer arbitrary transitions. Our model learns time-aligned roles, captures behavioral transitions over time, and scales efficiently to large and sparse graphs.
This paper proposes ATNSF, a temporal graph learning framework with a hybrid negative sampling strategy that uses a portion of historical edges as hard negatives and introduces a pairwise sampled softmax loss that contrasts each positive instance with a batch of negatives to learn more discriminative representations.
Yong-Chun Jiang, Heng Zhang, Jian Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
A mechanism-constrained predictor is constructed that uses pair recurrence, recency and history position, renewal patterns, and short sequential transitions while learning the compatibility within each mechanism to recover a substantial portion of the performance of strong neural baselines, and the recovered performanc...
A statistical feature augmentation method that explicitly encodes behavioral interaction statistics into the input feature space and consistently improves detection performance is proposed, showcasing a promising approach for merging classical network analysis with deep learning.
Philipp Schlinge, Jean-Luc Schnipper, M. Atzmueller· 0 citations
This work proposes SwitchPFN, which learns a shared projection and regime codebook from the training sequences, making local dynamic operators and transition features directly comparable across samples, and achieves the highest mean accuracy among the evaluated methods.
Zhen-Yi Zhu, Jacqueline Pang, Pei-Lin Shen et al.· 0 citations
A Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is “global basis, dynamic weights”, which learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs.
Zhen-Zhou Li, Xiang Li, Zhibin Niu· Proceedings of the Thirty-Fi...· 0 citations
Hierarchical Interaction MOdeling for zero-shot generalist GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns...
Xiang-Ping Zheng, Xuan Feng, Bo Wu et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.