{"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/mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","arxiv_id":"2204.02338","date":"2022-04-05","proceeding":null,"authors":["Jun Hu","Bryan Hooi","Shengsheng Qian","Quan Fang","Changsheng Xu"],"abstract":"Graph Neural Networks (GNNs) have recently been utilized to build Collaborative Filtering (CF) models to predict user preferences based on historical user-item interactions. However, there is relatively little understanding of how GNN-based CF models relate to some traditional Network Representation Learning (NRL) approaches. In this paper, we show the equivalence between some state-of-the-art GNN-based CF models and a traditional 1-layer NRL model based on context encoding. Based on a Markov process that trades off two types of distances, we present Markov Graph Diffusion Collaborative Filtering (MGDCF) to generalize some state-of-the-art GNN-based CF models. Instead of considering the GNN as a trainable black box that propagates learnable user/item vertex embeddings, we treat GNNs as an untrainable Markov process that can construct constant context features of vertices for a traditional NRL model that encodes context features with a fully-connected layer. Such simplification can help us to better understand how GNNs benefit CF models. Especially, it helps us realize that ranking losses play crucial roles in GNN-based CF tasks. With our proposed simple yet powerful ranking loss InfoBPR, the NRL model can still perform well without the context features constructed by GNNs. We conduct experiments to perform detailed analysis on MGDCF.","url_abs":"https://arxiv.org/abs/2204.02338v2","url_pdf":"https://arxiv.org/pdf/2204.02338v2.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":"mgdcf-distance-learning-via-markov-graph","repo_url":"https://github.com/hujunxianligong/MGDCF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"mgdcf-distance-learning-via-markov-graph","repo_url":"https://github.com/CrawlScript/Torch-MGDCF","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"multi-modal-recommendation","task_name":"Multi-modal Recommendation"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"appnp","method_name":"APPNP"},{"method_slug":"diffusion","method_name":"Diffusion"},{"method_slug":"lightgcn","method_name":"LightGCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/multi-modal-recommendation-on-amazon-baby","task":"Multi-modal Recommendation","dataset":"Amazon Baby","model":"MGDN","rank_in_archive_order":7,"of":10,"metrics":{"NDCG@20":"0.0346"},"uses_additional_data":false},{"leaderboard":"/sota/multi-modal-recommendation-on-amazon-clothing","task":"Multi-modal Recommendation","dataset":"Amazon Clothing","model":"MGDN","rank_in_archive_order":7,"of":10,"metrics":{"NDCG@20":"0.0247"},"uses_additional_data":false},{"leaderboard":"/sota/multi-modal-recommendation-on-amazon-sports","task":"Multi-modal Recommendation","dataset":"Amazon Sports","model":"MGDN","rank_in_archive_order":4,"of":10,"metrics":{"NGCG@20":"0.0422"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-amazon-book","task":"Recommendation Systems","dataset":"Amazon-Book","model":"MGDCF","rank_in_archive_order":10,"of":16,"metrics":{"Recall@20":"0.0566","nDCG@20":"0.0460"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-gowalla","task":"Recommendation Systems","dataset":"Gowalla","model":"MGDCF","rank_in_archive_order":5,"of":13,"metrics":{"Recall@20":"0.1864","nDCG@20":"0.1589"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-yelp2018","task":"Recommendation Systems","dataset":"Yelp2018","model":"MGDCF","rank_in_archive_order":6,"of":11,"metrics":{"NDCG@20":"0.0575","Recall@20":"0.0699"},"uses_additional_data":false}],"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":"hujunxianligong/MGDCF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CrawlScript/Torch-MGDCF","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":"30f95db3cc5fb9a87704d25fe5c6406f11324501c0ca107049b0b7c4cad1b74a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}