Line Graph is the Key: An Exploration of Line Graph on Link Prediction with Social Networks
Bibliographic record
Abstract
Network data plays a crucial role in various real-world applications, as connections between entities can be represented and analyzed through graphs. These include various types, such as social, information, and technical networks. However, the complex topologies of these networks present challenges in converting graph data into machine-readable vector formats. Existing models, such as Graph Neural Networks, Graph Attention Networks, and node2vec, have made strides in graph embeddings. For edge-related tasks, models such as node2vec typically use indirect methods like concatenating node vectors to represent edges. This approach is useful for tasks like link prediction. In this paper, we present LineDi2vec, a novel approach that improves the Node2vec embedding method by utilizing a line graph. The proposed LineDi2vec not only generalizes the original graphs, transforming the relationships between edges and nodes but also maintains the original graphs' topological integrity for effective node embedding by Node2vec. We evaluated LineDi2vec on four real-world datasets, focusing on link prediction. The results demonstrate that LineDi2vec outperforms traditional node concatenation methods.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".