Research map / Graph learning / Knowledge and temporal graphs
Dynamic Network Embedding by Modeling Triadic Closure Process
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| model triadic closure dynamics (DynamicTriad) | network embedding · Academic/Mobile/Loan link prediction | F1: 0.772 -> 0.836 (Academic) | Helped |
| model triadic closure dynamics (DynamicTriad) | network embedding · Mobile changed link prediction | F1: 0.732 -> 0.690 vs node2vec | Hurt |
| tune triad closure weight beta0 and smoothness beta1 (ablation) | DynamicTriad · Mobile/Loan | F1 | Mixed |
Closest papers by meaning
- Spectral embedding for dynamic networks with stability guarantees (NeurIPS 2021 · similarity 0.88)
- DyRep: Learning Representations over Dynamic Graphs (ICLR 2019 · similarity 0.87)
- Representation Learning for Scale-Free Networks (AAAI 2018 · similarity 0.87)
- How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (ICLR 2025 · similarity 0.86)
- Continuous-Time Graph Representation with Sequential Survival Process (AAAI 2024 · similarity 0.85)
- Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.