HeuGAT: Integrating Heuristic and Graph Attention Network for Improved Link Prediction and Breakup Prediction in Social Network Structures
Bibliographic record
Abstract
Social networks are composed of diverse interactions that can generally be classified as positive (e.g., friendships, likes) or negative (e.g., conflict, dislikes). While link prediction, anticipating the formation of new ties, has been widely explored. Predicting link breakups, where existing ties weaken or dissolve, remains relatively understudied. These transitions are often subtle and gradual, frequently going undetected until negative outcomes have already occurred. Current systems rely heavily on user manual intervention to flag such changes, making them both inefficient and reactive. In this study, we address the challenge of automatically predicting potential link breakups by analyzing both structural and behavioral cues within social network graphs. Building upon the ClassReg heuristic, we introduce HeuGAT, an enhanced approach that replaces the original deep learning layer with a Graph Attention Network (GAT) layer. This integration allows the model to more effectively capture the contextual significance of neighboring nodes through attention mechanisms. Our results demonstrate the value of GNNbased models in advancing link prediction and breakup prediction for more resilient social network ecosystems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".