{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T13:09:55Z","timestamp":1778332195190,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203772","type":"print"},{"value":"9789819203789","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0378-9_5","type":"book-chapter","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:20:09Z","timestamp":1778329209000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-supervised Learning for\u00a0Sparse Matrix Reordering"],"prefix":"10.1007","author":[{"given":"Ziwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangfang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzi","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Wilkinson, J.H., Reinsch, C.: Handbook for Automatic Computation: Volume II: Linear Algebra. Springer, Berlin\/Heidelberg (1971)","DOI":"10.1007\/978-3-662-39778-7"},{"key":"5_CR2","volume-title":"Direct Methods for Sparse Matrices","author":"IS Duff","year":"1986","unstructured":"Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Clarendon Press, Oxford (1986)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algeb. Discrete Meth. 2(1), 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","journal-title":"SIAM J. Algeb. Discrete Meth."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, pp. 157\u2013172. ACM (1969)","DOI":"10.1145\/800195.805928"},{"key":"5_CR6","unstructured":"George, A.: Computer Implementation of the Finite Element Method. Ph.D. thesis, Stanford University (1971)"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manage. Sci. 3(3), 255\u2013269 (1957)","journal-title":"Manage. Sci."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Graph Theory and Computing, pp. 183\u2013217. Elsevier (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"JA George","year":"1973","unstructured":"George, J.A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Liu, J.W.H.: Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11(2), 141\u2013153 (1985)","DOI":"10.1145\/214392.214398"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 377\u2013380 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"5_CR14","unstructured":"Gatti, A., Hu, Z., Smidt, T., Ghysels, P.: Graph partitioning and sparse matrix ordering using reinforcement learning and graph neural networks. J. Mach. Learn. Res. 23, 1\u201328 (2022)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Booth, J.D., Bolet, G.S.: Neural acceleration of graph based utility functions for sparse matrices. IEEE Access 11 (2023)","DOI":"10.1109\/ACCESS.2023.3262453"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, P.: Alpha elimination: using deep reinforcement learning to reduce fill-in during sparse matrix decomposition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer (2023)","DOI":"10.1007\/978-3-031-43421-1_28"},{"issue":"1","key":"5_CR17","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"5_CR18","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, pp. 1024\u20131034 (2017)"},{"key":"5_CR19","unstructured":"Pellegrini, F., Chevalier, C.: SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package. Technical report, LaBRI, Universit\u00e9 Bordeaux, Bordeaux, France (2020)"},{"key":"5_CR20","unstructured":"Karypis, G., Kumar, V.: METIS, a Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reduced Orderings of Sparse Matrices. Technical report, University of Minnesota, Minneapolis, MN, USA (1998)"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/1089014.1089017","volume":"31","author":"XS Li","year":"2005","unstructured":"Li, X.S.: An Overview of SuperLU: algorithms, implementation, and user interface. ACM Trans. Math. Softw. 31(3), 302\u2013325 (2005)","journal-title":"ACM Trans. Math. Softw."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Amestoy, P.R., Duff, I.S., L\u2019Excellent, J.Y., Koster, J.: MUMPS: a general purpose distributed memory sparse solver. In: Proceedings of the 2000 International Workshop on Applied Parallel Computing. Springer, Berlin\/Heidelberg (2000)","DOI":"10.1007\/3-540-70734-4_16"},{"key":"5_CR23","unstructured":"Grementieri, L., Galeone, P.: Towards neural sparse linear solvers. arXiv preprint arXiv:2203.06944 (2022). https:\/\/arxiv.org\/abs\/2203.06944"},{"key":"5_CR24","unstructured":"Zou, H., Xu, X., Zhang, C.-S.: A survey on intelligent iterative methods for solving sparse linear algebraic equations. arXiv preprint arXiv:2310.06630 (2023). https:\/\/arxiv.org\/abs\/2310.06630"},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination. SIAM J. Comput. 5(2), 266\u2013283 (1976). https:\/\/doi.org\/10.1137\/0205021","journal-title":"SIAM J. Comput."},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Barnard, S.\u00a0T., Pothen, A., Simon, H.\u00a0D.: A spectral algorithm for envelope reduction of sparse matrice. In: Proceedings of Supercomputing \u201993: The 1993 ACM\/IEEE Conference on Supercomputing, pp.\u00a0493\u2013502 (1993). https:\/\/doi.org\/10.1145\/169627.169790.","DOI":"10.1145\/169627.169790."},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Gatti, A., Hu, Z., Smidt, T., Ng, E. G., Ghysels, P.: Deep learning and spectral embedding for graph partitioning. In: Proceedings of the 2021 SIAM Conference on Computational Science and Engineering (CSE21), pp. 1\u201312. SIAM, Philadelphia, PA, USA (2021). https:\/\/doi.org\/10.1137\/1.9781611977141.3","DOI":"10.1137\/1.9781611977141.3"},{"key":"5_CR28","unstructured":"Li, Z., Yuan, T., Niu, S., Li, H.: Bridging the gap between sparse matrix reordering and factorization: a deep learning framework for fill-in reduction. In: Database Systems for Advanced Applications (DASFAA 2025), Springer (2025)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0378-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:20:14Z","timestamp":1778329214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0378-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203772","9789819203789"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0378-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}