{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","arxiv_id":"1902.06236","date":"2019-02-17","proceeding":null,"authors":["Yixin Cao","Xiang Wang","Xiangnan He","Zikun Hu","Tat-Seng Chua"],"abstract":"Incorporating knowledge graph (KG) into recommender system is promising in\nimproving the recommendation accuracy and explainability. However, existing\nmethods largely assume that a KG is complete and simply transfer the\n\"knowledge\" in KG at the shallow level of entity raw data or embeddings. This\nmay lead to suboptimal performance, since a practical KG can hardly be\ncomplete, and it is common that a KG has missing facts, relations, and\nentities. Thus, we argue that it is crucial to consider the incomplete nature\nof KG when incorporating it into recommender system.\n  In this paper, we jointly learn the model of recommendation and knowledge\ngraph completion. Distinct from previous KG-based recommendation methods, we\ntransfer the relation information in KG, so as to understand the reasons that a\nuser likes an item. As an example, if a user has watched several movies\ndirected by (relation) the same person (entity), we can infer that the director\nrelation plays a critical role when the user makes the decision, thus help to\nunderstand the user's preference at a finer granularity.\n  Technically, we contribute a new translation-based recommendation model,\nwhich specially accounts for various preferences in translating a user to an\nitem, and then jointly train it with a KG completion model by combining several\ntransfer schemes. Extensive experiments on two benchmark datasets show that our\nmethod outperforms state-of-the-art KG-based recommendation methods. Further\nanalysis verifies the positive effect of joint training on both tasks of\nrecommendation and KG completion, and the advantage of our model in\nunderstanding user preference. We publish our project at\nhttps://github.com/TaoMiner/joint-kg-recommender.","url_abs":"http://arxiv.org/abs/1902.06236v1","url_pdf":"http://arxiv.org/pdf/1902.06236v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"unifying-knowledge-graph-learning-and","repo_url":"https://github.com/TaoMiner/joint-kg-recommender","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":null,"task_name":"Relation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/knowledge-graph-completion-on-dbbook2014","task":"Knowledge Graph Completion","dataset":"DBbook2014","model":"KTUP (soft)","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"60.75","Mean Rank":"499"},"uses_additional_data":false},{"leaderboard":"/sota/knowledge-graph-completion-on-movielens-1m","task":"Knowledge Graph Completion","dataset":"MovieLens 1M","model":"KTUP (soft)","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"48.9","Mean Rank":"527"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-dbbook2014","task":"Recommendation Systems","dataset":"DBbook2014","model":"KTUP (soft)","rank_in_archive_order":1,"of":2,"metrics":{"HR@10":"0.3461","NDCG":"0.2762"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"KTUP (soft)","rank_in_archive_order":25,"of":31,"metrics":{"HR@10":"0.8903","NDCG":"0.6992"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.06236","atlas_url":"https://app.syntology.ai/?focus=1902.06236","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1902.06236"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.06236\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.06236"},"call":"get_concepts_for_paper(arxiv_id=\"1902.06236\")"}],"by_repo":[{"repo":"TaoMiner/joint-kg-recommender","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7c1c39346ca6119fd77bc996303fdce029dea07fe4817f947fb55f5d1d9b5ded","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}