کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
974604 | 1480154 | 2015 | 15 صفحه PDF | دانلود رایگان |
• This algorithm employs ant colony approach for link prediction in graphs.
• It outperforms some of the unsupervised structural link prediction algorithms.
• A new perspective for link prediction is introduced.
As the size and number of online social networks are increasing day by day, social network analysis has become a popular issue in many branches of science. The link prediction is one of the key rolling issues in the analysis of social network’s evolution. As the size of social networks is increasing, the necessity for scalable link prediction algorithms is being felt more. The aim of this paper is to introduce a new unsupervised structural link prediction algorithm based on the ant colony approach. Recently, ant colony approach has been used for solving some graph problems. Different kinds of networks are used for testing the proposed approach. In some networks, the proposed scalable algorithm has the best result in comparison to other structural unsupervised link prediction algorithms. In order to evaluate the algorithm results, methods like the top-nn precision, area under the Receiver Operating Characteristic (ROC) and Precision–Recall curves are carried out on real-world networks.
Journal: Physica A: Statistical Mechanics and its Applications - Volume 419, 1 February 2015, Pages 80–94