{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:38:04Z","timestamp":1787384284462,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"crossref","award":["2008:7145"],"award-info":[{"award-number":["2008:7145"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320746"],"award-info":[{"award-number":["CCF-1320746"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1117055"],"award-info":[{"award-number":["CCF-1117055"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>In this paper we develop a novel clustered matrix approximation framework, first showing the motivation behind our research. The proposed methods are particularly well suited for problems with large scale sparse matrices that represent graphs and\/or bipartite graphs from information science applications. Our framework and resulting approximations have a number of benefits: (1) the approximations preserve important structure that is present in the original matrix; (2) the approximations contain both global-scale and local-scale information; (3) the procedure is efficient both in computational speed and memory usage; and (4) the resulting approximations are considerably more accurate with less memory usage than truncated SVD approximations, which are optimal with respect to rank. The framework is also quite flexible as it may be modified in various ways to fit the needs of a particular application. In the paper we also derive a probabilistic approach that uses randomness to compute a clustered matrix approximation within the developed framework. We further prove deterministic and probabilistic bounds of the resulting approximation error. Finally, in a series of experiments we evaluate, analyze, and discuss various aspects of the proposed framework. In particular, all the benefits we claim for the clustered matrix approximation are clearly illustrated using real-world and large scale data.<\/jats:p>","DOI":"10.1137\/15m1042206","type":"journal-article","created":{"date-parts":[[2016,10,27]],"date-time":"2016-10-27T12:33:20Z","timestamp":1477571600000},"page":"1531-1555","source":"Crossref","is-referenced-by-count":4,"title":["Clustered Matrix Approximation"],"prefix":"10.1137","volume":"37","author":[{"given":"Berkant","family":"Savas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,10,27]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"A. Abou-Rjeili and G. Karypis,\n                      Multilevel algorithms for partitioning power-law graphs\n                      , in IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006.","DOI":"10.21236\/ADA439402"},{"key":"atypb2","first-page":"44","author":"Backstrom L.","year":"2006","journal-title":"New York"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"atypb4","unstructured":"M. Berry,\n                      Survey of Text Mining: Clustering, Classification, and Retrieval\n                      , Springer, New York, 2003."},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"\\AA. Bj\u00f6rck,\n                      Numerical Methods in Matrix Computations\n                      , Springer, New York, 2015.","DOI":"10.1007\/978-3-319-05089-8"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1973-0348991-3"},{"key":"atypb7","first-page":"968","author":"Boutsidis C.","year":"2009","journal-title":"Philadelphia"},{"key":"atypb8","first-page":"599","author":"Boutsidis C.","year":"2008","journal-title":"New York"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198398"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"N. Cristianini, J. Shawe-Taylor, and J. S. Kandola,\n                      Spectral kernel methods for clustering\n                      , in Advances in Neural Information Processing Systems 14, MIT Press, 2001, pp. 649-655.","DOI":"10.7551\/mitpress\/1120.003.0088"},{"key":"atypb11","first-page":"36","author":"Deerwester S.","year":"1988","journal-title":"American Society for Information Science"},{"key":"atypb12","first-page":"269","author":"Dhillon I. S.","year":"2001","journal-title":"New York"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007612920971"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/090761070"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.05.018"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.10.005"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"atypb22","first-page":"561","author":"Kunegis J.","year":"2009","journal-title":"New York"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"atypb24","first-page":"695","author":"Leskovec J.","year":"2008","journal-title":"New York"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"atypb27","doi-asserted-by":"crossref","unstructured":"Z. Lu, B. Savas, W. Tang, and I. S. Dhillon,\n                      Supervised link prediction using multiple sources\n                      , in Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM), 2010, pp. 923-928.","DOI":"10.1109\/ICDM.2010.112"},{"key":"atypb28","unstructured":"A. Y. Ng, M. I. Jordan, and Y. Weiss,\n                      On Spectral Clustering: Analysis and an Algorithm\n                      , in Advances in Neural Information Processing Systems 14, MIT Press, 2001, pp. 849-856."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/080736417"},{"key":"atypb30","first-page":"164","author":"Savas B.","year":"2011","journal-title":"Philadelphia"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"atypb32","first-page":"215","author":"Shin D.","year":"2012","journal-title":"New York"},{"key":"atypb33","first-page":"2798","author":"Si S.","year":"2014","journal-title":"Curran Associates"},{"key":"atypb34","first-page":"331","author":"Song H. H.","year":"2012","journal-title":"New York"},{"key":"atypb35","first-page":"76","author":"Sui X.","year":"2013","journal-title":"Heidelberg"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1145\/2036264.2036267"},{"key":"atypb37","doi-asserted-by":"crossref","unstructured":"D. Wagner and F. Wagner,\n                      Between min cut and graph bisection\n                      , in Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS '93), London, UK, 1993, Springer-Verlag, Berlin, Heidelberg, pp. 744-750.","DOI":"10.1007\/3-540-57182-5_65"},{"key":"atypb38","first-page":"936","author":"Whang J. J.","year":"2015","journal-title":"Philadelphia"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1109\/34.244673"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"atypb41","first-page":"631","author":"Zeimpekis D.","year":"2005","journal-title":"Philadelphia"},{"key":"atypb42","first-page":"1172","author":"Zeimpekis D.","year":"2006","journal-title":"IEEE Computer Society"},{"key":"atypb43","unstructured":"H. Zha, C. Ding, M. Gu, X. He, and H. Simon,\n                      Spectral relaxation for $k$-means clustering\n                      , in Advances in Neural Information Processing Systems 14, MIT Press, 2001, pp. 1057-1064."},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2064786"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899357875"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1042206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:44:01Z","timestamp":1787334241000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1042206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/15M1042206"],"URL":"https:\/\/doi.org\/10.1137\/15m1042206","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}