{"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/dkn-deep-knowledge-aware-network-for-news","title":"DKN: Deep Knowledge-Aware Network for News Recommendation","arxiv_id":"1801.08284","date":"2018-01-25","proceeding":null,"authors":["Hongwei Wang","Fuzheng Zhang","Xing Xie","Minyi Guo"],"abstract":"Online news recommender systems aim to address the information explosion of\nnews and make personalized recommendation for users. In general, news language\nis highly condensed, full of knowledge entities and common sense. However,\nexisting methods are unaware of such external knowledge and cannot fully\ndiscover latent knowledge-level connections among news. The recommended results\nfor a user are consequently limited to simple patterns and cannot be extended\nreasonably. Moreover, news recommendation also faces the challenges of high\ntime-sensitivity of news and dynamic diversity of users' interests. To solve\nthe above problems, in this paper, we propose a deep knowledge-aware network\n(DKN) that incorporates knowledge graph representation into news\nrecommendation. DKN is a content-based deep recommendation framework for\nclick-through rate prediction. The key component of DKN is a multi-channel and\nword-entity-aligned knowledge-aware convolutional neural network (KCNN) that\nfuses semantic-level and knowledge-level representations of news. KCNN treats\nwords and entities as multiple channels, and explicitly keeps their alignment\nrelationship during convolution. In addition, to address users' diverse\ninterests, we also design an attention module in DKN to dynamically aggregate a\nuser's history with respect to current candidate news. Through extensive\nexperiments on a real online news platform, we demonstrate that DKN achieves\nsubstantial gains over state-of-the-art deep recommendation models. We also\nvalidate the efficacy of the usage of knowledge in DKN.","url_abs":"http://arxiv.org/abs/1801.08284v2","url_pdf":"http://arxiv.org/pdf/1801.08284v2.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":"dkn-deep-knowledge-aware-network-for-news","repo_url":"https://github.com/810410738/DKN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"dkn-deep-knowledge-aware-network-for-news","repo_url":"https://github.com/hwwang55/DKN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"dkn-deep-knowledge-aware-network-for-news","repo_url":"https://github.com/microsoft/recommenders","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"dkn-deep-knowledge-aware-network-for-news","repo_url":"https://github.com/yusanshi/NewsRecommendation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"},{"task_slug":"common-sense-reasoning","task_name":"Common Sense Reasoning"},{"task_slug":"news-recommendation","task_name":"News Recommendation"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-bing-news","task":"Click-Through Rate Prediction","dataset":"Bing News","model":"DKN","rank_in_archive_order":6,"of":7,"metrics":{"AUC":"0.659"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.08284","atlas_url":"https://app.syntology.ai/?focus=1801.08284","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":"1801.08284"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.08284\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.08284"},"call":"get_concepts_for_paper(arxiv_id=\"1801.08284\")"}],"by_repo":[{"repo":"810410738/DKN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hwwang55/DKN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"microsoft/recommenders","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1312.6114"],"harvested_for_calls":[{"arxiv_id":"1312.6114","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1312.6114"},"call":"get_harvested_code_for_paper(arxiv_id=\"1312.6114\")"}]},{"repo":"yusanshi/NewsRecommendation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"c93160c426d6b5f64413e34b87a297d715fec650cd0e9cf5c8edf72178b617b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}