{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:14:26Z","timestamp":1766268866034,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Charles University","award":["SVV-260698\/2023"],"award-info":[{"award-number":["SVV-260698\/2023"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,9,14]]},"DOI":"10.1145\/3604915.3608827","type":"proceedings-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T22:40:23Z","timestamp":1694731223000},"page":"763-770","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7763-5575","authenticated-orcid":false,"given":"Martin","family":"Spi\u0161\u00e1k","sequence":"first","affiliation":[{"name":"GLAMI.cz, Czech Republic and Faculty of Mathematics and Physics, Charles University, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5482-0886","authenticated-orcid":false,"given":"Radek","family":"Bartyzal","sequence":"additional","affiliation":[{"name":"GLAMI.cz, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1963-0283","authenticated-orcid":false,"given":"Anton\u00edn","family":"Hoskovec","sequence":"additional","affiliation":[{"name":"GLAMI.cz, Czech Republic and Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8082-4509","authenticated-orcid":false,"given":"Ladislav","family":"Peska","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Physics, Charles University, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2808-6929","authenticated-orcid":false,"given":"Miroslav","family":"T\u016fma","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Physics, Charles University, Czech Republic"}]}],"member":"320","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2017.10.003"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1390696"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of KDD Cup and Workshop","volume":"2007","author":"Bennett James","year":"2006","unstructured":"James Bennett and Stanley Lanning. 2006. The Netflix Prize. Proceedings of KDD Cup and Workshop Vol. 2007 (11 2006)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(01)00235-3"},{"key":"e_1_3_2_1_5_1","first-page":"2","article-title":"A comparative study of sparse approximate inverse preconditioners","volume":"30","author":"Benzi M.","year":"1999","unstructured":"M. Benzi and M. T\u016fma. 1999. A comparative study of sparse approximate inverse preconditioners. ANM 30, 2-3 (1999), 305\u2013340.","journal-title":"ANM"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 12th International Society for Music Information Retrieval Conference, ISMIR 2011","author":"Bertin-Mahieux Thierry","year":"2011","unstructured":"Thierry Bertin-Mahieux, Daniel P.\u00a0W. Ellis, Brian Whitman, and Paul Lamere. 2011. The Million Song Dataset. In Proceedings of the 12th International Society for Music Information Retrieval Conference, ISMIR 2011, Miami, Florida, USA, October 24-28, 2011, Anssi Klapuri and Colby Leider (Eds.). University of Miami, Miami, FL, USA, 591\u2013596. http:\/\/ismir2011.ismir.net\/papers\/OS6-1.pdf"},{"volume-title":"Numerical methods for Least Squares Problems","key":"e_1_3_2_1_7_1","unstructured":"\u00c5. Bj\u00f6rck. 1996. Numerical methods for Least Squares Problems. SIAM, Philadelphia."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/040608374"},{"key":"e_1_3_2_1_9_1","unstructured":"Ting Chen Ji Lin Tian Lin Song Han Chong Wang and Denny Zhou. 2018. Adaptive Mixture of Low-Rank Factorizations for Compact Neural Modeling. https:\/\/openreview.net\/forum?id=r1xFE3Rqt7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(97)00171-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594270415"},{"key":"e_1_3_2_1_13_1","unstructured":"The\u00a0BARS Community. 2023. BarsMatch: A Benchmark for Candidate Item Matching. https:\/\/openbenchmark.github.io\/BARS\/candidate_matching\/"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024074.1024079"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591785"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/47917.47918"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics"},{"volume-title":"Matrix Computations","author":"Golub G.H.","key":"e_1_3_2_1_18_1","unstructured":"G.H. Golub and C.F. Van\u00a0Loan. 2013. Matrix Computations (fourth ed.). Johns Hopkins University Press, Baltimore and London."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594276552"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_21_1","unstructured":"Xiangnan He Kuan Deng Xiang Wang Yan Li Yongdong Zhang and Meng Wang. 2020. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. arxiv:2002.02126\u00a0[cs.IR]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"P. Heggernes S. Eisenstat G. Kumfert and A. Pothen. 2001. The computational complexity of the minimum degree algorithm. ICASE Report No. 2001-42. Insitute for Computer Applications in Science and Engineering Hampton Virginia.","DOI":"10.2172\/15002765"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-021-09314-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/200979.200981"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.01.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186150"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597327334"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0716027"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482291"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.134"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19330130111"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Scott and M. T\u016fma. 2023. Algorithms for Sparse Linear Systems (first ed.). Birkh\u00e4user Cham.","DOI":"10.1007\/978-3-031-25820-6"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482264"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371831"},{"volume-title":"Domain decomposition","author":"Smith F.","key":"e_1_3_2_1_39_1","unstructured":"Barry\u00a0F. Smith, Petter\u00a0E. Bjorstad, and William\u00a0D. Gropp. 1996. Domain decomposition. Cambridge University Press, Cambridge, UK. xii+224 pages. Parallel multilevel methods for elliptic partial differential equations."},{"key":"e_1_3_2_1_40_1","unstructured":"Harald Steck. 2019. Collaborative Filtering via High-Dimensional Regression. arxiv:1904.13033\u00a0[cs.IR]"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313710"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3454778"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474273"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450054"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897317788"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3551482"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_2_1_48_1","unstructured":"Zygmunt Zajac. 2017. Goodbooks-10k: a new dataset for book recommendations. http:\/\/fastml.com\/goodbooks-10k."}],"event":{"name":"RecSys '23: Seventeenth ACM Conference on Recommender Systems","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval","SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGecom Special Interest Group on Economics and Computation"],"location":"Singapore Singapore","acronym":"RecSys '23"},"container-title":["Proceedings of the 17th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604915.3608827","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604915.3608827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:07Z","timestamp":1750178767000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604915.3608827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,14]]},"references-count":48,"alternative-id":["10.1145\/3604915.3608827","10.1145\/3604915"],"URL":"https:\/\/doi.org\/10.1145\/3604915.3608827","relation":{},"subject":[],"published":{"date-parts":[[2023,9,14]]},"assertion":[{"value":"2023-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}