{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:35:42Z","timestamp":1768257342614,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031001284","type":"print"},{"value":"9783031001291","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00129-1_30","type":"book-chapter","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T14:23:55Z","timestamp":1650637435000},"page":"351-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Joint Framework for Explainable Recommendation with Knowledge Reasoning and Graph Representation"],"prefix":"10.1007","author":[{"given":"Luhao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ruiyu","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Tianchi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Maodi","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"30_CR1","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NIPS, pp. 1\u20139 (2013)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Cao, Y., Wang, X., He, X., Hu, Z., Chua, T.S.: Unifying knowledge graph learning and recommendation: towards a better understanding of user preferences. In: WWW, pp. 151\u2013161 (2019)","DOI":"10.1145\/3308558.3313705"},{"key":"30_CR3","unstructured":"Chen, J., Ma, T., Xiao, C.: Fastgcn: fast learning with graph convolutional networks via importance sampling. In: ICLR (2018)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: a scalable tree boosting system. In: KDD (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Fan, S., et al.: Metapath-guided heterogeneous graph neural network for intent recommendation. In: KDD (2019)","DOI":"10.1145\/3292500.3330673"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Hu, B., Shi, C., Zhao, W.X., Yu, P.S.: Leveraging meta-path based context for top-n recommendation with a neural co-attention model. In: KDD (2018)","DOI":"10.1145\/3219819.3219965"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Huang, P.S., He, X., Gao, J., Deng, L., Acero, A., Heck, L.: Learning deep structured semantic models for web search using clickthrough data. In: KDD (2013)","DOI":"10.1145\/2505515.2505665"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Ma, W., et al.: Jointly learning explainable rules for recommendation with knowledge graph. In: WWW, pp. 1210\u20131221 (2019)","DOI":"10.1145\/3308558.3313607"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Schlichtkrull, M.S., Kipf, T.N., Bloem, P., van den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: ESWC (2018)","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"30_CR10","unstructured":"Song, W., Duan, Z., Yang, Z., Zhu, H., Zhang, M., Tang, J.: Explainable knowledge graph-based recommendation via deep reinforcement learning. arXiv (2019)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Wan, G., Du, B., Pan, S., Haffari, G.: Reinforcement learning based meta-path discovery in large-scale heterogeneous information networks. In: AAAI (2020)","DOI":"10.1609\/aaai.v34i04.6073"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Wan, G., Pan, S., Gong, C., Zhou, C., Haffari, G.: Reasoning like human: hierarchical reinforcement learning for knowledge graph reasoning. In: IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/267"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: Ripplenet: propagating user preferences on the knowledge graph for recommender systems. In: CIKM, pp. 417\u2013426 (2018)","DOI":"10.1145\/3269206.3271739"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, F., Xie, X., Guo, M.: DKN: deep knowledge-aware network for news recommendation. In: WWW, pp. 1835\u20131844 (2018)","DOI":"10.1145\/3178876.3186175"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Cao, Y., Liu, M., Chua, T.: KGAT: knowledge graph attention network for recommendation. In: KDD, pp. 950\u2013958 (2019)","DOI":"10.1145\/3292500.3330989"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, D., Xu, C., He, X., Cao, Y., Chua, T.S.: Explainable reasoning over knowledge graphs for recommendation. In: AAAI, pp. 5329\u20135336 (2019)","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: Heterogeneous graph attention network. In: WWW, pp. 2022\u20132032 (2019)","DOI":"10.1145\/3308558.3313562"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Xian, Y., Fu, Z., Muthukrishnan, S., de Melo, G., Zhang, Y.: Reinforcement knowledge graph reasoning for explainable recommendation. In: SIGIR (2019)","DOI":"10.1145\/3331184.3331203"},{"key":"30_CR19","unstructured":"Yang, B., Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: ICLR (2015)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Yang, Y., et al.: Query-aware tip generation for vertical search. In: CIKM (2020)","DOI":"10.1145\/3340531.3412740"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Zhao, K., et al.: Leveraging demonstrations for reinforcement recommendation reasoning over knowledge graphs. In: SIGIR, pp. 239\u2013248 (2020)","DOI":"10.1145\/3397271.3401171"}],"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-00129-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T22:00:49Z","timestamp":1657576849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00129-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001284","9783031001291"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00129-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","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":"72","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":"76","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":"13% - 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":"6","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":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","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)"}}]}}