Wahid-Ul-Ashraf, A., Budka, M. and Musial-Gabrys, K., 2018. Newton’s Gravitational Law for Link Prediction in Social Networks. In: Complex Networks 2017, 29 November-1 December 2017, Lyon, France, 93-104.
Full text available as:
|
PDF
COMPLEX_NETWORKS_2017-1.pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. 624kB | |
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
Abstract
Link prediction is an important research area in network science due to a wide range of real-world application. There are a number of link prediction meth- ods. In the area of social networks, these methods are mostly inspired by social theory, such as having more mutual friends between two people in a social network platform entails higher probability of those two people becoming friends in the fu- ture. In this paper we take our inspiration from a different area, which is Newton’s law of universal gravitation. Although this law deals with physical bodies, based on our intuition and empirical results we found that this could also work in networks, and especially in social networks. In order to apply this law, we had to endow nodes with the notion of mass and distance. While node importance could be considered as mass, the shortest path, path count, or inverse similarity (AdamicAdar, Katz score etc.) could be considered as distance. In our analysis, we have primarily used de- gree centrality to denote the mass of the nodes, while the lengths of shortest paths between them have been used as distances. In this study we compare the proposed link prediction approach to 7 other methods on 4 datasets from various domains. To this end, we use the ROC curves and the AUC measure to compare the methods. As the results show that our approach outperforms the other 7 methods on 2 out of the 4 datasets, we also discuss the potential reasons of the observed behaviour.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
ISSN: | 1860-949X |
Additional Information: | Complex Networks & Their Applications VI: Proceedings of Complex Networks 2017 (The Sixth International Conference on Complex Networks and Their Applications) |
Group: | Faculty of Science & Technology |
ID Code: | 30084 |
Deposited By: | Symplectic RT2 |
Deposited On: | 05 Dec 2017 11:37 |
Last Modified: | 14 Mar 2022 14:08 |
Downloads
Downloads per month over past year
Repository Staff Only - |