{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:50:57Z","timestamp":1742993457186,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030161446"},{"type":"electronic","value":"9783030161453"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16145-3_36","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:50:37Z","timestamp":1554346237000},"page":"462-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Neighbor-Based Link Prediction with Edge Uncertainty"],"prefix":"10.1007","author":[{"given":"Chi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"issue":"2","key":"36_CR1","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":"36_CR2","unstructured":"Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval (1986)"},{"key":"36_CR3","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude 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":"36_CR4","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. Soc. Netw. 25(3), 211\u2013230 (2003)","journal-title":"Soc. Netw."},{"issue":"4","key":"36_CR5","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, Y.-C.: Predicting missing links via local information. Eur. Phys. J. B-Condens. Matter Complex Syst. 71(4), 623\u2013630 (2009)","journal-title":"Eur. Phys. J. B-Condens. Matter Complex Syst."},{"issue":"4","key":"36_CR6","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, C.-H., Zhou, T.: Similarity index based on local paths for link prediction of complex networks. Phys. Rev. E 80(4), 046122 (2009)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"36_CR7","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.: Link prediction based on local random walk. EPL (Europhys. Lett.) 89(5), 58007 (2010)","journal-title":"EPL (Europhys. Lett.)"},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"48007","DOI":"10.1209\/0295-5075\/96\/48007","volume":"96","author":"Z Liu","year":"2011","unstructured":"Liu, Z., Zhang, Q.-M., L\u00fc, L., Zhou, T.: Link prediction in complex networks: a local na\u00efve Bayes model. EPL (Europhys. Lett.) 96(4), 48007 (2011)","journal-title":"EPL (Europhys. Lett.)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710. ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2015.10.036","volume":"331","author":"NM Ahmed","year":"2016","unstructured":"Ahmed, N.M., Chen, L.: An efficient algorithm for link prediction in temporal uncertain social networks. Inf. Sci. 331, 120\u2013136 (2016)","journal-title":"Inf. Sci."},{"key":"36_CR11","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-40596-4_24","volume-title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems","author":"S Mallek","year":"2016","unstructured":"Mallek, S., Boukhris, I., Elouedi, Z., Lefevre, E.: Evidential missing link prediction in uncertain social networks. In: Carvalho, J.P., Lesot, M.-J., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R.R. (eds.) IPMU 2016. CCIS, vol. 610, pp. 274\u2013285. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40596-4_24"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Murata, T., Moriyasu, S.: Link prediction of social networks based on weighted proximity measures. In: Proceedings of the IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 85\u201388. IEEE Computer Society (2007)","DOI":"10.1109\/WI.2007.52"},{"issue":"7084","key":"36_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1038\/nature04670","volume":"440","author":"NJ Krogan","year":"2006","unstructured":"Krogan, N.J., et al.: Global landscape of protein complexes in the yeast Saccharomyces cerevisiae. Nature 440(7084), 637 (2006)","journal-title":"Nature"},{"key":"36_CR14","unstructured":"Pfeiffer, J.J., Neville, J.: Probabilistic paths and centrality in time. In: Proceedings of the 4th SNA-KDD Workshop, KDD 2010 (2010)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, C., Za\u00efane, O.R.: Detecting local communities in networks with edge uncertainty. In: 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 9\u201316. IEEE (2018)","DOI":"10.1109\/ASONAM.2018.8508543"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16145-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:06:26Z","timestamp":1710335186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16145-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030161446","9783030161453"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16145-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pakdd2019.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft Conf. Man. Toolkit CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"542","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":"137","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":"0","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":"25% - 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.79","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":"5.85","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)"}},{"value":"In addition, there were 31 PAKDD 2019 Workshops' papers accepted for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}