{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T11:14:58Z","timestamp":1771586098981,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2134107"],"award-info":[{"award-number":["DMS-2134107"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recommender systems, users rate items, and are subsequently served other product recommendations based on these ratings. Even though users usually rate a tiny percentage of the available items, the system tries to estimate unobserved preferences by finding similarities across users and across items. In this work, we treat the observed ratings data as partially observed, dense, weighted, bipartite networks. For a class of systems without outside information, we adapt an approach developed for dense, weighted networks to account for unobserved edges and the bipartite nature of the problem. The approach begins with clustering both users and items into communities, and locally estimates the patterns of ratings within each subnetwork induced by restricting attention to one community of users and one community of items community. The local fitting procedure relies on estimating local sociability parameters for every user and item, and selecting the function that determines the degree correction contours which best models the underlying data. We compare the performance of our proposed approach to existing methods on a simulated data set, as well as on a data set of joke ratings, examining model performance in both cases at differing levels of sparsity. On the joke ratings data set, our proposed model performs better than existing alternatives in relatively sparse settings, though other approaches achieve better results when more data is available. Collectively, the results indicate that despite struggling to pick up subtler signals, the proposed approach\u2019s recovery of large scale, coarse patterns may still be useful in practical settings where high sparsity is typical.<\/jats:p>","DOI":"10.1007\/s41109-024-00630-6","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T12:15:29Z","timestamp":1717503329000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Augmented degree correction for bipartite networks with applications to recommender systems"],"prefix":"10.1007","volume":"9","author":[{"given":"Benjamin","family":"Leinwand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladas","family":"Pipiras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,4]]},"reference":[{"key":"630_CR1","doi-asserted-by":"crossref","unstructured":"Bennett J, Lanning S (2007) Others the Netflix prize. In: Proceedings Of KDD Cup And Workshop. vol 2007, p 35","DOI":"10.1145\/1345448.1345459"},{"key":"630_CR2","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s E, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9:717\u2013772","journal-title":"Found Comput Math"},{"key":"630_CR3","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s E, Tao T (2010) The power of convex relaxation: near-optimal matrix completion. IEEE Trans Inf Theory 56:2053\u20132080","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"630_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-021-01629-6","volume":"64","author":"Z Chen","year":"2022","unstructured":"Chen Z, Wang S (2022) A review on matrix completion for recommender systems. Knowl Inf Syst 64(1):1\u201334","journal-title":"Knowl Inf Syst"},{"key":"630_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K Goldberg","year":"2001","unstructured":"Goldberg K, Roeder T, Gupta D, Perkins C (2001) Eigentaste: a constant time collaborative filtering algorithm. Inf Retr 4:133\u2013151","journal-title":"Inf Retr"},{"key":"630_CR6","unstructured":"Hahsler M (2022) recommenderlab: an R framework for developing and testing recommendation algorithms. arXiv:2205.12371 [cs.IR]"},{"key":"630_CR7","unstructured":"Hahsler M (2023) recommenderlab: lab for developing and testing recommender algorithms. R package version 1.0.3. https:\/\/CRAN.R-project.org\/package=recommenderlab"},{"key":"630_CR8","first-page":"52","volume":"40","author":"W Hamilton","year":"2017","unstructured":"Hamilton W, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. IEEE Data Eng Bull 40:52\u201374","journal-title":"IEEE Data Eng Bull"},{"key":"630_CR9","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30"},{"key":"630_CR16","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua TS (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on world wide web, pp 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"630_CR10","unstructured":"Jester Dataset (2001). https:\/\/eigentaste.berkeley.edu\/dataset\/"},{"key":"630_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/nws.2022.23","volume":"10","author":"B Leinwand","year":"2022","unstructured":"Leinwand B, Pipiras V (2022) Block dense weighted networks with augmented degree correction. Netw Sci 10:301\u2013321","journal-title":"Netw Sci"},{"key":"630_CR12","doi-asserted-by":"publisher","first-page":"94215","DOI":"10.1109\/ACCESS.2019.2928130","volume":"7","author":"L Nguyen","year":"2019","unstructured":"Nguyen L, Kim J, Shim B (2019) Low-rank matrix completion: a contemporary survey. IEEE Access 7:94215\u201394237","journal-title":"IEEE Access"},{"key":"630_CR13","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf T, Bloem P, Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: European semantic web conference, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"630_CR14","first-page":"1","volume":"24","author":"A Tsitsulin","year":"2023","unstructured":"Tsitsulin A, Palowitch J, Perozzi B, M\u00fcller E (2023) Graph clustering with graph neural networks. J Mach Learn Res 24:1\u201321","journal-title":"J Mach Learn Res"},{"key":"630_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M (2020) Graph neural networks: a review of methods and applications. AI Open 1:57\u201381","journal-title":"AI Open"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00630-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-024-00630-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00630-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T12:41:27Z","timestamp":1717504887000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-024-00630-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,4]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s41109-024-00630-6","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,4]]},"assertion":[{"value":"11 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"19"}}