{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:54:17Z","timestamp":1743072857974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306747"},{"type":"electronic","value":"9783031306754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30675-4_12","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"172-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["MRSCN: A GNN-based Model for\u00a0Mining Relationship Strength Changes Between Nodes in\u00a0Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Tianbao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yajun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Qinghua","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"issue":"3","key":"12_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, L.A., Adar, E.: Friends and neighbors on the web. Soc. Networks 25(3), 211\u2013230 (2003)","journal-title":"Soc. Networks"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: Grarep: Learning graph representations with global structural information. In: CIKM, pp. 891\u2013900. ACM (2015)","DOI":"10.1145\/2806416.2806512"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: Deep neural networks for learning graph representations. In: AAAI, pp. 1145\u20131152. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10179"},{"issue":"18","key":"12_CR4","doi-asserted-by":"publisher","first-page":"2456","DOI":"10.1016\/j.dam.2007.06.015","volume":"155","author":"JJ Cho","year":"2007","unstructured":"Cho, J.J., Chen, Y., Ding, Y.: On the (co)girth of a connected matroid. Discret. Appl. Math. 155(18), 2456\u20132470 (2007)","journal-title":"Discret. Appl. Math."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Church, K.W., Hanks, P.: Word association norms, mutual information and lexicography. In: ACL, pp. 76\u201383. ACL (1989)","DOI":"10.3115\/981623.981633"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: ISAAC, pp. 403\u2013414. Springer (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Gao, H., Huang, H.: Deep attributed network embedding. In: IJCAI, pp. 3364\u20133370. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/467"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: KDD, pp. 855\u2013864. ACM (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"12_CR9","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034 (2017)"},{"issue":"2","key":"12_CR10","first-page":"782","volume":"33","author":"X Jia","year":"2021","unstructured":"Jia, X., Li, X., Du, N., Zhang, Y., Gopalakrishnan, V., Xun, G., Zhang, A.: Tracking community consistency in dynamic networks: An influence-based approach. IEEE Trans. Knowl. Data Eng. 33(2), 782\u2013795 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.neucom.2016.11.075","volume":"253","author":"C Ju","year":"2017","unstructured":"Ju, C., Tao, W.: Relationship strength estimation based on wechat friends circle. Neurocomputing 253, 15\u201323 (2017)","journal-title":"Neurocomputing"},{"key":"12_CR12","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. CoRR abs\/1609.02907 (2016)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: KDD, pp. 701\u2013710. ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TBDATA.2020.2974849","volume":"8","author":"H Qin","year":"2022","unstructured":"Qin, H., Li, R., Wang, G., Huang, X., Yuan, Y., Yu, J.X.: Mining stable communities in temporal networks by density-based clustering. IEEE Trans. Big Data 8(3), 671\u2013684 (2022)","journal-title":"IEEE Trans. Big Data"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Qin, H., Li, R., Wang, G., Qin, L., Cheng, Y., Yuan, Y.: Mining periodic cliques in temporal networks. In: ICDE, pp. 1130\u20131141. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00104"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Networks 20(1), 61\u201380 (2009)","journal-title":"IEEE Trans. Neural Networks"},{"key":"12_CR17","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. CoRR abs\/1710.10903 (2017)"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11280-013-0204-x","volume":"17","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Yu, J.X., Gao, H., Pei, J., Li, J.: Mining most frequently changing component in evolving graphs. World Wide Web 17(3), 351\u2013376 (2014)","journal-title":"World Wide Web"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30675-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:07:53Z","timestamp":1710245273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30675-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306747","9783031306754"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30675-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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 CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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":"7.3","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)"}}]}}