Abstract
We present a new technique for link weight prediction, the Link Weight Prediction Weisfeiler–Lehman (LWP-WL) method that learns from graph structure features and link relationship patterns. Inspired by the Weisfeiler–Lehman Neural Machine, LWP-WL extracts an enclosing subgraph for the target link and applies a graph labelling algorithm for weighted graphs to provide an ordered subgraph adjacency matrix into a neural network. The neural network contains a Convolutional Neural Network in the first layer that applies special filters adapted to the input graph representation. An extensive evaluation is provided that demonstrates an improvement over the state-of-the-art methods in several weighted graphs. Furthermore, we conduct an ablation study to show how adding different features to our approach improves our technique’s performance. Finally, we also perform a study on the complexity and scalability of our algorithm. Unlike other approaches, LWP-WL does not rely on a specific graph heuristic and can perform well in different kinds of graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.