{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T13:51:34Z","timestamp":1781877094181,"version":"3.54.5"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819538263","type":"print"},{"value":"9789819538270","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-95-3827-0_6","type":"book-chapter","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T13:01:23Z","timestamp":1781874083000},"page":"85-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bridging the\u00a0Gap Between Sparse Matrix Reordering and\u00a0Factorization: A Deep Learning Framework for\u00a0Fill-in Reduction"],"prefix":"10.1007","author":[{"given":"Ziwei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzi","family":"Niu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,20]]},"reference":[{"issue":"4","key":"6_CR1","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."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: Proceedings of the 1993 ACM\/IEEE Conference on Supercomputing, pp. 493\u2013502. ACM, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/169627.169790","DOI":"10.1145\/169627.169790"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In: Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 711\u2013718. SIAM, Philadelphia, PA, USA (1993)","DOI":"10.1002\/cpe.4330060203"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"31619","DOI":"10.1109\/ACCESS.2023.3262453","volume":"11","author":"JD Booth","year":"2023","unstructured":"Booth, J.D., Bolet, G.S.: Neural acceleration of graph based utility functions for sparse matrices. IEEE Access 11, 31619\u201331635 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3262453","journal-title":"IEEE Access"},{"key":"6_CR5","unstructured":"Bui, T. N., Jones, C.: A heuristic for reducing fill-in in sparse matrix factorization. In: Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 445\u2013452. SIAM, Philadelphia, PA, USA (1993)"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th National Conference, pp. 157\u2013172. ACM, New York, NY, USA (1969). https:\/\/doi.org\/10.1145\/800195.805928","DOI":"10.1145\/800195.805928"},{"key":"6_CR7","unstructured":"Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 6351\u20136361. Curran Associates Inc., Red Hook, NY, USA (2017)"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Dasgupta, A., Kumar, P.: Alpha elimination: using deep reinforcement learning to reduce fill-in during sparse matrix decomposition. In: Koutra, D., Plant, C., Gomez Rodriguez, M., Baralis, E., Bonchi, F. (eds.) Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-43421-1_28","DOI":"10.1007\/978-3-031-43421-1_28"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Davis, T. A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"6_CR10","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)"},{"key":"6_CR11","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(303), 1\u201328 (2022). https:\/\/jmlr.org\/papers\/v23\/21-0644.html"},{"key":"6_CR12","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"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S0895479894262865","volume":"18","author":"A George","year":"1997","unstructured":"George, A., Pothen, A.: An analysis of spectral envelope reduction via quadratic assignment problems. SIAM J. Matrix Anal. Appl. 18(3), 706\u2013732 (1997). https:\/\/doi.org\/10.1137\/S0895479894262865","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"6_CR14","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."},{"issue":"1","key":"6_CR15","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). https:\/\/doi.org\/10.1137\/S1064827595287997","journal-title":"SIAM J. Sci. Comput."},{"key":"6_CR16","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":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/214393.214403","volume":"11","author":"JWH Liu","year":"1985","unstructured":"Liu, J.W.H.: Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. (TOMS) 11(2), 141\u2013153 (1985). https:\/\/doi.org\/10.1145\/214393.214403","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"6_CR18","unstructured":"Luz, I., Galun, M., Maron, H., Basri, R., Yavneh, I.: Learning algebraic multigrid using graph neural networks. In: Proceedings of the 37th International Conference on Machine Learning, vol. 119, pp. 6489\u20136499. PMLR, Vienna, Austria (2020). https:\/\/proceedings.mlr.press\/v119\/luz20a.html"},{"key":"6_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)"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430\u2013452 (1990). https:\/\/doi.org\/10.1137\/0611030","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"6_CR21","unstructured":"Pothen, A., Simon, H.D., Wang, L.: Spectral nested dissection. Technical Report CS-92-01, Department of Computer Science, Pennsylvania State University, University Park, PA (1992). Also available as NASA Ames Research Center Report RNR-92-003"},{"key":"6_CR22","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":"2\u20133","key":"6_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-3","volume":"2","author":"HD Simon","year":"1991","unstructured":"Simon, H.D.: Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 2(2\u20133), 135\u2013148 (1991). https:\/\/doi.org\/10.1016\/0956-0521(91)90014-3","journal-title":"Comput. Syst. Eng."},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Taylor, M., Guiver, J., Robertson, S., Minka, T.: SoftRank: optimising non-smooth rank metrics. In: Proceedings of the 1st International Conference on Web Search and Data Mining (WSDM), pp. 77\u201386. ACM, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1341531.1341544","DOI":"10.1145\/1341531.1341544"},{"issue":"1","key":"6_CR25","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. Algebraic Discr. Methods 2(1), 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","journal-title":"SIAM J. Algebraic Discr. Methods"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C. M.: Combining reinforcement learning with Lin-Kernighan-Helsgaun algorithm for the traveling salesman problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 12445\u201312452. AAAI Press, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/569147.569149","DOI":"10.1145\/569147.569149"}],"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-95-3827-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T13:01:31Z","timestamp":1781874091000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3827-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819538263","9789819538270"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3827-0_6","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":"20 June 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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}