|
چکیده
|
Current link prediction strategies are about finding new probable strong relations to establish or weak ones to remove. An interesting strategy is utilizing link prediction to prioritize the edges in the network and finding newly probable established relations. In this paper we will introduce and explain RLP, reverse link prediction, as a new paradigm, and use popular basic scoring methods including CN, JC, AA, RA, and PA, as its core to examine. The test cases are nine datasets. Half of them are contact networks in different levels from personal contact to aviation, and another half is for covering different test situations. After reviewing the edge removal based epidemic mitigation methods, we show that RLP can be used to decrease the epidemics spreading speed as a general method with various link prediction algorithms, and here in this paper, preferential attachment (PA) has the best results overall. But the results heavily depend on the nature of the examined networks: regular, scale-free or small-world. We also propose an easy to understand criteria, path count, for comparing the efficacy of epidemics mitigation methods. RLP can be extended to use other link prediction scoring methods in various types of graphs as well.
|