Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/81233
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Wang, H | - |
dc.creator | Zhang, F | - |
dc.creator | Zhao, M | - |
dc.creator | Li, W | - |
dc.creator | Xie, X | - |
dc.creator | Guo, M | - |
dc.date.accessioned | 2019-08-23T08:29:51Z | - |
dc.date.available | 2019-08-23T08:29:51Z | - |
dc.identifier.isbn | 9781450366748 | - |
dc.identifier.uri | http://hdl.handle.net/10397/81233 | - |
dc.description | 2019 World Wide Web Conference, WWW 2019, United States, 13-17 May 2019 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Association for Computing Machinery, Inc | en_US |
dc.rights | © 2019 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC-BY 4.0 License. | en_US |
dc.rights | The following publication Wang, H., Zhang, F., Zhao, M., Li, W., Xie, X., & Guo, M. (2019, May). Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation. In The World Wide Web Conference (pp. 2000-2010). ACM, is available at https://doi.org/10.1145/3308558.3313411 | en_US |
dc.subject | Knowledge graph | en_US |
dc.subject | Multi-task learning | en_US |
dc.subject | Recommender systems | en_US |
dc.title | Multi-task feature learning for knowledge graph enhanced recommendation | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.spage | 2000 | - |
dc.identifier.epage | 2010 | - |
dc.identifier.doi | 10.1145/3308558.3313411 | - |
dcterms.abstract | Collaborative filtering often suffers from sparsity and cold start problems in real recommendation scenarios, therefore, researchers and engineers usually use side information to address the issues and improve the performance of recommender systems. In this paper, we consider knowledge graphs as the source of side information. We propose MKR, a Multi-task feature learning approach for Knowledge graph enhanced Recommendation. MKR is a deep end-to-end framework that utilizes knowledge graph embedding task to assist recommendation task. The two tasks are associated by cross&compress units, which automatically share latent features and learn high-order interactions between items in recommender systems and entities in the knowledge graph. We prove that cross&compress units have sufficient capability of polynomial approximation, and show that MKR is a generalized framework over several representative methods of recommender systems and multi-task learning. Through extensive experiments on real-world datasets, we demonstrate that MKR achieves substantial gains in movie, book, music, and news recommendation, over state-of-the-art baselines. MKR is also shown to be able to maintain satisfactory performance even if user-item interactions are sparse. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019, 2019, p. 2000-2010 | - |
dcterms.issued | 2019 | - |
dc.identifier.scopus | 2-s2.0-85066912995 | - |
dc.relation.conference | World Wide Web Conference | - |
dc.description.validate | 201908 bcma | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | CC | en_US |
Appears in Collections: | Conference Paper |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Wang_Multi-Task_Feature_Learning.pdf | 1.04 MB | Adobe PDF | View/Open |
Page views
539
Last Week
7
7
Last month
Citations as of May 11, 2025
Downloads
1,925
Citations as of May 11, 2025
SCOPUSTM
Citations
473
Citations as of May 8, 2025
WEB OF SCIENCETM
Citations
355
Citations as of May 8, 2025

Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.