{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:31:08Z","timestamp":1743136268693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466731"},{"type":"electronic","value":"9783031466748"}],"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-46674-8_30","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"433-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["UKGAT: Uncertain Knowledge Graph Embedding Enriched KGAT for\u00a0Recommendation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4818-8177","authenticated-orcid":false,"given":"Quanyang","family":"Leng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6862-7627","authenticated-orcid":false,"given":"Wanting","family":"Jiang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2124-371X","authenticated-orcid":false,"given":"Nan","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bi, Q., Li, J., Shang, L., Jiang, X., Liu, Q., Yang, H.: MTRec: multi-task learning over BERT for news recommendation. In: Findings of the Association for Computational Linguistics, ACL 2022, pp. 2663\u20132669 (2022)","DOI":"10.18653\/v1\/2022.findings-acl.209"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bordes, A., Chopra, S., Weston, J.: Question answering with subgraph embeddings. arXiv preprint arXiv:1406.3676 (2014)","DOI":"10.3115\/v1\/D14-1067"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/3575637.3575655","volume":"24","author":"N Brockmann","year":"2022","unstructured":"Brockmann, N., Elson Kosasih, E., Brintrup, A.: Supply chain link prediction on uncertain knowledge graph. ACM SIGKDD Explor. Newsl. 24(2), 124\u2013130 (2022)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Chen, M., Shi, W., Sun, Y., Zaniolo, C.: Embedding uncertain knowledge graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 3363\u20133370 (2019)","DOI":"10.1609\/aaai.v33i01.33013363"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z.M., Yeh, M.Y., Kuo, T.W.: PASSLEAF: a pool-based semi-supervised learning framework for uncertain knowledge graph embedding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 4019\u20134026 (2021)","DOI":"10.1609\/aaai.v35i5.16522"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Fan, S., et al.: Metapath-guided heterogeneous graph neural network for intent recommendation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2478\u20132486 (2019)","DOI":"10.1145\/3292500.3330673"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Gong, J., et al.: Attentional graph convolutional networks for knowledge concept recommendation in MOOCs in a heterogeneous view. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 79\u201388 (2020)","DOI":"10.1145\/3397271.3401057"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Li, B., Ye, W., Huang, C., Zhang, S.: Multi-view inference for relation extraction with uncertain knowledge. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 13234\u201313242 (2021)","DOI":"10.1609\/aaai.v35i15.17563"},{"issue":"11","key":"30_CR9","doi-asserted-by":"publisher","first-page":"6712","DOI":"10.1109\/TNNLS.2021.3083259","volume":"33","author":"Q Li","year":"2021","unstructured":"Li, Q., Wang, D., Feng, S., Niu, C., Zhang, Y.: Global graph attention embedding network for relation prediction in knowledge graphs. IEEE Trans. Neural Netw. Learn. Syst. 33(11), 6712\u20136725 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Speer, R., Chin, J., Havasi, C.C.: 5.5: an open multilingual graph of general knowledge. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 4444\u20134451, December 2016","DOI":"10.1609\/aaai.v31i1.11164"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Wang, H., Li, S., Pan, R., Mao, M.: Incorporating graph attention mechanism into knowledge graph reasoning based on deep reinforcement learning. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 2623\u20132631 (2019)","DOI":"10.18653\/v1\/D19-1264"},{"issue":"12","key":"30_CR12","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: a survey of approaches and applications. IEEE Trans. Knowl. Data Eng. 29(12), 2724\u20132743 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Cao, Y., Liu, M., Chua, T.S.: KGAT: knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 950\u2013958 (2019)","DOI":"10.1145\/3292500.3330989"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Wang, M., Feng, F., Chua, T.S.: Neural graph collaborative filtering. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 165\u2013174 (2019)","DOI":"10.1145\/3331184.3331267"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Wu, J., et al.: DisenKGAT: knowledge graph embedding with disentangled graph attention network. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 2140\u20132149 (2021)","DOI":"10.1145\/3459637.3482424"},{"key":"30_CR17","unstructured":"Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.i., Jegelka, S.: Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, pp. 5453\u20135462. PMLR (2018)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, C., Song, D., Huang, C., Swami, A., Chawla, N.V.: Heterogeneous graph neural network. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 793\u2013803 (2019)","DOI":"10.1145\/3292500.3330961"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, J., et al.: IntentGC: a scalable graph convolution framework fusing heterogeneous information for recommendation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2347\u20132357 (2019)","DOI":"10.1145\/3292500.3330686"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, G., et al.: Deep interest network for click-through rate prediction. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1059\u20131068 (2018)","DOI":"10.1145\/3219819.3219823"}],"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-46674-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:18:59Z","timestamp":1699103939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46674-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466731","9783031466748"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46674-8_30","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)"}}]}}