{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:53:55Z","timestamp":1726034035614},"reference-count":32,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,3,19]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link prediction is one of the methods of social network analysis. Bipartite networks are a type of complex network that can be used to model many natural events. In this study, a novel similarity measure for link prediction in bipartite networks is presented. Due to the fact that classical social network link prediction methods are less efficient and effective for use in bipartite network, it is necessary to use bipartite network-specific methods to solve this problem. The purpose of this study is to provide a centralized and comprehensive method based on the neighborhood structure that performs better than the existing classical methods. The proposed method consists of a combination of criteria based on the neighborhood structure. Here, the classical criteria for link prediction by modifying the bipartite network are defined. These modified criteria constitute the main component of the proposed similarity measure. In addition to low simplicity and complexity, this method has high efficiency. The simulation results show that the proposed method with a superiority of 0.5% over MetaPath, 1.32% over FriendLink, and 1.8% over Katz in the<jats:italic>f<\/jats:italic>-measure criterion shows the best performance.<\/jats:p>","DOI":"10.1515\/comp-2022-0233","type":"journal-article","created":{"date-parts":[[2022,3,20]],"date-time":"2022-03-20T01:25:22Z","timestamp":1647739522000},"page":"112-122","source":"Crossref","is-referenced-by-count":1,"title":["A novel similarity measure of link prediction in bipartite social networks based on neighborhood structure"],"prefix":"10.1515","volume":"12","author":[{"given":"Fariba","family":"Sarhangnia","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Bushehr Branch, Islamic Azad University , Bushehr , Iran"}]},{"given":"Shima","family":"Mahjoobi","sequence":"additional","affiliation":[{"name":"Department of Electronics Technology Engineering, Pishtazan of University , Shiraz , Iran"}]},{"given":"Samaneh","family":"Jamshidi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Bushehr Branch, Islamic Azad University , Bushehr , Iran"}]}],"member":"374","published-online":{"date-parts":[[2022,3,19]]},"reference":[{"key":"2022081707553226570_j_comp-2022-0233_ref_001","doi-asserted-by":"crossref","unstructured":"W. Yuan, K. He, D. Guan, L. Zhou, and C. Li, \u201cGraph kernel based link prediction for signed social networks,\u201d Inf. Fusion., vol. 46, pp. 1\u201310, 2019.","DOI":"10.1016\/j.inffus.2018.04.004"},{"key":"2022081707553226570_j_comp-2022-0233_ref_002","doi-asserted-by":"crossref","unstructured":"Z. Samei and M. Jalili, \u201cApplication of hyperbolic geometry in link prediction of multiplex networks,\u201d Sci. Rep., vol. 9, no. 1, pp. 1\u201311, 2019.","DOI":"10.1038\/s41598-019-49001-7"},{"key":"2022081707553226570_j_comp-2022-0233_ref_003","doi-asserted-by":"crossref","unstructured":"P. Pei, B. Liu, and L. Jiao, \u201cLink prediction in complex networks based on an information allocation index,\u201d Phys. A: Stat. Mech. its Appl., vol. 470, pp. 1\u201311, 2017.","DOI":"10.1016\/j.physa.2016.11.069"},{"key":"2022081707553226570_j_comp-2022-0233_ref_004","doi-asserted-by":"crossref","unstructured":"M. S. Aslanpour, S. E. Dashti, M. Ghobaei-Arani, and A. A. Rahmanian, \u201cResource provisioning for cloud applications: a 3-D, provident and flexible approach,\u201d J. Supercomput., vol. 74, no. 12, pp. 6470\u20136501, 2018.","DOI":"10.1007\/s11227-017-2156-x"},{"key":"2022081707553226570_j_comp-2022-0233_ref_005","doi-asserted-by":"crossref","unstructured":"M. Etemadi, M. Ghobaei-Arani, and A. Shahidinejad, \u201cResource provisioning for IoT services in the fog computing environment: An autonomic approach,\u201d Comput. Commun., vol. 161, pp. 109\u2013131, 2020.","DOI":"10.1016\/j.comcom.2020.07.028"},{"key":"2022081707553226570_j_comp-2022-0233_ref_006","doi-asserted-by":"crossref","unstructured":"T. M. Tuan, P. M. Chuan, M. Ali, T. T. Ngan, and M. Mittal, \u201cFuzzy and neutrosophic modeling for link prediction in social networks,\u201d Evol. Syst., vol. 10, no. 4, pp. 629\u2013634, 2019.","DOI":"10.1007\/s12530-018-9251-y"},{"key":"2022081707553226570_j_comp-2022-0233_ref_007","doi-asserted-by":"crossref","unstructured":"E. Nasiri, K. Berahmand, and Y. Li, \u201cA new link prediction in multiplex networks using topologically biased random walks,\u201d Chaos, Solitons Fractals, vol. 151, p. 111230, 2021.","DOI":"10.1016\/j.chaos.2021.111230"},{"key":"2022081707553226570_j_comp-2022-0233_ref_008","doi-asserted-by":"crossref","unstructured":"K. Berahmand and A. Bouyer, \u201cLP-LPA: a link influence-based label propagation algorithm for discovering community structures in networks,\u201d Int. J. Mod. Phys. B, vol. 32, no. 06, p. 1850062, 2018.","DOI":"10.1142\/S0217979218500625"},{"key":"2022081707553226570_j_comp-2022-0233_ref_009","doi-asserted-by":"crossref","unstructured":"R. Yang, C. Yang, X. Peng, and A. Rezaeipanah, \u201cA novel similarity measure of link prediction in multi\u2010layer social networks based on reliable paths,\u201d Concurrency Computation: Pract. Experience, p. e6829, 2022. 10.1002\/cpe.6829.","DOI":"10.1002\/cpe.6829"},{"key":"2022081707553226570_j_comp-2022-0233_ref_010","doi-asserted-by":"crossref","unstructured":"K. Berahmand, E. Nasiri, M. Rostami, and S. Forouzandeh, \u201cA modified DeepWalk method for link prediction in attributed social network,\u201d Computing, vol. 103, no. 10, pp. 2227\u20132249, 2021.","DOI":"10.1007\/s00607-021-00982-2"},{"key":"2022081707553226570_j_comp-2022-0233_ref_011","doi-asserted-by":"crossref","unstructured":"S. Mallek, I. Boukhris, Z. Elouedi, and E. Lef\u00e8vre, \u201cEvidential link prediction in social networks based on structural and social information,\u201d J. Comput. Sci., vol. 30, pp. 98\u2013107, 2019.","DOI":"10.1016\/j.jocs.2018.11.009"},{"key":"2022081707553226570_j_comp-2022-0233_ref_012","doi-asserted-by":"crossref","unstructured":"E. Nasiri, K. Berahmand, M. Rostami, and M. Dabiri, \u201cA novel link prediction algorithm for protein-protein interaction networks by attributed graph embedding,\u201d Comput. Biol. Med., vol. 137, p. 104772, 2021.","DOI":"10.1016\/j.compbiomed.2021.104772"},{"key":"2022081707553226570_j_comp-2022-0233_ref_013","doi-asserted-by":"crossref","unstructured":"A. Rezaeipanah, G. Ahmadi, and S. Sechin Matoori, \u201cA classification approach to link prediction in multiplex online ego-social networks,\u201d Soc. Netw. Anal. Min., vol. 10, no. 1, pp. 1\u201316, 2020.","DOI":"10.1007\/s13278-020-00639-6"},{"key":"2022081707553226570_j_comp-2022-0233_ref_014","doi-asserted-by":"crossref","unstructured":"D. Liben\u2010Nowell and J. Kleinberg, \u201cThe link\u2010prediction problem for social networks,\u201d J. Am. Soc. Inf. Sci. Technol., vol. 58, no. 7, pp. 1019\u20131031, 2007.","DOI":"10.1002\/asi.20591"},{"key":"2022081707553226570_j_comp-2022-0233_ref_015","doi-asserted-by":"crossref","unstructured":"M. Al Hasan, M. J. Zaki, A survey of link prediction in social networks, Social network data analytics, Boston, MA, Springer, 2011, pp. 243\u2013275.","DOI":"10.1007\/978-1-4419-8462-3_9"},{"key":"2022081707553226570_j_comp-2022-0233_ref_016","doi-asserted-by":"crossref","unstructured":"A. Zareie and R. Sakellariou, \u201cSimilarity-based link prediction in social networks using latent relationships between the users,\u201d Sci. Rep., vol. 10, no. 1, pp. 1\u201311, 2020.","DOI":"10.1038\/s41598-020-76799-4"},{"key":"2022081707553226570_j_comp-2022-0233_ref_017","doi-asserted-by":"crossref","unstructured":"K. Li, L. Tu, and L. Chai, \u201cEnsemble-model-based link prediction of complex networks,\u201d Computer Netw., vol. 166, p. 106978, 2020.","DOI":"10.1016\/j.comnet.2019.106978"},{"key":"2022081707553226570_j_comp-2022-0233_ref_018","doi-asserted-by":"crossref","unstructured":"S. Rafiee, C. Salavati, and A. Abdollahpouri, \u201cCNDP: link prediction based on common neighbors degree penalization,\u201d Phys. A: Stat. Mech. its Appl., vol. 539, p. 122950, 2020.","DOI":"10.1016\/j.physa.2019.122950"},{"key":"2022081707553226570_j_comp-2022-0233_ref_019","doi-asserted-by":"crossref","unstructured":"H. Jiang, Z. Liu, C. Liu, Y. Su, and X. Zhang, \u201cCommunity detection in complex networks with an ambiguous structure using central node based link prediction,\u201d Knowl. Syst., vol. 195, p. 105626, 2020.","DOI":"10.1016\/j.knosys.2020.105626"},{"key":"2022081707553226570_j_comp-2022-0233_ref_020","doi-asserted-by":"crossref","unstructured":"R. Yan, Y. Li, D. Li, W. Wu, and Y. Wang, \u201cSSDBA: the stretch shrink distance based algorithm for link prediction in social networks,\u201d Front. Comput. Sci., vol. 15, no. 1, pp. 1\u20138, 2021.","DOI":"10.1007\/s11704-019-9083-3"},{"key":"2022081707553226570_j_comp-2022-0233_ref_021","doi-asserted-by":"crossref","unstructured":"M. K. Manshad, M. R. Meybodi, and A. Salajegheh, \u201cA new irregular cellular learning automata-based evolutionary computation for time series link prediction in social networks,\u201d Appl. Intell., vol. 51, no. 1, pp. 71\u201384, 2021.","DOI":"10.1007\/s10489-020-01685-5"},{"key":"2022081707553226570_j_comp-2022-0233_ref_022","doi-asserted-by":"crossref","unstructured":"S. Najari, M. Salehi, V. Ranjbar, and M. Jalili, \u201cLink prediction in multiplex networks based on interlayer similarity,\u201d Phys. A: Stat. Mech. Appl., vol. 536, p. 120978, 2019.","DOI":"10.1016\/j.physa.2019.04.214"},{"key":"2022081707553226570_j_comp-2022-0233_ref_023","doi-asserted-by":"crossref","unstructured":"D. Malhotra and R. Goyal, \u201cSupervised-learning link prediction in single layer and multiplex networks,\u201d Mach. Learn. Appl., vol. 6, p. 100086, 2021.","DOI":"10.1016\/j.mlwa.2021.100086"},{"key":"2022081707553226570_j_comp-2022-0233_ref_024","doi-asserted-by":"crossref","unstructured":"N. Shan, L. Li, Y. Zhang, S. Bai, and X. Chen, \u201cSupervised link prediction in multiplex networks,\u201d Knowl. Syst., vol. 203, p. 106168, 2020.","DOI":"10.1016\/j.knosys.2020.106168"},{"key":"2022081707553226570_j_comp-2022-0233_ref_025","doi-asserted-by":"crossref","unstructured":"M. Jalili, Y. Orouskhani, M. Asgari, N. Alipourfard, and M. Perc, \u201cLink prediction in multiplex online social networks,\u201d R. Soc. open. Sci., vol. 4, no. 2, p. 160863, 2017.","DOI":"10.1098\/rsos.160863"},{"key":"2022081707553226570_j_comp-2022-0233_ref_026","doi-asserted-by":"crossref","unstructured":"F. Lorrain and H. C. White, \u201cStructural equivalence of individuals in social networks,\u201d J. Math. Sociol., vol. 1, no. 1, pp. 49\u201380, 1971.","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"2022081707553226570_j_comp-2022-0233_ref_027","doi-asserted-by":"crossref","unstructured":"S. Niwattanakul, J. Singthongchai, E. Naenudorn, and S. Wanapu, \u201cUsing of Jaccard coefficient for keywords similarity,\u201d Proc. Int. Multiconference Eng. Comput. Sci., vol. 1, no. 6, pp. 380\u2013384, 2013, March.","DOI":"10.12720\/lnit.1.4.159-164"},{"key":"2022081707553226570_j_comp-2022-0233_ref_028","doi-asserted-by":"crossref","unstructured":"L. A. Adamic and E. Adar, \u201cFriends and neighbors on the web,\u201d Soc. Netw., vol. 25, no. 3, pp. 211\u2013230, 2003.","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"2022081707553226570_j_comp-2022-0233_ref_029","unstructured":"H. Chen, X. Li, Z. Huang, Link prediction approach to collaborative filtering, Proceedings of the 5th ACM\/IEEE-CS Joint Conference on Digital Libraries (JCDL'05) IEEE, 2005, June, pp. 141\u2013142."},{"key":"2022081707553226570_j_comp-2022-0233_ref_030","doi-asserted-by":"crossref","unstructured":"L. Katz, \u201cA new status index derived from sociometric analysis,\u201d Psychometrika, vol. 18, no. 1, pp. 39\u201343, 1953.","DOI":"10.1007\/BF02289026"},{"key":"2022081707553226570_j_comp-2022-0233_ref_031","doi-asserted-by":"crossref","unstructured":"A. Papadimitriou, P. Symeonidis, and Y. Manolopoulos, \u201cFast and accurate link prediction in social networking systems,\u201d J. Syst. Softw., vol. 85, no. 9, pp. 2119\u20132132, 2012.","DOI":"10.1016\/j.jss.2012.04.019"},{"key":"2022081707553226570_j_comp-2022-0233_ref_032","doi-asserted-by":"crossref","unstructured":"C. Cheadle, M. P. Vawter, W. J. Freed, and K. G. Becker, \u201cAnalysis of microarray data using Z score transformation,\u201d J. Mol. diagnostics, vol. 5, no. 2, pp. 73\u201381, 2003.","DOI":"10.1016\/S1525-1578(10)60455-2"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0233\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0233\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T15:01:28Z","timestamp":1675004488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0233\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,3,16]]},"published-print":{"date-parts":[[2022,3,16]]}},"alternative-id":["10.1515\/comp-2022-0233"],"URL":"https:\/\/doi.org\/10.1515\/comp-2022-0233","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}