Link Prediction via Ranking Metric Dual-Level Attention Network Learning
نویسندگان
چکیده
Link prediction is a challenging problem for complex network analysis, arising in many disciplines such as social networks and telecommunication networks. Currently, many existing approaches estimate the proximity of the link endpoints from the local neighborhood around them for link prediction, which suffer from the localized view of network connections. In this paper, we consider the problem of link prediction from the viewpoint of learning path-based proximity ranking metric embedding. We propose a novel proximity ranking metric attention network learning framework by jointly exploiting both node-level and path-level attention proximity of the endpoints to their betweenness paths for learning the discriminative feature representation for link prediction. We then develop the path-based dual-level attentional learning method with multi-step reasoning process for proximity ranking metric embedding. The extensive experiments on two large-scale datasets show that our method achieves better performance than other state-of-the-art solutions to the problem.
منابع مشابه
Handling Class Imbalance in Link Prediction Using Learning to Rank Techniques
We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem. However, the dominance of absent links in real world networks makes misclassification error a poor performance metric. Instead, researchers have argued for usin...
متن کاملLink Prediction using Supervised Learning
Social network analysis has attracted much attention in recent years. Link prediction is a key research direction within this area. In this paper, we study link prediction as a supervised learning task. Along the way, we identify a set of features that are key to the performance under the supervised learning setup. The identified features are very easy to compute, and at the same time surprisin...
متن کاملOn Learning Mixed Community-specific Similarity Metrics for Cold-start Link Prediction
We study the cold-start link prediction problem where edges between vertices is unavailable by learning vertex-based similarity metrics. Existing metric learning methods for link prediction fail to consider communities which can be observed in many real-world social networks. Because di↵erent communities usually exhibit di↵erent intra-community homogeneities, learning a global similarity metric...
متن کاملA Link Prediction Method Based on Learning Automata in Social Networks
Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...
متن کاملScalable Metric Learning for Co-Embedding
We present a general formulation of metric learning for co-embedding, where the goal is to relate objects from different sets. The framework allows metric learning to be applied to a wide range of problems—including link prediction, relation learning, multi-label tagging and ranking—while allowing training to be reformulated as convex optimization. For training we provide a fast iterative algor...
متن کامل