scholarly journals Link Prediction and Node Classification Based on Multitask Graph Autoencoder

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Shicong Chen ◽  
Deyu Yuan ◽  
Shuhua Huang ◽  
Yang Chen
Keyword(s):  
Loss Function ◽  
Link Prediction ◽  
Deep Level ◽  
Preferential Attachment ◽  
Similarity Index ◽  
Representation Learning ◽  
High Order ◽  
Fine Tuning ◽  
Common Neighbor ◽  
Node Classification

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.

scholarly journals Structural Hierarchy-Enhanced Network Representation Learning

2020 ◽  
Vol 10 (20) ◽  
pp. 7214
Author(s):  
Cheng-Te Li ◽  
Hong-Yu Lin
Keyword(s):  
Network Topology ◽  
Link Prediction ◽  
Main Idea ◽  
Representation Learning ◽  
Coarse Grained ◽  
Community Knowledge ◽  
Structural Hierarchy ◽  
Network Representation ◽  
Node Classification ◽  
Node Embeddings

Network representation learning (NRL) is crucial in generating effective node features for downstream tasks, such as node classification (NC) and link prediction (LP). However, existing NRL methods neither properly identify neighbor nodes that should be pushed together and away in the embedding space, nor model coarse-grained community knowledge hidden behind the network topology. In this paper, we propose a novel NRL framework, Structural Hierarchy Enhancement (SHE), to deal with such two issues. The main idea is to construct a structural hierarchy from the network based on community detection, and to utilize such a hierarchy to perform level-wise NRL. In addition, lower-level node embeddings are passed to higher-level ones so that community knowledge can be aware of in NRL. Experiments conducted on benchmark network datasets show that SHE can significantly boost the performance of NRL in both tasks of NC and LP, compared to other hierarchical NRL methods.

Evidential link prediction method based on the importance of high-order path index

2021 ◽  
Author(s):  
Jingjing Xia ◽  
Guang Ling ◽  
Qingju Fan ◽  
Fang Wang ◽  
Ming-Feng Ge
Keyword(s):  
Link Prediction ◽  
Similarity Index ◽  
Information Leakage ◽  
Prediction Method ◽  
High Order ◽  
Clustering Coefficient ◽  
Dempster Shafer Theory ◽  
Path Index ◽  
Shafer Theory ◽  
Entire Network

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.

SIMILARITY INDEX BASED ON THE INFORMATION OF NEIGHBOR NODES FOR LINK PREDICTION OF COMPLEX NETWORK

2013 ◽  
Vol 27 (06) ◽  
pp. 1350039 ◽  
Author(s):  
JING WANG ◽  
LILI RONG
Keyword(s):  
Link Prediction ◽  
High Efficiency ◽  
Similarity Index ◽  
Similarity Measures ◽  
Nearest Neighbors ◽  
Clustering Coefficient ◽  
Local Similarity ◽  
Common Neighbor ◽  
Similarity Indices ◽  
Node Similarity

Link prediction in complex networks has attracted much attention recently. Many local similarity measures based on the measurements of node similarity have been proposed. Among these local similarity indices, the neighborhood-based indices Common Neighbors (CN), Adamic-Adar (AA) and Resource Allocation (RA) index perform best. It is found that the node similarity indices required only information on the nearest neighbors are assigned high scores and have very low computational complexity. In this paper, a new index based on the contribution of common neighbor nodes to edges is proposed and shown to have competitively good or even better prediction than other neighborhood-based indices especially for the network with low clustering coefficient with its high efficiency and simplicity.

scholarly journals Applied Research on the Combination of Weighted Network and Supervised Learning in Acupoints Compatibility

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Xia Qiu ◽  
Xiaoying Zhong ◽  
Honglai Zhang
Keyword(s):  
Supervised Learning ◽  
Link Prediction ◽  
Preferential Attachment ◽  
Strong Support ◽  
Similarity Index ◽  
Tree Model ◽  
Point Selection ◽  
Weighted Network ◽  
Pi Index ◽  
Perception Model

To enhance the depth of excavation and promote the intelligence of acupoint compatibility, a method of constructing weighted network, which combines the attributes of acupoints and supervised learning, is proposed for link prediction. Medical cases of cervical spondylosis with acupuncture treatment are standardized, and a weighted network is constructed according to acupoint attributes. Multiple similarity features are extracted from the network and input into a supervised learning model for prediction. And, the performance of the algorithm is evaluated through evaluation indicators. The experiment finally screened 67 eligible medical cases, and the network model involved 141 acupoint nodes with 1048 edge. Except for the Preferential Attachment similarity index and the Decision Tree model, all other similarity indexes performed well in the model, among which the combination of PI index and Multilayer Perception model had the best prediction effect with an AUC value of 0.9351, confirming the feasibility of weighted networks combined with supervised learning for link prediction, also as a strong support for clinical point selection.

Link Prediction on a Network of Co-occurring MeSH Terms: Towards Literature-based Discovery

2016 ◽  
Vol 55 (04) ◽  
pp. 340-346 ◽  
Author(s):  
Thomas Rindflesch ◽  
Dimitar Hristovski ◽  
Andrej Kastrin
Keyword(s):  
Link Prediction ◽  
Preferential Attachment ◽  
Mesh Network ◽  
Jaccard Coefficient ◽  
Common Neighbor ◽  
Mesh Terms ◽  
Unsupervised Approach ◽  
Proximity Measures ◽  
Prediction Approach ◽  
Link Formation

Summary Objectives:Literature-based discovery (LBD) is a text mining methodology for automatically generating research hypotheses from existing knowledge. We mimic the process of LBD as a classification problem on a graph of MeSH terms. We employ unsupervised and supervised link prediction methods for predicting previously unknown connections between biomedical concepts. Methods:We evaluate the effectiveness of link prediction through a series of experiments using a MeSH network that contains the history of link formation between biomedical concepts. We performed link prediction using proximity measures, such as common neighbor (CN), Jaccard coefficient (JC), Adamic / Adar index (AA) and preferential attachment (PA). Our approach relies on the assumption that similar nodes are more likely to establish a link in the future. Results:Applying an unsupervised approach, the AA measure achieved the best performance in terms of area under the ROC curve (AUC = 0.76),gfollowed by CN, JC, and PA. In a supervised approach, we evaluate whether proximity measures can be combined to define a model of link formation across all four predictors. We applied various classifiers, including decision trees, k-nearest neighbors, logistic regression, multilayer perceptron, naïve Bayes, and random forests. Random forest classifier accomplishes the best performance (AUC = 0.87). Conclusions:The link prediction approach proved to be effective for LBD processing. Supervised statistical learning approaches clearly outperform an unsupervised approach to link prediction.

W-MMP2Vec: Topic-driven network embedding model for link prediction in content-based heterogeneous information network

2021 ◽  
Vol 25 (3) ◽  
pp. 711-738
Author(s):  
Phu Pham ◽  
Phuc Do
Keyword(s):  
Link Prediction ◽  
Representation Learning ◽  
Information Network ◽  
Network Embedding ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Learning Framework ◽  
Novel Approach ◽  
Proposed Model ◽  
Meta Path

Link prediction on heterogeneous information network (HIN) is considered as a challenge problem due to the complexity and diversity in types of nodes and links. Currently, there are remained challenges of meta-path-based link prediction in HIN. Previous works of link prediction in HIN via network embedding approach are mainly focused on exploiting features of node rather than existing relations in forms of meta-paths between nodes. In fact, predicting the existence of new links between non-linked nodes is absolutely inconvincible. Moreover, recent HIN-based embedding models also lack of thorough evaluations on the topic similarity between text-based nodes along given meta-paths. To tackle these challenges, in this paper, we proposed a novel approach of topic-driven multiple meta-path-based HIN representation learning framework, namely W-MMP2Vec. Our model leverages the quality of node representations by combining multiple meta-paths as well as calculating the topic similarity weight for each meta-path during the processes of network embedding learning in content-based HINs. To validate our approach, we apply W-TMP2Vec model in solving several link prediction tasks in both content-based and non-content-based HINs (DBLP, IMDB and BlogCatalog). The experimental outputs demonstrate the effectiveness of proposed model which outperforms recent state-of-the-art HIN representation learning models.

scholarly journals Fully Data-Driven Pseudohealthy Synthesis for Planning Valve-Sparing Aortic Root Reconstruction using Conditional Variational Autoencoders

2020 ◽  
Vol 6 (3) ◽  
pp. 284-287
Author(s):  
Jannis Hagenah ◽  
Mohamad Mehdi ◽  
Floris Ernst
Keyword(s):  
Aortic Root ◽  
Similarity Index ◽  
Ground Truth ◽  
Representation Learning ◽  
Patient Specific ◽  
Ultrasound Images ◽  
Specific Geometry ◽  
The Individual ◽  
Native Root ◽  
Original Information

AbstractAortic root aneurysm is treated by replacing the dilated root by a grafted prosthesis which mimics the native root morphology of the individual patient. The challenge in predicting the optimal prosthesis size rises from the highly patient-specific geometry as well as the absence of the original information on the healthy root. Therefore, the estimation is only possible based on the available pathological data. In this paper, we show that representation learning with Conditional Variational Autoencoders is capable of turning the distorted geometry of the aortic root into smoother shapes while the information on the individual anatomy is preserved. We evaluated this method using ultrasound images of the porcine aortic root alongside their labels. The observed results show highly realistic resemblance in shape and size to the ground truth images. Furthermore, the similarity index has noticeably improved compared to the pathological images. This provides a promising technique in planning individual aortic root replacement.

scholarly journals Discovering latent node Information by graph attention network

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Weiwei Gu ◽  
Fei Gao ◽  
Xiaodan Lou ◽  
Jiang Zhang
Keyword(s):  
Supervised Learning ◽  
Link Prediction ◽  
Learning Algorithm ◽  
Network Visualization ◽  
Graph Structure ◽  
High Quality ◽  
Node Centrality ◽  
Influential Nodes ◽  
Node Classification ◽  
Highly Cited

AbstractIn this paper, we propose graph attention based network representation (GANR) which utilizes the graph attention architecture and takes graph structure as the supervised learning information. Compared with node classification based representations, GANR can be used to learn representation for any given graph. GANR is not only capable of learning high quality node representations that achieve a competitive performance on link prediction, network visualization and node classification but it can also extract meaningful attention weights that can be applied in node centrality measuring task. GANR can identify the leading venture capital investors, discover highly cited papers and find the most influential nodes in Susceptible Infected Recovered Model. We conclude that link structures in graphs are not limited on predicting linkage itself, it is capable of revealing latent node information in an unsupervised way once a appropriate learning algorithm, like GANR, is provided.

Sign in / Sign up

Export Citation Format

Share Document