{"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/top-n-recommendation-on-graphs","title":"Top-N Recommendation on Graphs","arxiv_id":"1609.08264","date":"2016-09-27","proceeding":null,"authors":["Zhao Kang","Chong Peng","Ming Yang","Qiang Cheng"],"abstract":"Recommender systems play an increasingly important role in online\napplications to help users find what they need or prefer. Collaborative\nfiltering algorithms that generate predictions by analyzing the user-item\nrating matrix perform poorly when the matrix is sparse. To alleviate this\nproblem, this paper proposes a simple recommendation algorithm that fully\nexploits the similarity information among users and items and intrinsic\nstructural information of the user-item matrix. The proposed method constructs\na new representation which preserves affinity and structure information in the\nuser-item rating matrix and then performs recommendation task. To capture\nproximity information about users and items, two graphs are constructed.\nManifold learning idea is used to constrain the new representation to be smooth\non these graphs, so as to enforce users and item proximities. Our model is\nformulated as a convex optimization problem, for which we need to solve the\nwell-known Sylvester equation only. We carry out extensive empirical\nevaluations on six benchmark datasets to show the effectiveness of this\napproach.","url_abs":"http://arxiv.org/abs/1609.08264v1","url_pdf":"http://arxiv.org/pdf/1609.08264v1.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":"top-n-recommendation-on-graphs","repo_url":"https://github.com/sckangz/CIKM16","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","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":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sckangz/CIKM16","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":"073d5a9e44c191e5ab90da3b55fcfa160191f4d0396c1efb42613911f6c4151f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}