{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T11:03:28Z","timestamp":1761563008307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466601"},{"type":"electronic","value":"9783031466618"}],"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-46661-8_52","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"787-801","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Interest Aware Graph Convolution Network for\u00a0Social Recommendation"],"prefix":"10.1007","author":[{"given":"Zhengyi","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanmin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaobo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengyuan","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Cen, Y., Zhang, J., Zou, X., Zhou, C., Yang, H., Tang, J.: Controllable multi-interest framework for recommendation. In: KDD 2020, pp. 2942\u20132951. ACM (2020)","DOI":"10.1145\/3394486.3403344"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Chen, L., Wu, L., Hong, R., Zhang, K., Wang, M.: Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach. In: AAAI 2020, pp. 27\u201334. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1146\/annurev.psych.55.090902.142015","volume":"55","author":"RB Cialdini","year":"2004","unstructured":"Cialdini, R.B., Goldstein, N.J.: Social influence: compliance and conformity. Annu. Rev. Psychol. 55, 591\u2013621 (2004)","journal-title":"Annu. Rev. Psychol."},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, Q., Cheng, M.: Deep modeling of social relations for recommendation. In: AAAI 2018, pp. 8075\u20138076. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.12132"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W., et al.: Graph neural networks for social recommendation. In: WWW 2019, pp. 417\u2013426. ACM (2019)","DOI":"10.1145\/3308558.3313488"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Guo, G., Zhang, J., Yorke-Smith, N.: Trustsvd: collaborative filtering with both the explicit and implicit influence of user trust and of item ratings. In: AAAI 2015, pp. 123\u2013129. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9153"},{"key":"52_CR7","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS 2017, pp. 1024\u20131034 (2017)"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., Tao, Q., Tang, Y., Xia, Y.: DH-HGCN: dual homogeneity hypergraph convolutional network for multiple social recommendations. In: SIGIR 2022, pp. 2190\u20132194. ACM (2022)","DOI":"10.1145\/3477495.3531828"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., Wang, M.: Lightgcn: simplifying and powering graph convolution network for recommendation. In: SIGIR 2020, pp. 639\u2013648. ACM (2020)","DOI":"10.1145\/3397271.3401063"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: RecSys 2010, pp. 135\u2013142. ACM (2010)","DOI":"10.1145\/1864708.1864736"},{"issue":"11","key":"52_CR11","first-page":"2789","volume":"26","author":"M Jiang","year":"2014","unstructured":"Jiang, M., Cui, P., Wang, F., Zhu, W., Yang, S.: Scalable recommendation with social contextual information. TKDE 26(11), 2789\u20132802 (2014)","journal-title":"TKDE"},{"key":"52_CR12","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: ICLR 2015 (2015)"},{"key":"52_CR13","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR 2017. OpenReview.net (2017)"},{"issue":"8","key":"52_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R.M., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Li, C., et al.: Multi-interest network with dynamic routing for recommendation at tmall. In: CIKM 2019, pp. 2615\u20132623. ACM (2019)","DOI":"10.1145\/3357384.3357814"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Z., Lian, J., Yang, J., Lian, D., Xie, X.: Octopus: comprehensive and elastic user representation for the generation of recommendation candidates. In: SIGIR 2017, pp. 289\u2013298. ACM (2020)","DOI":"10.1145\/3397271.3401088"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Ma, H., King, I., Lyu, M.R.: Learning to recommend with social trust ensemble. In: SIGIR 2009, pp. 203\u2013210. ACM (2009)","DOI":"10.1145\/1639714.1639746"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Ma, H., Yang, H., Lyu, M.R., King, I.: Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, pp. 931\u2013940. Association for Computing Machinery, New York (2008)","DOI":"10.1145\/1458082.1458205"},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Ma, H., Zhou, D., Liu, C., Lyu, M.R., King, I.: Recommender systems with social regularization. In: WSDM 2011, pp. 287\u2013296. ACM (2011)","DOI":"10.1145\/1935826.1935877"},{"issue":"1","key":"52_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415\u2013444 (2001)","journal-title":"Ann. Rev. Sociol."},{"key":"52_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-031-00126-0_9","volume-title":"DASFAA 2022","author":"H Miao","year":"2022","unstructured":"Miao, H., Li, A., Yang, B.: Meta-path enhanced lightweight graph neural network for social recommendation. In: Bhattacharya, A., et al. (eds.) DASFAA 2022. LNCS, vol. 13246, pp. 134\u2013149. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-00126-0_9"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Quan, Y., Ding, J., Gao, C., Yi, L., Jin, D., Li, Y.: Robust preference-guided denoising for graph based social recommendation. In: WWW 2023, pp. 1097\u20131108. ACM (2023)","DOI":"10.1145\/3543507.3583374"},{"key":"52_CR23","unstructured":"Sabour, S., Frosst, N., Hinton, G.E.: Dynamic routing between capsules. In: NIPS 2017, pp. 3856\u20133866 (2017)"},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Tan, Q., Zhang, J., Yao, J., Liu, N., Zhou, J., Yang, H., Hu, X.: Sparse-interest network for sequential recommendation. In: WSDM 2021, pp. 598\u2013606. ACM (2021)","DOI":"10.1145\/3437963.3441811"},{"key":"52_CR25","doi-asserted-by":"crossref","unstructured":"Tao, Y., Li, Y., Zhang, S., Hou, Z., Wu, Z.: Revisiting graph based social recommendation: a distillation enhanced social graph network. In: WWW 2022, pp. 2830\u20132838. ACM (2022)","DOI":"10.1145\/3485447.3512003"},{"key":"52_CR26","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Nie, L., Chua, T.: Item silk road: recommending items from information domains to social users. In: SIGIR 2017, pp. 185\u2013194. ACM (2017)","DOI":"10.1145\/3077136.3080771"},{"key":"52_CR27","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Wang, M., Feng, F., Chua, T.: Neural graph collaborative filtering. In: SIGIR 2019, pp. 165\u2013174. ACM (2019)","DOI":"10.1145\/3331184.3331267"},{"key":"52_CR28","doi-asserted-by":"crossref","unstructured":"Wu, J., Fan, W., Chen, J., Liu, S., Li, Q., Tang, K.: Disentangled contrastive learning for social recommendation. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, CIKM 2022, pp. 4570\u20134574. Association for Computing Machinery (2022)","DOI":"10.1145\/3511808.3557583"},{"issue":"10","key":"52_CR29","first-page":"4753","volume":"34","author":"L Wu","year":"2022","unstructured":"Wu, L., Li, J., Sun, P., Hong, R., Ge, Y., Wang, M.: Diffnet++: a neural influence and interest diffusion network for social recommendation. TKDE 34(10), 4753\u20134766 (2022)","journal-title":"TKDE"},{"key":"52_CR30","doi-asserted-by":"crossref","unstructured":"Wu, L., Sun, P., Fu, Y., Hong, R., Wang, X., Wang, M.: A neural influence diffusion model for social recommendation. In: SIGIR 2019, pp. 235\u2013244. ACM (2019)","DOI":"10.1145\/3331184.3331214"},{"key":"52_CR31","doi-asserted-by":"crossref","unstructured":"Wu, Q., et al.: Dual graph attention networks for deep latent representation of multifaceted social effects in recommender systems. In: WWW 2019, pp. 2091\u20132102. ACM (2019)","DOI":"10.1145\/3308558.3313442"},{"key":"52_CR32","unstructured":"Yang, B., Lei, Y., Liu, D., Liu, J.: Social collaborative filtering by trust. In: IJCAI 2013, pp. 2747\u20132753. IJCAI\/AAAI (2013)"},{"key":"52_CR33","doi-asserted-by":"crossref","unstructured":"Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W.L., Leskovec, J.: Graph convolutional neural networks for web-scale recommender systems. In: KDD 2018, pp. 974\u2013983. ACM (2018)","DOI":"10.1145\/3219819.3219890"},{"issue":"8","key":"52_CR34","first-page":"3727","volume":"34","author":"J Yu","year":"2022","unstructured":"Yu, J., Yin, H., Li, J., Gao, M., Huang, Z., Cui, L.: Enhancing social recommendation with adversarial graph convolutional networks. TKDE 34(8), 3727\u20133739 (2022)","journal-title":"TKDE"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46661-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:08:55Z","timestamp":1699103335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46661-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466601","9783031466618"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46661-8_52","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":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"503","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":"216","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":"43% - 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":"2.97","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":"3.77","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)"}}]}}