{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:30:22Z","timestamp":1763699422041,"version":"3.45.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11390-025-5275-5","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:25:43Z","timestamp":1763699143000},"page":"1331-1346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Summarization-Based Pattern-Aware Matrix Reordering Approach"],"prefix":"10.1007","volume":"40","author":[{"given":"Zi-Han","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Jia-Cheng","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Xu-Meng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dong-Ming","family":"Han","sequence":"additional","affiliation":[]},{"given":"Fang-Zhou","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Min-Feng","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"5275_CR1","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.3389\/fpsyg.2017.01349","volume":"8","author":"F Zeng","year":"2017","unstructured":"Zeng F, Tao R, Yang Y, Xie T. How social communications influence advertising perception and response in online communities? Frontiers in Psychology, 2017, 8: 1349. DOI: https:\/\/doi.org\/10.3389\/fpsyg.2017.01349.","journal-title":"Frontiers in Psychology"},{"key":"5275_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1401890.1401898","volume-title":"Proc. the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"L Becchetti","year":"2008","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A. Efficient semistreaming algorithms for local triangle counting in massive graphs. In Proc. the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2008, pp.16\u201324. DOI: https:\/\/doi.org\/10.1145\/1401890.1401898."},{"key":"5275_CR3","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/1963405.1963491","volume-title":"Proc. the 20th International Conference on World Wide Web","author":"S Suri","year":"2011","unstructured":"Suri S, Vassilvitskii S. Counting triangles and the curse of the last reducer. In Proc. the 20th International Conference on World Wide Web, Mar. 28\u2013Apr. 1, 2011, pp.607\u2013614. DOI: https:\/\/doi.org\/10.1145\/1963405.1963491."},{"issue":"8\/9\/10\/11\/12\/13","key":"5275_CR4","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"A Z Broder","year":"1997","unstructured":"Broder A Z, Glassman S C, Manasse M S, Zweig G. Syntactic clustering of the web. Computer Networks and ISDN Systems, 1997, 29(8\/9\/10\/11\/12\/13): 1157\u20131166. DOI: https:\/\/doi.org\/10.1016\/S0169-7552(97)00031-7.","journal-title":"Computer Networks and ISDN Systems"},{"key":"5275_CR5","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-66805-5_36","volume-title":"Lecture Notes in Computer Science 10451","author":"S You","year":"2017","unstructured":"You S, Gao L, Hua Y, Zhu M, Li M. A visualization system for dynamic protein structure and amino acid network. In Lecture Notes in Computer Science 10451, Luo Y (ed.), Springer, 2017, pp.290\u2013297. DOI: https:\/\/doi.org\/10.1007\/978-3-319-66805-5_36."},{"issue":"1","key":"5275_CR6","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/TVCG.2019.2934300","volume":"26","author":"M Behrisch","year":"2020","unstructured":"Behrisch M, Schreck T, Pfister H. GUIRO: User-guided matrix reordering. IEEE Trans. Visualization and Computer Graphics, 2020, 26(1): 184\u2013194. DOI: https:\/\/doi.org\/10.1109\/TVCG.2019.2934300.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"issue":"10","key":"5275_CR7","doi-asserted-by":"publisher","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello E, Hao J K, Torres-Jimenez J. An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Computers & Operations Research, 2008, 35(10): 3331\u20133346. DOI: https:\/\/doi.org\/10.1016\/j.cor.2007.03.001.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5275_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVCG.2021.3114773","volume":"28","author":"N van Beusekom","year":"2022","unstructured":"van Beusekom N, Meulemans W, Speckmann B. Simultaneous matrix orderings for graph collections. IEEE Trans. Visualization and Computer Graphics, 2022, 28(1): 1\u201310. DOI: https:\/\/doi.org\/10.1109\/TVCG.2021.3114773.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"key":"5275_CR9","doi-asserted-by":"publisher","unstructured":"Liu Y, Safavi T, Dighe A, Koutra D. Graph summarization methods and applications: A survey. ACM Computing Surveys (CSUR), 2018, 51(3): Article No. 62. DOI: https:\/\/doi.org\/10.1145\/3186727.","DOI":"10.1145\/3186727"},{"key":"5275_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/1376616.1376661","volume-title":"Proc. the 2008 ACM SIGMOD International Conference on Management of Data","author":"S Navlakha","year":"2008","unstructured":"Navlakha S, Rastogi R, Shrivastava N. Graph summarization with bounded error. In Proc. the 2008 ACM SIGMOD International Conference on Management of Data, Jun. 2008, pp.419\u2013432. DOI: https:\/\/doi.org\/10.1145\/1376616.1376661."},{"issue":"1","key":"5275_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TVCG.2018.2864826","volume":"25","author":"G Y Y Chan","year":"2019","unstructured":"Chan G Y Y, Xu P, Dai Z, Ren L. ViBr: Visualizing bipartite relations at scale with the minimum description length principle. IEEE Trans. Visualization and Computer Graphics, 2019, 25(1): 321\u2013330. DOI: https:\/\/doi.org\/10.1109\/TVCG.2018.2864826.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"issue":"3","key":"5275_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/sam.11267","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C. Summarizing and understanding large graphs. Statistical Analysis and Data Mining: The ASA Data Science Journal, 2015, 8(3): 183\u2013202. DOI: https:\/\/doi.org\/10.1002\/sam.11267.","journal-title":"Statistical Analysis and Data Mining: The ASA Data Science Journal"},{"issue":"10","key":"5275_CR13","doi-asserted-by":"publisher","first-page":"2940","DOI":"10.1109\/TVCG.2018.2865940","volume":"25","author":"M Okoe","year":"2019","unstructured":"Okoe M, Jianu R, Kobourov S. Node-link or adjacency matrices: Old question, new insights. IEEE Trans. Visualization and Computer Graphics, 2019, 25(10): 2940\u20132952. DOI: https:\/\/doi.org\/10.1109\/TVCG.2018.2865940.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"issue":"2","key":"5275_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/j.2044-8317.1974.tb00534.x","volume":"27","author":"L Hubert","year":"1974","unstructured":"Hubert L. Some applications of graph theory and related non-metric techniques to problems of approximate seriation: The case of symmetric proximity measures. British Journal of Mathematical and Statistical Psychology, 1974, 27(2): 133\u2013153. DOI: https:\/\/doi.org\/10.1111\/J.2044-8317.1974.TB00534.X.","journal-title":"British Journal of Mathematical and Statistical Psychology"},{"issue":"1","key":"5275_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"J E Atkins","year":"1998","unstructured":"Atkins J E, Boman E G, Hendrickson B. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 1998, 28(1): 297\u2013310. DOI: https:\/\/doi.org\/10.1137\/S0097539795285771.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5275_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.7155\/jgaa.00089","volume":"8","author":"D Harel","year":"2004","unstructured":"Harel D, Koren Y. Graph drawing by high-dimensional embedding. Journal of Graph Algorithms and Applications, 2004, 8(2): 195\u2013214. DOI: https:\/\/doi.org\/10.7155\/jgaa.00089.","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"5275_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"A V Knyazev","year":"2001","unstructured":"Knyazev A V. Toward the optimal preconditioned Eigen-solver: Locally optimal block preconditioned conjugate gradient method. SIAM Journal on Scientific Computing, 2001, 23(2): 517\u2013541. DOI: https:\/\/doi.org\/10.1137\/S1064827500366124.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"5275_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1111\/cgf.12935","volume":"35","author":"M Behrisch","year":"2016","unstructured":"Behrisch M, Bach B, Riche N H, Schreck T, Fekete J D. Matrix reordering methods for table and network visualization. Computer Graphics Forum, 2016, 35(3): 693\u2013716. DOI: https:\/\/doi.org\/10.1111\/cgf.12935.","journal-title":"Computer Graphics Forum"},{"key":"5275_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.12688\/f1000research.4784.1","volume":"3","author":"R Sakai","year":"2014","unstructured":"Sakai R, Winand R, Verbeiren T, Moere A V, Aerts J. dendsort: Modular leaf ordering methods for dendrogram representations in R. F1000Research, 2014, 3: 177. DOI: https:\/\/doi.org\/10.12688\/f1000research.4784.1.","journal-title":"F1000Research"},{"issue":"S1","key":"5275_CR20","doi-asserted-by":"publisher","first-page":"S22","DOI":"10.1093\/bioinformatics\/17.suppl_1.S22","volume":"17","author":"Z Bar-Joseph","year":"2001","unstructured":"Bar-Joseph Z, Gifford D K, Jaakkola T S. Fast optimal leaf ordering for hierarchical clustering. Bioinformatics, 2001, 17(S1): S22\u2013S29. DOI: https:\/\/doi.org\/10.1093\/BIOINFORMATICS\/17.SUPPL_1.S22.","journal-title":"Bioinformatics"},{"key":"5275_CR21","first-page":"7","volume":"12","author":"C H Chen","year":"2002","unstructured":"Chen C H. Generalized association plots: Information visualization via iteratively generated correlation matrices. Statistica Sinica, 2002, 12: 7\u201329.","journal-title":"Statistica Sinica"},{"key":"5275_CR22","series-title":"Ph.D. Thesis","volume-title":"Applications of multidimensional scaling to graph drawing","author":"C Pich","year":"2009","unstructured":"Pich C. Applications of multidimensional scaling to graph drawing [Ph.D. Thesis]. Universit\u00e4t Konstanz, Konstanz, 2009."},{"issue":"3","key":"5275_CR23","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s11336-007-9049-5","volume":"73","author":"M J Brusco","year":"2008","unstructured":"Brusco M J, K\u00f6hn H F, Stahl S. Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika, 2008, 73(3): 503\u2013522. DOI: https:\/\/doi.org\/10.1007\/S11336-007-9049-5.","journal-title":"Psychometrika"},{"issue":"1","key":"5275_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1198\/000313005X22770","volume":"59","author":"S Niermann","year":"2005","unstructured":"Niermann S. Optimizing the ordering of tables with evolutionary computation. The American Statistician, 2005, 59(1): 41\u201346. DOI: https:\/\/doi.org\/10.1198\/000313005X22770.","journal-title":"The American Statistician"},{"issue":"6","key":"5275_CR25","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s10732-012-9213-7","volume":"18","author":"M Lozano","year":"2012","unstructured":"Lozano M, Duarte A, Gort\u00e1zar F, Mart\u00ed R. Variable neighborhood search with ejection chains for the antibandwidth problem. Journal of Heuristics, 2012, 18(6): 919\u2013938. DOI: https:\/\/doi.org\/10.1007\/s10732-012-9213-7.","journal-title":"Journal of Heuristics"},{"key":"5275_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.5555\/645635.660833","volume-title":"Proc. the 8th International Conference on Intelligent Systems for Molecular Biology","author":"Y Cheng","year":"2000","unstructured":"Cheng Y, Church G M. Biclustering of expression data. In Proc. the 8th International Conference on Intelligent Systems for Molecular Biology, Aug. 2000, pp.93\u2013103. DOI: https:\/\/doi.org\/10.5555\/645635.660833."},{"issue":"1","key":"5275_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TVCG.2016.2598467","volume":"23","author":"M Behrisch","year":"2017","unstructured":"Behrisch M, Bach B, Hund M, Delz M, Von R\u00fcden L, Fekete J D, Schreck T. Magnostics: Image-based search of interesting matrix views for guided network exploration. IEEE Trans. Visualization and Computer Graphics, 2017, 23(1): 31\u201340. DOI: https:\/\/doi.org\/10.1109\/TVCG.2016.2598467.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"issue":"2","key":"5275_CR28","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/sam.10071","volume":"3","author":"I Liiv","year":"2010","unstructured":"Liiv I. Seriation and matrix reordering methods: An historical overview. Statistical Analysis and Data Mining: The ASA Data Science Journal, 2010, 3(2): 70\u201391. DOI: https:\/\/doi.org\/10.1002\/sam.10071.","journal-title":"Statistical Analysis and Data Mining: The ASA Data Science Journal"},{"issue":"2","key":"5275_CR29","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"N E Gibbs","year":"1976","unstructured":"Gibbs N E, Poole W G Jr, Stockmeyer P K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis, 1976, 13(2): 236\u2013250. DOI: https:\/\/doi.org\/10.1137\/0713023.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"5275_CR30","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-36379-3_26","volume-title":"Proc. the 28th International Workshop on Graph-Theoretic Concepts in Computer Science","author":"Y Koren","year":"2002","unstructured":"Koren Y, Harel D. A multi-scale algorithm for the linear arrangement problem. In Proc. the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun. 2002, pp.296\u2013309. DOI: https:\/\/doi.org\/10.1007\/3-540-36379-3_26."},{"issue":"1","key":"5275_CR31","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L H Harper","year":"1964","unstructured":"Harper L H. Optimal assignments of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics, 1964, 12(1): 131\u2013135. DOI: https:\/\/doi.org\/10.1137\/0112012.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"12","key":"5275_CR32","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim Y, Kang U, Faloutsos C. SlashBurn: Graph compression and mining beyond caveman communities. IEEE Trans. Knowledge and Data Engineering, 2014, 26(12): 3077\u20133089. DOI: https:\/\/doi.org\/10.1109\/TKDE.2014.2320716.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"1","key":"5275_CR33","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/TVCG.2018.2865139","volume":"25","author":"W Chen","year":"2019","unstructured":"Chen W, Guo F, Han D, Pan J, Nie X, Xia J, Zhang X. Structure-based suggestive exploration: A new approach for effective exploration of large networks. IEEE Trans. Visualization and Computer Graphics, 2019, 25(1): 555\u2013565. DOI: https:\/\/doi.org\/10.1109\/TVCG.2018.2865139.","journal-title":"IEEE Trans. Visualization and Computer Graphics"},{"key":"5275_CR34","volume-title":"Practical Nonparametric Statistics","author":"W J Conover","year":"1999","unstructured":"Conover W J. Practical Nonparametric Statistics. John Wiley & Sons, 1999."},{"issue":"2","key":"5275_CR35","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 1979, 6(2): 65\u201370.","journal-title":"Scandinavian Journal of Statistics"},{"issue":"3","key":"5275_CR36","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1207\/s15327906mbr0903_8","volume":"9","author":"I Spence","year":"1974","unstructured":"Spence I, Graef J. The determination of the underlying dimensionality of an empirically obtained matrix of proximities. Multivariate Behavioral Research, 1974, 9(3): 331\u2013341. DOI: https:\/\/doi.org\/10.1207\/s15327906mbr0903_8.","journal-title":"Multivariate Behavioral Research"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-5275-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-025-5275-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-5275-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:25:44Z","timestamp":1763699144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-025-5275-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["5275"],"URL":"https:\/\/doi.org\/10.1007\/s11390-025-5275-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"10 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest\n                      The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}