{"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/a-neural-influence-diffusion-model-for-social","title":"A Neural Influence Diffusion Model for Social Recommendation","arxiv_id":"1904.10322","date":"2019-04-20","proceeding":null,"authors":["Le Wu","Peijie Sun","Yanjie Fu","Richang Hong","Xiting Wang","Meng Wang"],"abstract":"Precise user and item embedding learning is the key to building a successful\nrecommender system. Traditionally, Collaborative Filtering(CF) provides a way\nto learn user and item embeddings from the user-item interaction history.\nHowever, the performance is limited due to the sparseness of user behavior\ndata. With the emergence of online social networks, social recommender systems\nhave been proposed to utilize each user's local neighbors' preferences to\nalleviate the data sparsity for better user embedding modeling. We argue that,\nfor each user of a social platform, her potential embedding is influenced by\nher trusted users. As social influence recursively propagates and diffuses in\nthe social network, each user's interests change in the recursive process.\nNevertheless, the current social recommendation models simply developed static\nmodels by leveraging the local neighbors of each user without simulating the\nrecursive diffusion in the global social network, leading to suboptimal\nrecommendation performance. In this paper, we propose a deep influence\npropagation model to stimulate how users are influenced by the recursive social\ndiffusion process for social recommendation. For each user, the diffusion\nprocess starts with an initial embedding that fuses the related features and a\nfree user latent vector that captures the latent behavior preference. The key\nidea of our proposed model is that we design a layer-wise influence propagation\nstructure to model how users' latent embeddings evolve as the social diffusion\nprocess continues. We further show that our proposed model is general and could\nbe applied when the user~(item) attributes or the social network structure is\nnot available. Finally, extensive experimental results on two real-world\ndatasets clearly show the effectiveness of our proposed model, with more than\n13% performance improvements over the best baselines.","url_abs":"http://arxiv.org/abs/1904.10322v1","url_pdf":"http://arxiv.org/pdf/1904.10322v1.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":"a-neural-influence-diffusion-model-for-social","repo_url":"https://github.com/PeiJieSun/diffnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"a-neural-influence-diffusion-model-for-social","repo_url":"https://github.com/Kanika91/diffnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.10322","atlas_url":"https://app.syntology.ai/?focus=1904.10322","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":"1904.10322"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.10322\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.10322"},"call":"get_concepts_for_paper(arxiv_id=\"1904.10322\")"}],"by_repo":[{"repo":"PeiJieSun/diffnet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Kanika91/diffnet","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":"02944aa2233fad27e6c72fd4ef4c84d0be544c6af81ec3a11f0feca856b4ad26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}