scholarly journals High-order Joint Embedding for Multi-Level Link Prediction

Author(s):  
Yubai Yuan ◽  
Annie Qu
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Shicong Chen ◽  
Deyu Yuan ◽  
Shuhua Huang ◽  
Yang Chen

The goal of network representation learning is to extract deep-level abstraction from data features that can also be viewed as a process of transforming the high-dimensional data to low-dimensional features. Learning the mapping functions between two vector spaces is an essential problem. In this paper, we propose a new similarity index based on traditional machine learning, which integrates the concepts of common neighbor, local path, and preferential attachment. Furthermore, for applying the link prediction methods to the field of node classification, we have innovatively established an architecture named multitask graph autoencoder. Specifically, in the context of structural deep network embedding, the architecture designs a framework of high-order loss function by calculating the node similarity from multiple angles so that the model can make up for the deficiency of the second-order loss function. Through the parameter fine-tuning, the high-order loss function is introduced into the optimized autoencoder. Proved by the effective experiments, the framework is generally applicable to the majority of classical similarity indexes.


Author(s):  
Jingjing Xia ◽  
Guang Ling ◽  
Qingju Fan ◽  
Fang Wang ◽  
Ming-Feng Ge

Link prediction, aiming to find missing links in an observed network or predict those links that may occur in the future, has become a basic challenge of network science. Most existing link prediction methods are based on local or global topological attributes of the network such as degree, clustering coefficient, path index, etc. In the process of resource allocation, as the number of connections between the common neighbors of the paired nodes increases, it is easy to leak information through them. To overcome this problem, we proposed a new similarity index named ESHOPI (link prediction based on Dempster–Shafer theory and the importance of higher-order path index), which can prevent information leakage by penalizing ordinary neighbors and considering the information of the entire network and each node at the same time. In addition, high-order paths are used to improve the performance of link prediction by penalizing the longer reachable paths between the seed nodes. The effectiveness of ESHOPI is shown by the experiments on both synthetic and real-world networks.


2015 ◽  
Vol 55 (3) ◽  
pp. 499-517 ◽  
Author(s):  
Nils Zander ◽  
Tino Bog ◽  
Stefan Kollmannsberger ◽  
Dominik Schillinger ◽  
Ernst Rank

2021 ◽  
Author(s):  
Ganglin Hu ◽  
Jun Pang ◽  
Xian Mo

Abstract Network embedding has shown its effectiveness in many tasks such as link prediction, node classification, and community detection. Most attributed network embedding methods consider topological features and attributed features to obtain a node embedding, but ignore its implicit information behavior features, including information inquiry, interaction, and sharing. This can potentially lead to ineffective performance for downstream applications. In this paper, we propose a novel network embedding framework named information behavior extraction ( IBE ), that incorporates nodes' topological features, attributed features, and information behavior features into a joint embedding framework. To design IBE , we use an existing embedding method (e.g., SDNE, CANE, or CENE) to extract a node's topological features and attributed features into a basic vector. Then, we propose a topic-sensitive network embedding ( TNE ) model to extract node information behavior features and eventually generate information behavior feature vectors. In our TNE model, we propose an importance score rating algorithm ( ISR ), which considers both effects of the topic-based community of a node and its interaction with adjacent nodes to capture a node information behavior features. Eventually, we concatenate a node information behavior feature vector with its basic vector to get its ultimate joint embedding vector. Extensive experiments demonstrate that our method achieves significant and consistent improvements, compared to several state-of-the-art embedding methods on link prediction.


Sign in / Sign up

Export Citation Format

Share Document