{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:45:14Z","timestamp":1743029114959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067938"},{"type":"electronic","value":"9783031067945"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06794-5_2","type":"book-chapter","created":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T23:03:27Z","timestamp":1656889407000},"page":"17-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Link Prediction Based on Sampled Single Vertices"],"prefix":"10.1007","author":[{"given":"Wenxin","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Bolun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zifan","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Yongtao","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Lichtenwalter, R.N.: New precepts and method in link prediction. In: Proceedings of ACM KDD 2010, pp. 243\u2013252 (2010)","DOI":"10.1145\/1835804.1835837"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L Lv","year":"2011","unstructured":"Lv, L., Zhou, T.: Link prediction in complex networks: a survey. Physica A 390(6), 1150\u20131170 (2011)","journal-title":"Physica A"},{"issue":"5","key":"2_CR3","first-page":"651","volume":"39","author":"L Lv","year":"2010","unstructured":"Lv, L.: Complex network link prediction. J. Univ. Electron. Sci. Technol. 39(5), 651\u2013661 (2010). (In Chinese)","journal-title":"J. Univ. Electron. Sci. Technol."},{"issue":"9","key":"2_CR4","doi-asserted-by":"publisher","first-page":"2119","DOI":"10.1016\/j.jss.2012.04.019","volume":"85","author":"A Papadimitriou","year":"2012","unstructured":"Papadimitriou, A., Symeonidis, P., Manolopoulos, Y.: Fast and accurate link prediction in social networking systems. J. Syst. Softw. 85(9), 2119\u20132132 (2012)","journal-title":"J. Syst. Softw."},{"issue":"13","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1016\/j.comcom.2012.05.003","volume":"35","author":"T Hossmann","year":"2012","unstructured":"Hossmann, T., Nomikos, G., Spyropoulos, T., Legendre, F.: Collection and analysis of multi-dimensional network data for opportunistic networking research. Comput. Commun. 35(13), 1613\u20131625 (2012)","journal-title":"Comput. Commun."},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.pmcj.2012.07.007","volume":"8","author":"K Jahanbakhsh","year":"2012","unstructured":"Jahanbakhsh, K., King, V., Shoja, G.C.: Predicting missing contacts in mobile social networks. Pervasive Mob. Comput. 8(5), 698\u2013716 (2012)","journal-title":"Pervasive Mob. Comput."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Sun, Y., Barber, R., Gupta, M., Aggarwal, C.C., Han, J.: Co-author relationship prediction in heterogeneous bibliographic networks. In: 2011 International Conference on Advances in Social Networks Analysis and Mining, pp. 121\u2013128. IEEE (2011)","DOI":"10.1109\/ASONAM.2011.112"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1016\/j.dss.2012.09.019","volume":"54","author":"X Li","year":"2013","unstructured":"Li, X., Chen, H.: Recommendation as link prediction in bipartite graphs: a graph kernel-based machine learning approach. Decis. Support Syst. 54(2), 880\u2013890 (2013)","journal-title":"Decis. Support Syst."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/ijoc.1080.0292","volume":"21","author":"Z Huang","year":"2009","unstructured":"Huang, Z., Lin, D.K.: The time-series link prediction problem with applications in communication surveillance. INFORMS J. Comput. 21(2), 286\u2013303 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.32604\/cmc.2022.019776","volume":"70","author":"T Boongoen","year":"2022","unstructured":"Boongoen, T., Iam-On, N.: Using link-based consensus clustering for mixed-type data analysis. Comput. Mater. Continua 70(1), 1993\u20132011 (2022)","journal-title":"Comput. Mater. Continua"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"3875","DOI":"10.32604\/cmc.2022.020744","volume":"70","author":"D Kothandaraman","year":"2021","unstructured":"Kothandaraman, D., et al.: Energy and bandwidth based link stability routing algorithm for IoT. Comput. Mater. Continua 70(2), 3875\u20133890 (2021)","journal-title":"Comput. Mater. Continua"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"877","DOI":"10.32604\/cmc.2021.016887","volume":"68","author":"SA Khan","year":"2021","unstructured":"Khan, S.A., Alharbi, A., Faizan, M., Alosaimi, W.: A link analysis algorithm for identification of key hidden services. Comput. Mater. Continua 68(1), 877\u2013886 (2021)","journal-title":"Comput. Mater. Continua"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.32604\/jbd.2019.06290","volume":"1","author":"J Qi","year":"2019","unstructured":"Qi, J., Ren, Y., Wang, Q.: Network electronic record management based on linked data. J. Big Data 1(1), 9 (2019)","journal-title":"J. Big Data"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"933","DOI":"10.32604\/csse.2022.021078","volume":"41","author":"H Al-Tarawneh","year":"2022","unstructured":"Al-Tarawneh, H., Al-Kaabneh, K., Alhroob, A., Migdady, H., Alhadid, I.: A hybrid heuristic algorithm for solving covid-19\u2019s social distancing at universities campus. Comput. Syst. Sci. Eng. 41(3), 933\u2013944 (2022)","journal-title":"Comput. Syst. Sci. Eng."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Liu, H.: Using link prediction to infer network evolution mechanism. Chin. Sci. Phys. Mech. Astronomy 41(7), 816\u2013823 (2011)","DOI":"10.1360\/132010-922"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman, M.E.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64(2), 025102 (2001)","journal-title":"Phys. Rev. E"},{"key":"2_CR17","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: Etude comparative de la distribution florale dans une portion des alpes et des jura. Bull. Soc. Vaudoise Sci. Nat. 37, 547\u2013579 (1901)","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the web. Social Netw. 25(3), 211\u2013230 (2003)","journal-title":"Social Netw."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Baraba\u0301si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","DOI":"10.1126\/science.286.5439.509"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Klein, D.J., Randi, C.M.: Resistance distance. J. Math. Chem. 12(1), 81\u201395 (1993)","DOI":"10.1007\/BF01164627"},{"issue":"3","key":"2_CR22","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, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","volume":"89","author":"W Liu","year":"2010","unstructured":"Liu, W., Lv, L.: Link prediction based on local random walk. EPL (Europhys. Lett.) 89(5), 58007 (2010)","journal-title":"EPL (Europhys. Lett.)"},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"046115","DOI":"10.1103\/PhysRevE.76.046115","volume":"76","author":"T Zhou","year":"2007","unstructured":"Zhou, T., Ren, J., Medo, M., Zhang, Y.C.: Bipartite network projection and personal recommendation. Phys. Rev. E 76(4), 046115 (2007)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley, J.A., McNeil, B.J.: The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143(1), 29\u201336 (1982)","journal-title":"Radiology"},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inform. Syst. (TOIS) 22(1), 5\u201353 (2004)","journal-title":"ACM Trans. Inform. Syst. (TOIS)"},{"key":"2_CR29","unstructured":"http:\/\/www.linkprediction.org\/index.php\/link\/resource\/data"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06794-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T17:57:45Z","timestamp":1676051865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06794-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067938","9783031067945"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06794-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Adaptive and Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qinghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icais2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icaisconf.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1124","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}