Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/81233
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, H-
dc.creatorZhang, F-
dc.creatorZhao, M-
dc.creatorLi, W-
dc.creatorXie, X-
dc.creatorGuo, M-
dc.date.accessioned2019-08-23T08:29:51Z-
dc.date.available2019-08-23T08:29:51Z-
dc.identifier.isbn9781450366748-
dc.identifier.urihttp://hdl.handle.net/10397/81233-
dc.description2019 World Wide Web Conference, WWW 2019, United States, 13-17 May 2019en_US
dc.language.isoenen_US
dc.publisherAssociation for Computing Machinery, Incen_US
dc.rights© 2019 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC-BY 4.0 License.en_US
dc.rightsThe 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.3313411en_US
dc.subjectKnowledge graphen_US
dc.subjectMulti-task learningen_US
dc.subjectRecommender systemsen_US
dc.titleMulti-task feature learning for knowledge graph enhanced recommendationen_US
dc.typeConference Paperen_US
dc.identifier.spage2000-
dc.identifier.epage2010-
dc.identifier.doi10.1145/3308558.3313411-
dcterms.abstractCollaborative 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.accessRightsopen accessen_US
dcterms.bibliographicCitationThe Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019, 2019, p. 2000-2010-
dcterms.issued2019-
dc.identifier.scopus2-s2.0-85066912995-
dc.relation.conferenceWorld Wide Web Conference-
dc.description.validate201908 bcma-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Wang_Multi-Task_Feature_Learning.pdf1.04 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

469
Last Week
7
Last month
Citations as of Apr 14, 2024

Downloads

1,597
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

378
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

277
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


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