{"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/lecf-recommendation-via-learnable-edge","title":"LECF: Recommendation via Learnable Edge Collaborative Filtering","arxiv_id":null,"date":"2021-12-23","proceeding":"Science China Information Sciences 2021 12","authors":["Shitao Xiao","Yingxia Shao","Yawen Li","Hongzhi Yin","Yanyan Shen & Bin Cui"],"abstract":"The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering (CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering (LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges (i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.","url_abs":"https://link.springer.com/article/10.1007/s11432-020-3274-6","url_pdf":"https://link.springer.com/article/10.1007/s11432-020-3274-6","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":"lecf-recommendation-via-learnable-edge","repo_url":"https://github.com/MindCode-4/code-10/tree/main/LECF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"lecf-recommendation-via-learnable-edge","repo_url":"https://github.com/MindCode-4/code-14/tree/main/LECF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"lecf-recommendation-via-learnable-edge","repo_url":"https://github.com/pwc-1/Paper-9/tree/main/6/LECF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"lecf-recommendation-via-learnable-edge","repo_url":"https://github.com/yangyucheng000/LECF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"MindCode-4/code-10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2104.10442"],"harvested_for_calls":[{"arxiv_id":"2104.10442","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.10442"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.10442\")"}]},{"repo":"MindCode-4/code-14","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2311.18815"],"harvested_for_calls":[{"arxiv_id":"2311.18815","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2311.18815"},"call":"get_harvested_code_for_paper(arxiv_id=\"2311.18815\")"}]},{"repo":"pwc-1/Paper-9","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.13719"],"harvested_for_calls":[{"arxiv_id":"1909.13719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.13719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.13719\")"}]},{"repo":"yangyucheng000/LECF","kind":"listed","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":"110fd03bc960593d2c0917f985982bfdc8dacca3615a5c1ff94b571ac2a2b87e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}