{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:39:13Z","timestamp":1768912753666,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030474256","type":"print"},{"value":"9783030474263","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-47426-3_9","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T02:02:49Z","timestamp":1588903369000},"page":"104-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Relational Metric Learning with Dual Graph Attention Networks for Social Recommendation"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nana","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentao","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhang, M., Liu, Y., Ma, S.: Social attentional memory network: modeling aspect-and friend-level differences in recommendation. In: WSDM, pp. 177\u2013185 (2019)","DOI":"10.1145\/3289600.3290982"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, Q., et al.: Deep modeling of social relations for recommendation. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.12132"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-31454-4_10","volume-title":"User Modeling, Adaptation, and Personalization","author":"G Guo","year":"2012","unstructured":"Guo, G., Zhang, J., Thalmann, D.: A simple but effective method to incorporate trusted neighbors in recommender systems. In: Masthoff, J., Mobasher, B., Desmarais, M.C., Nkambou, R. (eds.) UMAP 2012. LNCS, vol. 7379, pp. 114\u2013125. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31454-4_10"},{"key":"9_CR4","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)","DOI":"10.1609\/aaai.v29i1.9153"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"He, X., Liao, L., et al.: Neural collaborative filtering. In: WWW, pp. 173\u2013182 (2017)","DOI":"10.1145\/3038912.3052569"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"He, X., Zhang, H., Kan, M.Y., Chua, T.S.: Fast matrix factorization for online recommendation with implicit feedback. In: SIGIR, pp. 549\u2013558 (2016)","DOI":"10.1145\/2911451.2911489"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Hsieh, C.K., Yang, L., et al.: Collaborative metric learning. In: WWW, pp. 193\u2013201 (2017)","DOI":"10.1145\/3038912.3052639"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: RecSys, pp. 135\u2013142 (2010)","DOI":"10.1145\/1864708.1864736"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kabbur, S., Ning, X., Karypis, G.: FISM: factored item similarity models for top-N recommender systems. In: KDD, pp. 659\u2013667 (2013)","DOI":"10.1145\/2487575.2487589"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: KDD, pp. 426\u2013434 (2008)","DOI":"10.1145\/1401890.1401944"},{"issue":"8","key":"9_CR11","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., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Ma, H., et al.: Learning to recommend with social trust ensemble. In: SIGIR, pp. 203\u2013210 (2009)","DOI":"10.1145\/1571941.1571978"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Park, C., et al.: Collaborative translational metric learning. In: ICDM, pp. 367\u2013376. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00052"},{"key":"9_CR14","unstructured":"Rendle, S., Freudenthaler, C., et al.: BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Tay, Y., Anh Tuan, L., et al.: Latent relational metric learning via memory-based attention for collaborative ranking. In: WWW, pp. 729\u2013739 (2018)","DOI":"10.1145\/3178876.3186154"},{"key":"9_CR16","unstructured":"Veli\u010dkovi\u0107, P., et al.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., et al.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: SIGIR, pp. 501\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., et al.: Item silk road: recommending items from information domains to social users. In: SIGIR, pp. 185\u2013194 (2017)","DOI":"10.1145\/3077136.3080771"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1504\/IJSNM.2015.069773","volume":"2","author":"G Xu","year":"2015","unstructured":"Xu, G., et al.: Social networking meets recommender systems: survey. IJSNM 2(1), 64\u2013100 (2015)","journal-title":"IJSNM"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Yu, J., Gao, M., et al.: Adaptive implicit friends identification over heterogeneous network for social recommendation. In: CIKM, pp. 357\u2013366 (2018)","DOI":"10.1145\/3269206.3271725"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, C., Lu, Y., et al.: Collaborative User Network Embedding for Social Recommender Systems (2017)","DOI":"10.1137\/1.9781611974973.43"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, T., McAuley, J., et al.: Leveraging social connections to improve personalized ranking for collaborative filtering. In: CIKM, pp. 261\u2013270 (2014)","DOI":"10.1145\/2661829.2661998"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47426-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T04:34:25Z","timestamp":1666499665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47426-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474256","9783030474263"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47426-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.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":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","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":"135","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":"21% - 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-4","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":"6-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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}