Abstract

AbstractLink prediction is a challenging task in complex networks and data mining. Its primary purpose is to predict the possibility of links in the future. Link prediction has many application scenarios, such as product recommendations on e-commerce platforms, friend mining on social platforms, etc. Existing link prediction methods focus on utilizing neighbor and path information, ignoring the contribution of link formation of different node importance. For this reason, we propose a novel link prediction method based on node importance. The importance of node is calculated by using the topology structure of the directed network and the path information between nodes, and a graph convolutional network model suitable for directed graphs is designed. The importance of nodes is used to control the model to aggregate the neighbor information, thereby generating the vector representation of the node and obtaining the prediction score through the multi-layer perceptron (MLP). We investigate the proposed method and conduct extensive experiments on 6 real-world networks from various domains. The experiments results illustrate that the proposed method outperforms existing state-of-the-art methods.KeywordsLink predictionGraph convolutional networksData mining

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.