{"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/explainable-reasoning-over-knowledge-graphs","title":"Explainable Reasoning over Knowledge Graphs for Recommendation","arxiv_id":"1811.04540","date":"2018-11-12","proceeding":null,"authors":["Xiang Wang","Dingxian Wang","Canran Xu","Xiangnan He","Yixin Cao","Tat-Seng Chua"],"abstract":"Incorporating knowledge graph into recommender systems has attracted\nincreasing attention in recent years. By exploring the interlinks within a\nknowledge graph, the connectivity between users and items can be discovered as\npaths, which provide rich and complementary information to user-item\ninteractions. Such connectivity not only reveals the semantics of entities and\nrelations, but also helps to comprehend a user's interest. However, existing\nefforts have not fully explored this connectivity to infer user preferences,\nespecially in terms of modeling the sequential dependencies within and holistic\nsemantics of a path. In this paper, we contribute a new model named\nKnowledge-aware Path Recurrent Network (KPRN) to exploit knowledge graph for\nrecommendation. KPRN can generate path representations by composing the\nsemantics of both entities and relations. By leveraging the sequential\ndependencies within a path, we allow effective reasoning on paths to infer the\nunderlying rationale of a user-item interaction. Furthermore, we design a new\nweighted pooling operation to discriminate the strengths of different paths in\nconnecting a user with an item, endowing our model with a certain level of\nexplainability. We conduct extensive experiments on two datasets about movie\nand music, demonstrating significant improvements over state-of-the-art\nsolutions Collaborative Knowledge Base Embedding and Neural Factorization\nMachine.","url_abs":"http://arxiv.org/abs/1811.04540v1","url_pdf":"http://arxiv.org/pdf/1811.04540v1.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":"explainable-reasoning-over-knowledge-graphs","repo_url":"https://github.com/eBay/KPRN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"explainable-reasoning-over-knowledge-graphs","repo_url":"https://github.com/terwilligers/knowledge-graph-recommender","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"eBay/KPRN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"terwilligers/knowledge-graph-recommender","kind":"listed","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":"68d3c771a9383f6a4cd22136f8e7a306f3a24cd81f7117fc5d7b6ce647278a8f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}