{"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/180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","arxiv_id":"1805.03352","date":"2018-05-09","proceeding":null,"authors":["Qingyao Ai","Vahid Azizi","Xu Chen","Yongfeng Zhang"],"abstract":"Providing model-generated explanations in recommender systems is important to\nuser experience. State-of-the-art recommendation algorithms - especially\ncollaborative filtering (CF)-based approaches with shallow or deep models -\nusually work with various unstructured information sources for recommendation,\nsuch as textual reviews, visual images, and various implicit or explicit\nfeedbacks. Though structured knowledge bases were considered in content-based\napproaches, they have been largely ignored recently due to the research focus\non CF approaches. However, structured knowledge exhibit unique advantages in\npersonalized recommendation systems. When the explicit knowledge about users\nand items is considered for recommendation, the system could provide highly\ncustomized recommendations based on users' historical behaviors and the\nknowledge is helpful for providing informed explanations regarding the\nrecommended items. A great challenge for using knowledge bases for\nrecommendation is how to integrate large-scale structured data, while taking\nadvantage of collaborative filtering for highly accurate performance. Recent\nachievements in knowledge-base embedding (KBE) sheds light on this problem,\nwhich makes it possible to learn user and item representations while preserving\nthe structure of their relationship with external knowledge for explanation. In\nthis work, we propose to explain knowledge-base embeddings for explainable\nrecommendation. Specifically, we propose a knowledge-base representation\nlearning framework to embed heterogeneous entities for recommendation, and\nbased on the embedded knowledge base, a soft matching algorithm is proposed to\ngenerate personalized explanations for the recommended items. Experimental\nresults on real-world e-commerce datasets verified the superior recommendation\nperformance and the explainability power of our approach compared with\nstate-of-the-art baselines.","url_abs":"http://arxiv.org/abs/1805.03352v2","url_pdf":"http://arxiv.org/pdf/1805.03352v2.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":"180503352","repo_url":"https://github.com/LunaBlack/KGAT-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"180503352","repo_url":"https://github.com/fumiyo0607/KGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"180503352","repo_url":"https://github.com/giantonia/KGATv2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"180503352","repo_url":"https://github.com/melissakou/KG-RecSys","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"180503352","repo_url":"https://github.com/xiangwang1223/knowledge_graph_attention_network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"explainable-recommendation","task_name":"Explainable Recommendation"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-movielens-25m","task":"Link Prediction","dataset":"MovieLens 25M","model":"CFKG","rank_in_archive_order":4,"of":7,"metrics":{"Hits@10":"0.8152","nDCG@10":"0.5196"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-yelp","task":"Link Prediction","dataset":"Yelp","model":"CFKG","rank_in_archive_order":3,"of":9,"metrics":{"HR@10":"0.8729","nDCG@10":"0.5826"},"uses_additional_data":false}],"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":"LunaBlack/KGAT-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.07854"],"harvested_for_calls":[{"arxiv_id":"1905.07854","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.07854"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.07854\")"}]},{"repo":"fumiyo0607/KGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"giantonia/KGATv2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"melissakou/KG-RecSys","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xiangwang1223/knowledge_graph_attention_network","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.07854"],"harvested_for_calls":[{"arxiv_id":"1905.07854","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.07854"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.07854\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"3912a9f16feca6827d252553a8a683c7ea1df38f745d99156e1cec47670206a4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}