{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:51:23Z","timestamp":1772243483597,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The evolution of online social networks is highly dependent on the recommended links. Most of the existing works focus on predicting intra-community links efficiently. However, it is equally important to predict inter-community links with high accuracy for diversifying a network. In this work, we propose a link prediction method, called HM-EIICT, that considers both the similarity of nodes and their community information to predict both kinds of links, intra-community links as well as inter-community links, with higher accuracy. The proposed framework is built on the concept that the connection likelihood between two given nodes differs for inter-community and intra-community node-pairs. The performance of the proposed methods is evaluated using link prediction accuracy and network modularity reduction. The results are studied on real-world networks and show the effectiveness of the proposed method as compared to the baselines. The experiments suggest that the inter-community links can be predicted with a higher accuracy using community information extracted from the network topology, and the proposed framework outperforms several measures especially proposed for community-based link prediction. The paper is concluded with open research directions.<\/jats:p>","DOI":"10.1007\/s10878-021-00788-0","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T12:03:02Z","timestamp":1630065782000},"page":"2853-2870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["HM-EIICT: Fairness-aware link prediction in complex networks using community information"],"prefix":"10.1007","volume":"44","author":[{"given":"Akrati","family":"Saxena","sequence":"first","affiliation":[]},{"given":"George","family":"Fletcher","sequence":"additional","affiliation":[]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,27]]},"reference":[{"issue":"3","key":"788_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"788_CR2","doi-asserted-by":"crossref","unstructured":"Almaas E, V\u00e1zquez A, Barab\u00e1si AL (2007) Scale-free networks in biology. Biol Netw 3(1)","DOI":"10.1142\/9789812772367_0001"},{"issue":"31","key":"788_CR3","doi-asserted-by":"publisher","first-page":"1950382","DOI":"10.1142\/S021797921950382X","volume":"33","author":"S Bai","year":"2019","unstructured":"Bai S, Fang S, Li L, Liu R, Chen X (2019) Enhancing link prediction by exploring community membership of nodes. Int J Mod Phys B 33(31):1950382","journal-title":"Int J Mod Phys B"},{"issue":"18","key":"788_CR4","doi-asserted-by":"publisher","first-page":"18619","DOI":"10.1007\/s11042-016-4270-9","volume":"76","author":"A Biswas","year":"2017","unstructured":"Biswas A, Biswas B (2017) Community-based link prediction. Multimed Tools Appl 76(18):18619\u201318639","journal-title":"Multimed Tools Appl"},{"issue":"10","key":"788_CR5","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"788_CR6","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199211517.001.0001","volume-title":"Scale-free networks: complex webs in nature and technology","author":"G Caldarelli","year":"2007","unstructured":"Caldarelli G (2007) Scale-free networks: complex webs in nature and technology. OUP Catalogue, Oxford"},{"issue":"1","key":"788_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep01613","volume":"3","author":"CV Cannistraci","year":"2013","unstructured":"Cannistraci CV, Alanis-Lobato G, Ravasi T (2013) From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci Rep 3(1):1\u201314","journal-title":"Sci Rep"},{"issue":"6","key":"788_CR8","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"key":"788_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.knosys.2016.01.034","volume":"98","author":"J Ding","year":"2016","unstructured":"Ding J, Jiao L, Wu J, Liu F (2016) Prediction of missing links based on community relevance and ruler inference. Knowl Based Syst 98:200\u2013215","journal-title":"Knowl Based Syst"},{"key":"788_CR10","doi-asserted-by":"crossref","unstructured":"Epasto A, Perozzi B (2019) Is a single embedding enough? learning node representations that capture multiple social contexts. In: The world wide web conference, pp 394\u2013404","DOI":"10.1145\/3308558.3313660"},{"issue":"3","key":"788_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders JM, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355\u2013369","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"788_CR12","doi-asserted-by":"crossref","unstructured":"Gao S, Denoyer L, Gallinari P (2011) Temporal link prediction by integrating content and structure information. In: Proceedings of the 20th ACM international conference on Information and knowledge management, pp 1169\u20131174","DOI":"10.1145\/2063576.2063744"},{"key":"788_CR13","doi-asserted-by":"crossref","unstructured":"Gao F, Musial K, Gabrys B (2017) A community bridge boosting social network link prediction model. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017, pp. 683\u2013689","DOI":"10.1145\/3110025.3110143"},{"key":"788_CR14","unstructured":"Garimella K, Gionis A, Parotsidis N, Tatti N (2017) Balancing information exposure in social networks. arXiv preprint arXiv:1709.01491"},{"key":"788_CR15","doi-asserted-by":"crossref","unstructured":"Granovetter MS (1973) The strength of weak ties. Am J Sociol 78(6):1360\u20131380","DOI":"10.1086\/225469"},{"key":"788_CR16","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"788_CR17","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1177\/0003122417705656","volume":"82","author":"B Hofstra","year":"2017","unstructured":"Hofstra B, Corten R, Van Tubergen F, Ellison NB (2017) Sources of segregation in social networks: a novel approach using facebook. Am Sociol Rev 82(3):625\u2013656","journal-title":"Am Sociol Rev"},{"issue":"2","key":"788_CR18","doi-asserted-by":"publisher","first-page":"026107","DOI":"10.1103\/PhysRevE.65.026107","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65(2):026107","journal-title":"Phys Rev E"},{"key":"788_CR19","doi-asserted-by":"crossref","unstructured":"Jeon H, Kim T (2017a). Community-adaptive link prediction. In: Proceedings of the 2017 international conference on data mining, communications and information technology","DOI":"10.1145\/3089871.3089879"},{"key":"788_CR20","doi-asserted-by":"crossref","unstructured":"Jeon H, Kim T (2017b) Community-adaptive link prediction. In: Proceedings of the 2017 international conference on data mining, communications and information technology, pp 1\u20135","DOI":"10.1145\/3089871.3089879"},{"issue":"2","key":"788_CR21","doi-asserted-by":"publisher","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E 73(2):026120","journal-title":"Phys Rev E"},{"issue":"1","key":"788_CR22","doi-asserted-by":"publisher","first-page":"2-es","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD) 1(1):2-es","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"788_CR23","doi-asserted-by":"publisher","first-page":"43233","DOI":"10.1109\/ACCESS.2019.2908208","volume":"7","author":"L Li","year":"2019","unstructured":"Li L, Fang S, Bai S, Xu S, Cheng J, Chen X (2019) Effective link prediction based on community relationship strength. IEEE Access 7:43233\u201343248","journal-title":"IEEE Access"},{"key":"788_CR24","unstructured":"Li P, Wang Y, Zhao H, Hong P, Liu H (2021) On dyadic fairness: exploring and mitigating bias in graph connections. In: Proceedings of international conference on learning representations"},{"issue":"7","key":"788_CR25","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inform Sci Technol"},{"key":"788_CR26","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.physa.2017.02.078","volume":"479","author":"S Liu","year":"2017","unstructured":"Liu S, Ji X, Liu C, Bai Y (2017) Extended resource allocation index for link prediction of complex network. Physica A 479:174\u2013183","journal-title":"Physica A"},{"issue":"5","key":"788_CR27","doi-asserted-by":"publisher","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","volume":"89","author":"W Liu","year":"2010","unstructured":"Liu W, L\u00fc L (2010) Link prediction based on local random walk. EPL (Europhys Lett) 89(5):58007","journal-title":"EPL (Europhys Lett)"},{"issue":"4","key":"788_CR28","doi-asserted-by":"publisher","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","volume":"80","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc L, Jin CH, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(4):046122","journal-title":"Phys Rev E"},{"key":"788_CR29","doi-asserted-by":"crossref","unstructured":"Masrour F, Wilson T, Yan H, Tan PN, Esfahanian A (2020) Bursting the filter bubble: Fairness-aware network link prediction. In: Proceedings of the AAAI conference on artificial intelligence, vol 34. pp 841\u2013848","DOI":"10.1609\/aaai.v34i01.5429"},{"issue":"9","key":"788_CR30","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1007\/s10115-020-01456-1","volume":"62","author":"A Matakos","year":"2020","unstructured":"Matakos A, Tu S, Gionis A (2020) Tell me something my friends do not know: diversity maximization in social networks. Knowl Inf Syst 62(9):3697\u20133726","journal-title":"Knowl Inf Syst"},{"key":"788_CR31","unstructured":"Mcauley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS, vol 2012, pp 548\u2013556"},{"issue":"1","key":"788_CR32","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Ann Rev Sociol 27(1):415\u2013444","journal-title":"Ann Rev Sociol"},{"issue":"2","key":"788_CR33","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"6","key":"788_CR34","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1088\/1367-2630\/9\/6\/179","volume":"9","author":"JP Onnela","year":"2007","unstructured":"Onnela JP, Saram\u00e4ki J, Hyv\u00f6nen J, Szab\u00f3 G, De Menezes MA, Kaski K, Barab\u00e1si AL, Kert\u00e9sz J (2007) Analysis of a large-scale weighted network of one-to-one human communication. New J Phys 9(6):179","journal-title":"New J Phys"},{"key":"788_CR35","doi-asserted-by":"crossref","unstructured":"Park S, Kang S, Chung S, Song J (2009) Newscube: delivering multiple aspects of news to mitigate media bias. In: Proceedings of the SIGCHI conference on human factors in computing systems, ACM, pp 443\u2013452","DOI":"10.1145\/1518701.1518772"},{"issue":"1","key":"788_CR36","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-017-1121-6","volume":"56","author":"A Pecli","year":"2018","unstructured":"Pecli A, Cavalcanti MC, Goldschmidt R (2018) Automatic feature selection for supervised learning in link prediction applications: a comparative study. Knowl Inf Syst 56(1):85\u2013121","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"788_CR37","first-page":"15912","volume":"5","author":"A Praveena","year":"2016","unstructured":"Praveena A, Smys S (2016) Anonymization in social networks: a survey on the issues of data privacy in social network sites. J Int J Eng Comput Sci 5(3):15912\u201315918","journal-title":"J Int J Eng Comput Sci"},{"key":"788_CR38","doi-asserted-by":"crossref","unstructured":"Rahman TA, Surma B, Backes M, Zhang Y (2019) Fairwalk: towards fair graph embedding. In: IJCAI, pp 3289\u20133295","DOI":"10.24963\/ijcai.2019\/456"},{"key":"788_CR39","unstructured":"Saxena A (2020) A survey of evolving models for weighted complex networks based on their dynamics and evolution. arXiv preprint arXiv:2012.08166"},{"key":"788_CR40","doi-asserted-by":"crossref","unstructured":"Saxena A, Iyengar S (2016) Evolving models for meso-scale structures. In: 2016 8th international conference on communication systems and networks (COMSNETS). IEEE, pp 1\u20138","DOI":"10.1109\/COMSNETS.2016.7439976"},{"key":"788_CR41","doi-asserted-by":"crossref","unstructured":"Saxena A, Hsu W, Lee ML, Leong Chieu H, Ng L, Teow LN (2020a) Mitigating misinformation in online social network with top-k debunkers and evolving user opinions. In: Companion proceedings of the web conference 2020, pp 363\u2013370","DOI":"10.1145\/3366424.3383297"},{"key":"788_CR42","doi-asserted-by":"crossref","unstructured":"Saxena A, Saxena H, Gera R (2020b) k-truthscore: Fake news mitigation in the presence of strong user bias. In: International conference on computational data and social networks, Springer, pp 113\u2013126","DOI":"10.1007\/978-3-030-66046-8_10"},{"key":"788_CR43","doi-asserted-by":"crossref","unstructured":"Saxena A, Fletcher G, Pechenizkiy M (2021) Nodesim: Node similarity based network embedding for diverse link prediction. arXiv preprint arXiv:2102.00785","DOI":"10.1140\/epjds\/s13688-022-00336-8"},{"key":"788_CR44","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ins.2019.11.026","volume":"514","author":"SS Singh","year":"2020","unstructured":"Singh SS, Mishra S, Kumar A, Biswas B (2020) Clp-id: Community-based link prediction using information diffusion. Inf Sci 514:402\u2013433","journal-title":"Inf Sci"},{"key":"788_CR45","doi-asserted-by":"crossref","unstructured":"Spinelli I, Scardapane S, Hussain A, Uncini A (2021) Biased edge dropout for enhancing fairness in graph representation learning. arXiv preprint arXiv:2104.14210","DOI":"10.1109\/TAI.2021.3133818"},{"key":"788_CR46","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan JY (2006) Fast random walk with restart and its applications. In: Sixth international conference on data mining (ICDM\u201906), IEEE, pp 613\u2013622","DOI":"10.1109\/ICDM.2006.70"},{"key":"788_CR47","doi-asserted-by":"crossref","unstructured":"Valverde-Rebaza JC, de Andrade Lopes A (2012) Link prediction in complex networks based on cluster information. In: Brazilian symposium on artificial intelligence, Springer, pp 92\u2013101","DOI":"10.1007\/978-3-642-34459-6_10"},{"issue":"1","key":"788_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5237-y","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B, Wu Y, Zhou X (2015) Link prediction in social networks: the state-of-the-art. Sci China Inf Sci 58(1):1\u201338","journal-title":"Sci China Inf Sci"},{"key":"788_CR49","doi-asserted-by":"crossref","unstructured":"Wang J, Ma Y, Liu M, Yuan H, Shen W, Li L (2017) A vertex similarity index using community information to improve link prediction accuracy. In: 2017 IEEE international conference on systems, man, and cybernetics (SMC), pp 158\u2013163","DOI":"10.1109\/SMC.2017.8122595"},{"key":"788_CR50","doi-asserted-by":"publisher","first-page":"62633","DOI":"10.1109\/ACCESS.2019.2907202","volume":"7","author":"J Wang","year":"2019","unstructured":"Wang J, Ma Y, Liu M, Shen W (2019) Link prediction based on community information and its parallelization. IEEE Access 7:62633\u201362645","journal-title":"IEEE Access"},{"key":"788_CR51","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442","DOI":"10.1038\/30918"},{"issue":"1","key":"788_CR52","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ipm.2016.10.001","volume":"53","author":"J Wu","year":"2017","unstructured":"Wu J, Zhang G, Ren Y (2017) A balanced modularity maximization link prediction model in social networks. Inf Process Manag 53(1):295\u2013307","journal-title":"Inf Process Manag"},{"key":"788_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","volume":"452","author":"Z Wu","year":"2016","unstructured":"Wu Z, Lin Y, Wang J, Gregory S (2016) Link prediction with node clustering coefficient. Physica A 452:1\u20138","journal-title":"Physica A"},{"issue":"5","key":"788_CR54","doi-asserted-by":"publisher","first-page":"056112","DOI":"10.1103\/PhysRevE.85.056112","volume":"85","author":"B Yan","year":"2012","unstructured":"Yan B, Gregory S (2012) Finding missing edges in networks based on their community structure. Phys Rev E 85(5):056112","journal-title":"Phys Rev E"},{"key":"788_CR55","unstructured":"Yu K, Chu W (2007) Gaussian process models for link analysis and transfer learning. In: NIPS, pp 1657\u20131664"},{"issue":"4","key":"788_CR56","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang YC (2009) Predicting missing links via local information. Eur Phys J B 71(4):623\u2013630","journal-title":"Eur Phys J B"},{"key":"788_CR57","doi-asserted-by":"publisher","first-page":"13707","DOI":"10.1038\/srep13707","volume":"5","author":"B Zhu","year":"2015","unstructured":"Zhu B, Xia Y (2015) An information-theoretic model for link prediction in complex networks. Sci Rep 5:13707","journal-title":"Sci Rep"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00788-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00788-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00788-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:22:43Z","timestamp":1665778963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00788-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,27]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00788-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,27]]},"assertion":[{"value":"19 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}