scholarly journals Knowledge Driven Paper Recommendation Using Heterogeneous Network Embedding Method

2018 ◽  
Vol 06 (12) ◽  
pp. 157-170
Author(s):  
Irfan Ahmed ◽  
Zubair Ahmed Kalhoro
2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Léo Pio-Lopez ◽  
Alberto Valdeolivas ◽  
Laurent Tichit ◽  
Élisabeth Remy ◽  
Anaïs Baudot

AbstractNetwork embedding approaches are gaining momentum to analyse a large variety of networks. Indeed, these approaches have demonstrated their effectiveness in tasks such as community detection, node classification, and link prediction. However, very few network embedding methods have been specifically designed to handle multiplex networks, i.e. networks composed of different layers sharing the same set of nodes but having different types of edges. Moreover, to our knowledge, existing approaches cannot embed multiple nodes from multiplex-heterogeneous networks, i.e. networks composed of several multiplex networks containing both different types of nodes and edges. In this study, we propose MultiVERSE, an extension of the VERSE framework using Random Walks with Restart on Multiplex (RWR-M) and Multiplex-Heterogeneous (RWR-MH) networks. MultiVERSE is a fast and scalable method to learn node embeddings from multiplex and multiplex-heterogeneous networks. We evaluate MultiVERSE on several biological and social networks and demonstrate its performance. MultiVERSE indeed outperforms most of the other methods in the tasks of link prediction and network reconstruction for multiplex network embedding, and is also efficient in link prediction for multiplex-heterogeneous network embedding. Finally, we apply MultiVERSE to study rare disease-gene associations using link prediction and clustering. MultiVERSE is freely available on github at https://github.com/Lpiol/MultiVERSE.


2020 ◽  
Vol 14 (3) ◽  
pp. 1-24
Author(s):  
Lei Tang ◽  
Zihang Liu ◽  
Yaling Zhao ◽  
Zongtao Duan ◽  
Jingchi Jia

2021 ◽  
Vol 3 ◽  
Author(s):  
Tristan Millington ◽  
Saturnino Luz

In this paper we construct word co-occurrence networks from transcript data of controls and patients with potential Alzheimer’s disease using the ADReSS challenge dataset of spontaneous speech. We examine measures of the structure of these networks for significant differences, finding that networks from Alzheimer’s patients have a lower heterogeneity and centralization, but a higher edge density. We then use these measures, a network embedding method and some measures from the word frequency distribution to classify the transcripts into control or Alzheimer’s, and to estimate the cognitive test score of a participant based on the transcript. We find it is possible to distinguish between the AD and control networks on structure alone, achieving 66.7% accuracy on the test set, and to predict cognitive scores with a root mean squared error of 5.675. Using the network measures is more successful than using the network embedding method. However, if the networks are shuffled we find relatively few of the measures are different, indicating that word frequency drives many of the network properties. This observation is borne out by the classification experiments, where word frequency measures perform similarly to the network measures.


2018 ◽  
Vol 22 (6) ◽  
pp. 2611-2632 ◽  
Author(s):  
Yaqing Wang ◽  
Chunyan Feng ◽  
Ling Chen ◽  
Hongzhi Yin ◽  
Caili Guo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document