{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:45:44Z","timestamp":1770540344986,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Samsung Electronics Co., Ltd"},{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2022-0-00157 & 2019-0-00075 & 2021-0-02068"],"award-info":[{"award-number":["2022-0-00157 & 2019-0-00075 & 2021-0-02068"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2021R1C1C1008526"],"award-info":[{"award-number":["2021R1C1C1008526"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583226","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"71-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-7329","authenticated-orcid":false,"given":"Taehyung","family":"Kwon","sequence":"first","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3223-8318","authenticated-orcid":false,"given":"Jihoon","family":"Ko","sequence":"additional","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5533-1507","authenticated-orcid":false,"given":"Jinhong","family":"Jung","sequence":"additional","affiliation":[{"name":"Department of Computer Science &amp; Engineering, Jeonbuk National University, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[{"name":"Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741091"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In WWW.","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. In SDM.","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_7_1","volume-title":"Learning phrase representations using RNN encoder-decoder for statistical machine translation. EMNLP","author":"Cho Kyunghyun","year":"2014","unstructured":"Kyunghyun Cho, Bart Van\u00a0Merri\u00ebnboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using RNN encoder-decoder for statistical machine translation. EMNLP (2014)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev and Alon Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. In KDD.","DOI":"10.1145\/2939672.2939862"},{"key":"e_1_3_2_1_9_1","series-title":"SIAM Journal on computing 36, 1","volume-title":"Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix","author":"Drineas Petros","year":"2006","unstructured":"Petros Drineas, Ravi Kannan, and Michael\u00a0W Mahoney. 2006. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM Journal on computing 36, 1 (2006), 158\u2013183."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"e_1_3_2_1_12_1","volume-title":"Linear algebra","author":"Golub H","unstructured":"Gene\u00a0H Golub and Christian Reinsch. 1971. Singular value decomposition and least squares solutions. In Linear algebra. Springer, 134\u2013151."},{"key":"e_1_3_2_1_13_1","unstructured":"Ruining He and Julian McAuley. 2016. Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In WWW."},{"key":"e_1_3_2_1_14_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735\u20131780."},{"key":"e_1_3_2_1_15_1","unstructured":"Nam Hyeon-Woo Moon Ye-Bin and Tae-Hyun Oh. 2022. FedPara: Low-rank Hadamard Product for Communication-Efficient Federated Learning. In ICLR."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-020-05920-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Alexandros Karatzoglou Xavier Amatriain Linas Baltrunas and Nuria Oliver. 2010. Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In RecSys.","DOI":"10.1145\/1864708.1864727"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Tamara\u00a0G Kolda and Jimeng Sun. 2008. Scalable tensor decompositions for multi-aspect data mining. In ICDM.","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_3_2_1_19_1","volume-title":"Federated optimization: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527","author":"Kone\u010dn\u1ef3 Jakub","year":"2016","unstructured":"Jakub Kone\u010dn\u1ef3, H\u00a0Brendan McMahan, Daniel Ramage, and Peter Richt\u00e1rik. 2016. Federated optimization: Distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527 (2016)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Taehyung Kwon Jihoon Ko Jinhong Jung and Kijung Shin. 2023. NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors (Code Datasets and Appendix). https:\/\/github.com\/kbrother\/NeuKron","DOI":"10.1145\/3543507.3583226"},{"key":"e_1_3_2_1_21_1","unstructured":"Timoth\u00e9e Lacroix Nicolas Usunier and Guillaume Obozinski. 2018. Canonical tensor decomposition for knowledge base completion. In ICML."},{"key":"e_1_3_2_1_22_1","volume-title":"Ssumm: Sparse summarization of massive graphs. In KDD.","author":"Lee Kyuhan","year":"2020","unstructured":"Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko, Sungsu Lim, and Kijung Shin. 2020. Ssumm: Sparse summarization of massive graphs. In KDD."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Kristen LeFevre and Evimaria Terzi. 2010. GraSS: Graph structure summarization. In SDM.","DOI":"10.1137\/1.9781611972801.40"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jurij Leskovec Deepayan Chakrabarti Jon Kleinberg and Christos Faloutsos. 2005. Realistic mathematically tractable graph generation and evolution using kronecker multiplication. In ECML\/PKDD.","DOI":"10.1007\/11564126_17"},{"key":"e_1_3_2_1_25_1","volume-title":"Kronecker graphs: an approach to modeling networks.JMLR 11, 2","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: an approach to modeling networks.JMLR 11, 2 (2010)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec and Christos Faloutsos. 2007. Scalable modeling of real graphs using kronecker multiplication. In ICML.","DOI":"10.1145\/1273496.1273559"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Chao Liu Fan Guo and Christos Faloutsos. 2009. Bbm: bayesian browsing model from petabyte-scale data. In KDD.","DOI":"10.1145\/1557019.1557081"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Julian McAuley Jure Leskovec and Dan Jurafsky. 2012. Learning attitudes and attributes from multi-aspect reviews. In ICDM.","DOI":"10.1109\/ICDM.2012.110"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"e_1_3_2_1_30_1","volume-title":"Sweg: Lossless and lossy summarization of web-scale graphs. In WWW.","author":"Shin Kijung","year":"2019","unstructured":"Kijung Shin, Amol Ghoting, Myunghwan Kim, and Hema Raghavan. 2019. Sweg: Lossless and lossy summarization of web-scale graphs. In WWW."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Sumit Sidana Charlotte Laclau Massih\u00a0R Amini Gilles Vandelle and Andr\u00e9 Bois-Crettez. 2017. KASANDR: a large-scale dataset with implicit feedback for recommendation. In SIGIR.","DOI":"10.1145\/3077136.3080713"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Arnab Sinha Zhihong Shen Yang Song Hao Ma Darrin Eide Bo-June\u00a0(Paul) Hsu and Kuansan Wang. 2015. An Overview of Microsoft Academic Service (MAS) and Applications. In WWW.","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833183"},{"key":"e_1_3_2_1_34_1","volume-title":"SPLATT: Efficient and parallel sparse tensor-matrix multiplication. In IPDPS.","author":"Smith Shaden","year":"2015","unstructured":"Shaden Smith, Niranjay Ravindran, Nicholas\u00a0D Sidiropoulos, and George Karypis. 2015. SPLATT: Efficient and parallel sparse tensor-matrix multiplication. In IPDPS."},{"key":"e_1_3_2_1_35_1","series-title":"SIAM review 35, 4","volume-title":"On the early history of the singular value decomposition","author":"Stewart W","year":"1993","unstructured":"Gilbert\u00a0W Stewart. 1993. On the early history of the singular value decomposition. SIAM review 35, 4 (1993), 551\u2013566."},{"key":"e_1_3_2_1_36_1","unstructured":"Jimeng Sun Yinglian Xie Hui Zhang and Christos Faloutsos. 2007. Less is more: Compact matrix decomposition for large sparse graphs. In SDM."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219975"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/110836067"},{"key":"e_1_3_2_1_40_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan\u00a0N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM.","DOI":"10.1145\/2350190.2350193"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583226","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:19Z","timestamp":1750183759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":41,"alternative-id":["10.1145\/3543507.3583226","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583226","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}