{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:31:37Z","timestamp":1742949097589,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819996360"},{"type":"electronic","value":"9789819996377"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-9637-7_18","type":"book-chapter","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:02:38Z","timestamp":1704380558000},"page":"252-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Attention and Time Perception Based Link Prediction in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Li","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoya","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MD Masum Billa","family":"Shagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp. 556\u2013559 (2003)","DOI":"10.1145\/956863.956972"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","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"},{"key":"18_CR4","unstructured":"Mikolov, T., Chen, K., Corrado, G., et al.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)"},{"key":"18_CR5","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 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"18_CR7","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"18_CR8","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., et al.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-24797-2_4","volume-title":"Supervised sequence labelling with recurrent neural networks","author":"A Graves","year":"2012","unstructured":"Graves, A.: Long short-term memory. In: Graves, A. (ed.) Supervised sequence labelling with recurrent neural networks, pp. 37\u201345. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24797-2_4"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cho, K., Van Merri\u00ebnboer, B., Gulcehre, C., et al.: Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014)","DOI":"10.3115\/v1\/D14-1179"},{"key":"18_CR11","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems 30 (2017)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Sankar, A., Wu, Y., Gou, L., et al.: DySAT: deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 519\u2013527 (2020)","DOI":"10.1145\/3336191.3371845"},{"key":"18_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106746","volume":"214","author":"S Min","year":"2021","unstructured":"Min, S., Gao, Z., Peng, J., et al.: STGSN\u2014a spatial-temporal graph neural network framework for time-evolving social networks. Knowl.-Based Syst. 214, 106746 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Lei, K., Qin, M., Bai, B., et al.: GCN-GAN: a non-linear temporal link prediction model for weighted dynamic networks. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp. 388\u2013396. IEEE (2019)","DOI":"10.1109\/INFOCOM.2019.8737631"},{"issue":"12","key":"18_CR15","doi-asserted-by":"publisher","first-page":"4946","DOI":"10.1109\/TCYB.2019.2920268","volume":"50","author":"M Yang","year":"2019","unstructured":"Yang, M., Liu, J., Chen, L., et al.: An advanced deep generative framework for temporal link prediction in dynamic networks. IEEE Trans. Cybern. 50(12), 4946\u20134957 (2019)","journal-title":"IEEE Trans. Cybern."},{"issue":"04","key":"18_CR16","doi-asserted-by":"publisher","first-page":"5363","DOI":"10.1609\/aaai.v34i04.5984","volume":"34","author":"A Pareja","year":"2020","unstructured":"Pareja, A., et al.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. Proc. AAAI Conf. Artif. Intell. 34(04), 5363\u20135370 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i04.5984","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29, issue 1 (2015).https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, G.H., Lee, J.B., Rossi, R.A., et al.: Continuous-time dynamic network embeddings. In: Companion Proceedings of the Web Conference, pp. 969\u2013976 (2018)","DOI":"10.1145\/3184558.3191526"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"3699","DOI":"10.1109\/TSMC.2019.2932913","volume":"51","author":"J Chen","year":"2019","unstructured":"Chen, J., Zhang, J., Xu, X., et al.: E-LSTM-D: a deep learning framework for dynamic network link prediction. IEEE Trans. Syst. Man, Cybern. Syst. 51(6), 3699\u20133712 (2019)","journal-title":"IEEE Trans. Syst. Man, Cybern. Syst."},{"key":"18_CR20","unstructured":"Xu, D., Ruan, C., Korpeoglu, E., et al.: Inductive representation learning on temporal graphs. arXiv preprint arXiv:2002.07962 (2020)"},{"key":"18_CR21","unstructured":"Chen, J., Wang, X., Xu, X.: GC-LSTM: graph convolution embedded LSTM for dynamic network link prediction. Appl. Intell., 1\u201316 (2022)"},{"key":"18_CR22","unstructured":"Zhang, M., Xu, B., Wang, L.: Dynamic network link prediction based on random walking and time aggregation. Int. J. Mach. Learn. Cybern., 1\u20139 (2023)"}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-9637-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:06:55Z","timestamp":1704380815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-9637-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819996360","9789819996377"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-9637-7_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work  and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinesecscw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/ccscw\/2023","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":"Yes. Microsoft CMT.","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","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":"54","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":"28","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":"24% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}