2692-4048ISSN (Online)
2770-0070ISSN (Print)
Volume 18 , Issue 1 , PP: 41-55, 2025 | Cite this article as | XML | Html | PDF | Full Length Article
Elaf Adel Abbas 1 , Nisreen Abbas Hussein 2 , Raaid Alubady 3 *
Doi: https://doi.org/10.54216/FPA.180104
Recently, the complex network has become popular use as it can transfer huge amounts of multimedia, text, ideas, and other information, encouraging many participant connections. Social media is one of these networks that make the most connections. Predicting the formation or dissolution of links between nodes presents a problem for social network analysis researchers. Since social networks are dynamic, this task is exciting as it may also forecast lost network links with less information. On the other way, current link prediction methods use simply node similarity to find links. This study proposes a new technique that relies on node attributes and similarity measures. Nodes are labeled by their centrality and similarity. The network's edges are negative and positive samples. A well-defined dataset for link prediction comprises the features of the nodes at the edges labeled either positive or negative. The dataset is passed to multiple machine learning classifiers. On several real-world networks. The experiments conducted during the research show that Gradient Boosting gave the highest accuracy of 99% compared with other methods.
Complex networks , Social networks , Link prediction , Machine learning Techniques
[1] A. K. Singh and L. Kailasam, "Link prediction-based influence maximization in online social networks," Neurocomputing, vol. 453, pp. 151–163, 2021. DOI: https://doi.org/10.1016/j.neucom.2021.04.024.
[2] E. A. Abbas and H. N. Nawaf, "Improving Louvain algorithm by leveraging cliques for community detection," in 2020 International Conference on Computer Science and Software Engineering (CSASE), IEEE, 2020, pp. 244–248. DOI: https://doi.org/10.1109/CSASE49402.2020.9142067.
[3] F. Aziz, L. T. Slater, L. Bravo-Merodio, A. Acharjee, and G. V. Gkoutos, "Link prediction in complex networks using information flow," Scientific Reports, vol. 13, no. 1, p. 14660, 2023. DOI: https://doi.org/10.1038/s41598-023-41476-9.
[4] S. Kumar, A. Mallik, and B. S. Panda, "Link prediction in complex networks using node centrality and light gradient boosting machine," World Wide Web, vol. 25, no. 6, pp. 2487–2513, 2022. DOI: https://doi.org/10.1007/s11280-021-00945-1.
[5] A. Kumari et al., "Supervised link prediction using structured-based feature extraction in social networks," Concurrency and Computation: Practice and Experience, vol. 34, no. 13, p. e5839, 2022. DOI: https://doi.org/10.1002/cpe.5839.
[6] A. Samad et al., "A comprehensive survey of link prediction techniques for social networks," EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, vol. 7, no. 23, pp. 1–21, 2020. DOI: https://doi.org/10.4108/eai.10-11-2020.167963.
[7] X. Wang, H. Yang, and M. Zhang, "Neural common neighbor with completion for link prediction," arXiv preprint arXiv:2302.00890, pp. 1–17, 2023. DOI: https://doi.org/10.48550/arXiv.2302.00890.
[8] S. Li et al., "Friend recommendation for cross-marketing in online brand community based on intelligent attention allocation link prediction algorithm," Expert Systems with Applications, vol. 139, p. 112839, 2020. DOI: https://doi.org/10.1016/j.eswa.2019.112839.
[9] B. Kaya, "A hotel recommendation system based on customer location: A link prediction approach," Multimedia Tools and Applications, vol. 79, pp. 1745–1758, 2020. DOI: https://doi.org/10.1007/s11042-019-08344-y.
[10] T. K. T. Ho, Q. V. Bui, and M. Bui, "Co-author relationship prediction in bibliographic networks: A new approach using geographic factors and latent topic information," in Proceedings of the 10th International Symposium on Information and Communication Technology, 2019, pp. 69–77. DOI: https://doi.org/10.1145/3368926.3368937.
[11] A. Breit et al., "OpenBioLink: A benchmarking framework for large-scale biomedical link prediction," Bioinformatics, vol. 36, no. 13, pp. 4097–4098, 2020. DOI: https://doi.org/10.1093/bioinformatics/btaa598.
[12] E. C. Mutlu et al., "Review on graph feature learning and feature extraction techniques for link prediction," arXiv preprint arXiv:1901.03425, pp. 1–16, 2019. DOI: https://doi.org/10.48550/arXiv.1901.03425.
[13] K. Zhou et al., "Attacking similarity-based link prediction in social networks," arXiv preprint arXiv:1809.08368, pp. 1–9, 2018. DOI: https://doi.org/10.48550/arXiv.1809.08368.
[14] S. Haghani and M. R. Keyvanpour, "A systemic analysis of link prediction in social networks," Artificial Intelligence Review, vol. 52, pp. 1961–1995, 2019. DOI: https://doi.org/10.1007/s10462-018-9632-8.
[15] J. Wu et al., "General link prediction with influential node identification," Physica A: Statistical Mechanics and Its Applications, vol. 523, pp. 996–1007, 2019. DOI: https://doi.org/10.1016/j.physa.2019.02.007.
[16] A. Samad, M. Azam, and M. Qadir, "Structural importance-based link prediction techniques in social networks," EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, vol. 7, no. 25, pp. 1–13, 2021. DOI: https://doi.org/10.4108/eai.22-1-2021.167785.
[17] X. Liu et al., "Link prediction approach combined graph neural network with capsule network," Expert Systems with Applications, vol. 212, p. 118737, 2023. DOI: https://doi.org/10.1016/j.eswa.2023.118737.
[18] I. Ahmad et al., "Missing link prediction using common neighbor and centrality-based parameterized algorithm," Scientific Reports, vol. 10, no. 1, pp. 1–9, 2020. DOI: https://doi.org/10.1038/s41598-020-62844-w.
[19] A. Sharma, S. Soni, and K. Rai, "Link Prediction in Social Network using Artificial Neural Network," International Journal of Computer Applications, vol. 174, pp. 26–30, 2021. DOI: https://doi.org/10.5120/ijca2021911861.
[20] L. Yin et al., "An evidential link prediction method and link predictability based on Shannon entropy," Physica A: Statistical Mechanics and Its Applications, vol. 482, pp. 699–712, 2017. DOI: https://doi.org/10.1016/j.physa.2017.04.001.
[21] P. Raut et al., "A comparative study of classification algorithms for link prediction," in 2020 2nd International Conference on Innovative Mechanisms for Industry Applications (ICIMIA), IEEE, 2020, pp. 479–483. DOI: https://doi.org/10.1109/ICIMIA48430.2020.9074957.
[22] S. Kumar, D. Lohia, D. Pratap, A. Krishna, and B. S. Panda, "MDER: Modified degree with exclusion ratio algorithm for influence maximisation in social networks," Computing, vol. 104, no. 2, pp. 359–382, 2022. DOI: https://doi.org/10.1007/s00607-021-00946-y.
[23] S. Behrouzi, Z. S. Sarmoor, K. Hajsadeghi, and K. Kavousi, "Predicting scientific research trends based on link prediction in keyword networks," Journal of Informetrics, vol. 14, no. 4, p. 101079, 2020. DOI: https://doi.org/10.1016/j.joi.2020.101079.
[24] E. A. Abbas and H. N. Nawaf, "Influence maximization based on a non-dominated sorting genetic algorithm," Karbala International Journal of Modern Science, vol. 7, no. 2, p. 5, 2021. DOI: https://doi.org/10.33640/2405-609X.2670.
[25] T. A. Diame et al., "Data management and decision-making process using machine learning approach for enterprises," Full Length Article, vol. 8, no. 1, p. 75, 2023. DOI: https://doi.org/10.1016/j.diba.2022.101076.
[26] D. Arrar, N. Kamel, and A. Lakhfif, "A comprehensive survey of link prediction methods," Journal of Supercomputing, vol. 80, no. 3, pp. 3902–3942, 2024. DOI: https://doi.org/10.1007/s11227-023-05060-1.
[27] K. Taunk, S. De, S. Verma, and A. Swetapadma, "A brief review of nearest neighbor algorithm for learning and classification," in 2019 International Conference on Intelligent Computing and Control Systems (ICCS), IEEE, 2019, pp. 1255–1260. DOI: https://doi.org/10.1109/ICCS45141.2019.9065762.
[28] A. Parmar, R. Katariya, and V. Patel, "A review on random forest: An ensemble classifier," in International Conference on Intelligent Data Communication Technologies and Internet of Things (ICICI) 2018, Springer, 2019, pp. 758–763. DOI: https://doi.org/10.1007/978-3-030-03146-6_70.
[29] M. Badiy and F. Amounas, "Embedding-based method for the supervised link prediction in social networks," International Journal on Recent and Innovation Trends in Computing and Communication, vol. 11, no. 3, pp. 105–116, 2023. DOI: https://doi.org/10.47941/ijritcc.v11i3.7214.
[30] J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Predicting positive and negative links in online social networks," in Proceedings of the 19th International Conference on World Wide Web, 2010, pp. 641–650. DOI: https://doi.org/10.1145/1772690.1772756.
[31] A. Ullah et al., "Identifying vital nodes from local and global perspectives in complex networks," Expert Systems with Applications, vol. 186, p. 115778, 2021. DOI: https://doi.org/10.1016/j.eswa.2021.115778.
[32] M. Azam et al., "Evaluations of similarity-based link prediction techniques in social networks," Journal of Engineering Science and Technology, vol. 18, no. 2, pp. 1055–1082, 2023. DOI: https://doi.org/10.5281/zenodo.7824236.
[33] M. Wang et al., "Graph ranking auditing: Problem definition and fast solutions," IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 10, pp. 3366–3380, 2020. DOI: https://doi.org/10.1109/TKDE.2019.2949253.
[34] X. Zhou and Z. Zhang, "Opinion maximization in social networks via leader selection," in Proceedings of the ACM Web Conference 2023, 2023, pp. 133–142. DOI: https://doi.org/10.1145/3543507.3583230.
[35] S. Behrouzi, Z. S. Sarmoor, K. Hajsadeghi, and K. Kavousi, "Predicting scientific research trends based on link prediction in keyword networks," Journal of Informetrics, vol. 14, no. 4, p. 101079, 2020. DOI: https://doi.org/10.1016/j.joi.2020.101079.
[36] H. Hairani, A. Anggrawan, and D. Priyanto, "Improvement performance of the random forest method on unbalanced diabetes data classification using Smote-Tomek Link," JOIV: International Journal on Informatics Visualization, vol. 7, no. 1, pp. 258–264, 2023. DOI: https://doi.org/10.30630/joiv.7.1.1305.
[37] R. Song et al., "Link prediction based on heterogeneous degree penalization with extending neighbors and clustering coefficient," International Journal of
