{"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/improving-rating-prediction-in-multi-criteria","title":"Improving Rating Prediction in Multi-Criteria Recommender Systems via a Collective Factor Model","arxiv_id":null,"date":"2023-05-01","proceeding":"IEEE Transactions on Network Science and Engineering 2023 5","authors":["Ge Fan","Chaoyun Zhang","Junyang Chen","Paul Li","Yingjie Li","Victor C. M. Leung"],"abstract":"Existing recommendation methods usually train several independent modules for each rating information instead of an end-to-end manner. Therefore, these methods may be incapable of collaborative learning leading to sub-optimal results in predicting users' overall interests. The main disadvantage of those two-stage methods is that the overall rating heavily relies on the predicted sub-ratings, and the predictive error of sub-ratings is accumulated during the regression step. Moreover, the regression model is trained with unbiased sub-ratings but used with biased predictive sub-ratings. Meanwhile, the separate training pattern induces more training overhead. To address these problems, we propose a collective model to predict a user's overall rating, which can learn each of the multi-criteria sub-scores simultaneously in an end-to-end manner. This enables the proposed method to improve its prediction quality by transferring the knowledge of criterion to the domain of overall ratings. It reduces the dependence of the predicted score of a specific criterion, making the overall system more robust. In addition, our end-to-end method avoids learning the regress part directly from the unbiased sub-ratings, improving the performance of the overall model. Experiments on three real-world datasets show that our proposed architecture achieves up to 13.14% lower prediction error over baseline approaches.","url_abs":"https://ieeexplore.ieee.org/document/10113232","url_pdf":"http://fange.pro/files/2023CFM.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":"improving-rating-prediction-in-multi-criteria","repo_url":"https://github.com/LucaM1985/CFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"LucaM1985/CFM","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":"b9c013523d7d6ffd587c154d8d734549614666adf95a1dc2768117cafb9f0833","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}