{"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/dual-graph-attention-networks-for-deep-latent","title":"Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems","arxiv_id":"1903.10433","date":"2019-03-25","proceeding":null,"authors":["Qitian Wu","Hengrui Zhang","Xiaofeng Gao","Peng He","Paul Weng","Han Gao","Guihai Chen"],"abstract":"Social recommendation leverages social information to solve data sparsity and\ncold-start problems in traditional collaborative filtering methods. However,\nmost existing models assume that social effects from friend users are static\nand under the forms of constant weights or fixed constraints. To relax this\nstrong assumption, in this paper, we propose dual graph attention networks to\ncollaboratively learn representations for two-fold social effects, where one is\nmodeled by a user-specific attention weight and the other is modeled by a\ndynamic and context-aware attention weight. We also extend the social effects\nin user domain to item domain, so that information from related items can be\nleveraged to further alleviate the data sparsity problem. Furthermore,\nconsidering that different social effects in two domains could interact with\neach other and jointly influence user preferences for items, we propose a new\npolicy-based fusion strategy based on contextual multi-armed bandit to weigh\ninteractions of various social effects. Experiments on one benchmark dataset\nand a commercial dataset verify the efficacy of the key components in our\nmodel. The results show that our model achieves great improvement for\nrecommendation accuracy compared with other state-of-the-art social\nrecommendation methods.","url_abs":"http://arxiv.org/abs/1903.10433v1","url_pdf":"http://arxiv.org/pdf/1903.10433v1.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":"dual-graph-attention-networks-for-deep-latent","repo_url":"https://github.com/echo740/DANSER-WWW-19","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/recommendation-systems-on-epinions","task":"Recommendation Systems","dataset":"Epinions","model":"DANSER","rank_in_archive_order":1,"of":4,"metrics":{"MAE":"0.7781","RMSE":"1.0268"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-wechat","task":"Recommendation Systems","dataset":"WeChat","model":"DANSER","rank_in_archive_order":1,"of":2,"metrics":{"AUC":"0.8165","P@10":"0.0823"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.10433","atlas_url":"https://app.syntology.ai/?focus=1903.10433","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":"1903.10433"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.10433\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.10433"},"call":"get_concepts_for_paper(arxiv_id=\"1903.10433\")"}],"by_repo":[{"repo":"echo740/DANSER-WWW-19","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":"34727e9e319ac504c0c43ad14f3c087a377ef77a180507ed440b4cc7f344b439","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}