{"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/adaptive-user-modeling-with-long-and-short","title":"Adaptive User Modeling with Long and Short-Term Preferences for Personalized Recommendation","arxiv_id":null,"date":"2019-01-01","proceeding":"IJCAI 2019 1","authors":["Zeping Yu","Jianxun Lian","Ahmad Mahmoody","Gongshen Liu","Xing Xie"],"abstract":"User modeling is an essential task for online rec- ommender systems. In the past few decades, col- laborative filtering (CF) techniques have been well studied to model users’ long term preferences. Recently, recurrent neural networks (RNN) have shown a great advantage in modeling users’ short term preference. A natural way to improve the rec- ommender is to combine both long-term and short- term modeling. Previous approaches neglect the importance of dynamically integrating these two user modeling paradigms. Moreover, users’ be- haviors are much more complex than sentences in language modeling or images in visual computing, thus the classical structures of RNN such as Long Short-Term Memory (LSTM) need to be upgraded for better user modeling. In this paper, we im- prove the traditional RNN structure by proposing a time-aware controller and a content-aware con- troller, so that contextual information can be well considered to control the state transition. We fur- ther propose an attention-based framework to com- bine users’ long-term and short-term preferences, thus users’ representation can be generated adap- tively according to the specific context. We con- duct extensive experiments on both public and in- dustrial datasets. The results demonstrate that our proposed method outperforms several state-of-art methods consistently.","url_abs":"https://www.ijcai.org/proceedings/2019/0585.pdf","url_pdf":"https://www.ijcai.org/proceedings/2019/0585.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":"adaptive-user-modeling-with-long-and-short","repo_url":"https://github.com/microsoft/recommenders","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"adaptive-user-modeling-with-long-and-short","repo_url":"https://github.com/zepingyu0512/sli_rec","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"sequential-recommendation","task_name":"Sequential Recommendation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/recommendation-systems-on-amazon-product-data","task":"Recommendation Systems","dataset":"Amazon Product Data","model":"SLi-Rec","rank_in_archive_order":2,"of":2,"metrics":{"AUC":"0.8494","F1":"0.7745"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"microsoft/recommenders","kind":"official","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":"zepingyu0512/sli_rec","kind":"named_in_paper","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":"65fe1d938d12d41cea647402276b5259347476da7afec4383d1ca4b50bf8a392","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}