惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
量子位
MongoDB | Blog
MongoDB | Blog
N
Netflix TechBlog - Medium
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog
A
About on SuperTechFans
腾讯CDC
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG
雷峰网
雷峰网
Last Week in AI
Last Week in AI
H
Help Net Security
WordPress大学
WordPress大学
博客园 - 司徒正美
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
H
Hackread – Cybersecurity News, Data Breaches, AI and More
T
Tailwind CSS Blog
博客园 - 【当耐特】
S
SegmentFault 最新的问题
美团技术团队
M
MIT News - Artificial intelligence
L
LangChain Blog
博客园 - 聂微东

cs.SI updates on arXiv.org

Hiding in Plain Sight: Finding MAHA on Reddit Prism: Structural Symmetry Scanning via Duality-Constrained Laplacian Projection MV-Gate: Insider Threat Detection via Multi-View Behavioral Statistics and Semantic Modeling Algorithmic Cultivation: How Social Media Feeds Shape User Language Universal Dynamics of Punctuated Progress AI-Mediated Communication Can Steer Collective Opinion CitePrism: Human-in-the-Loop AI for Citation Auditing and Editorial Integrity Explainable Detection of Depression Status Shifts from User Digital Traces Can Visual Mamba Improve AI-Generated Image Detection? An In-Depth Investigation ScioMind: Cognitively Grounded Multi-Agent Social Simulation with Anchoring-Based Belief Dynamics and Dynamic Profiles Humanwashing -- It Should Leave You Feeling Dirty When Do LLMs Generate Realistic Social Networks? A Multi-Dimensional Study of Culture, Language, Scale, and Method Moltbook Moderation: Uncovering Hidden Intent Through Multi-Turn Dialogue Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks Predicting Channel Closures in the Lightning Network with Machine Learning Latent Causal Void: Explicit Missing-Context Reconstruction for Misinformation Detection Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies Large Language Models for Causal Relations Extraction in Social Media: A Validation Framework for Disaster Intelligence When Can Digital Personas Reliably Approximate Human Survey Findings? RAwR: Role-Aware Rewiring via Approximate Equitable Partition GravityGraphSAGE: Link Prediction in Directed Attributed Graphs Structure-Centric Graph Foundation Model via Geometric Bases Attention-based graph neural networks: a survey When AI Meets Science: Research Diversity, Interdisciplinarity, Visibility, and Retractions across Disciplines in a Global Surge Scalable inference of spatial regions and temporal signatures from time series Can LLMs Emulate Human Belief Dynamics? Predicting Post Virality with Temporal Cross-Attention over Trend Signals H3: A Healthcare Three-Hop Index for Physician Referral Network Prediction Dynamic Graph with Similarity-Aware Attention Graph Neural Network for Recommender Systems Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks
Link Prediction in evolving networks based on the popular...
Tong Wang, Ming-yang Zhou, Zhong-qian Fu · 2016-09-12 · via cs.SI updates on arXiv.org

Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict the missing edges or identify the spurious edges, and attracts much attention from various fields. The key issue of link prediction is to estimate the likelihood of two nodes in networks. Most current approaches of link prediction base on static structural analysis and ignore the temporal aspects of evolving networks. Unlike previous work, in this paper, we propose a popularity based structural perturbation method (PBSPM) that characterizes the similarity of an edge not only from existing connections of networks, but also from the popularity of its two endpoints, since popular nodes have much more probability to form links between themselves. By taking popularity of nodes into account, PBSPM could suppress nodes that have high importance, but gradually become inactive. Therefore the proposed method is inclined to predict potential edges between active nodes, rather than edges between inactive nodes. Experimental results on four real networks show that the proposed method outperforms the state-of-the-art methods both in accuracy and robustness in evolving networks.