{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:37:11Z","timestamp":1759883831064,"version":"build-2065373602"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"DATAREDUX","award":["ANR19-CE46-0008"],"award-info":[{"award-number":["ANR19-CE46-0008"]}]},{"name":"ANR AllegroAssai","award":["ANR-19-CHIA0009."],"award-info":[{"award-number":["ANR-19-CHIA0009."]}]},{"name":"ANR DARLING","award":["ANR-19-CE48-0002."],"award-info":[{"award-number":["ANR-19-CE48-0002."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10994-025-06837-7","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T17:25:32Z","timestamp":1755883532000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pasco (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms"],"prefix":"10.1007","volume":"114","author":[{"given":"Lasalle","family":"Etienne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaudaine","family":"R\u00e9mi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vayer","family":"Titouan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borgnat","family":"Pierre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gon\u00e7alves","family":"Paulo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gribonval","family":"R\u00e9mi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsai","family":"M\u00e1rton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"6837_CR1","doi-asserted-by":"crossref","unstructured":"Ayad, H. G., Kamel, M. S. (2010). On voting-based consensus of cluster ensembles. Pattern Recognition43(5)","DOI":"10.1016\/j.patcog.2009.11.012"},{"key":"6837_CR2","doi-asserted-by":"crossref","unstructured":"Blondel, V. D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment2008(10)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"6837_CR3","unstructured":"Blondel, M., Seguy, V., Rolet, A. (2018). Smooth and sparse optimal transport. In AISTATS"},{"key":"6837_CR4","unstructured":"Boutsidis, C., Kambadur, P., Gittens, A. (2015). Spectral clustering via the power method-provably. In ICML"},{"key":"6837_CR5","doi-asserted-by":"crossref","unstructured":"Bunimovich, L., Smith, D., Webb, B. (2019). Finding hidden structures, hierarchies, and cores in networks via isospectral reduction. Applied Mathematics & Nonlinear Sciences4(1)","DOI":"10.2478\/AMNS.2019.1.00021"},{"issue":"1","key":"6837_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s40324-021-00282-x","volume":"79","author":"J Chen","year":"2022","unstructured":"Chen, J., Saad, Y., & Zhang, Z. (2022). Graph coarsening: From scientific computing to machine learning. SeMA Journal, 79(1), 187\u2013223.","journal-title":"SeMA Journal"},{"key":"6837_CR7","unstructured":"Cuturi, M., Doucet, A. (2014). Fast computation of wasserstein barycenters. In ICML"},{"key":"6837_CR8","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., Kulis, B. (2004). Kernel k-means: Spectral clustering and normalized cuts. In Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1014052.1014118"},{"key":"6837_CR9","doi-asserted-by":"crossref","unstructured":"Dhillon, I. S., Guan, Y., Kulis, B. (2007). Weighted graph cuts without eigenvectors a multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence29(11)","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"6837_CR10","unstructured":"Flamary, R., Courty, N., Gramfort, A., Alaya, M. Z., Boisbunon, A., Chambon, S., Chapel, L., Corenflos, A., Fatras, K., Fournier, N., et al. (2021). Pot: Python optimal transport. JMLR22(78)"},{"key":"6837_CR11","doi-asserted-by":"crossref","unstructured":"Fortunato, S. (2010). Community detection in graphs. Physics Reports486.","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"6837_CR12","doi-asserted-by":"crossref","unstructured":"Fortunato, S., Hric, D. (2016). Community detection in networks: A user guide. Physics Reports659. Community detection in networks: A user guide","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"6837_CR13","doi-asserted-by":"crossref","unstructured":"Fred, A. (2001). Finding consistent clusters in data partitions. In International Workshop on Multiple Classifier Systems","DOI":"10.1007\/3-540-48219-9_31"},{"key":"6837_CR14","doi-asserted-by":"crossref","unstructured":"Ghosh, J., Acharya, A. (2018). Cluster ensembles: Theory and applications. Data Clustering","DOI":"10.1201\/9781315373515-22"},{"key":"6837_CR15","unstructured":"Gottesb\u00fcren, L., Heuer, T., Sanders, P., Schulz, C., Seemaier, D. (2021). Deep multilevel graph partitioning. arXiv preprint arXiv:2105.02022"},{"key":"6837_CR16","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R. W., et al. (1995). A multi-level algorithm for partitioning graphs. SC95(28)","DOI":"10.1145\/224170.224228"},{"key":"6837_CR17","unstructured":"Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M., Leskovec, J. (2020). Open graph benchmark: Datasets for machine learning on graphs. arXiv preprint arXiv:2005.00687"},{"key":"6837_CR18","unstructured":"Jin, Y., Loukas, A., JaJa, J. (2020). Graph coarsening with preserved spectral properties. In International Conference on Artificial Intelligence and Statistics, pp. 4452\u20134462. PMLR"},{"key":"6837_CR19","doi-asserted-by":"crossref","unstructured":"Karata\u015f, A., \u015eahin, S. (2018). Application areas of community detection: A review. In 2018 International Congress on Big Data, Deep Learning and Fighting Cyber Terrorism (IBIGDELFT)","DOI":"10.1109\/IBIGDELFT.2018.8625349"},{"key":"6837_CR20","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V. (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing20(1)","DOI":"10.1137\/S1064827595287997"},{"key":"6837_CR21","unstructured":"Lasalle, E., Vaudaine, R., Vayer, T. PASCO. https:\/\/hal.science\/hal-05086352"},{"key":"6837_CR22","doi-asserted-by":"crossref","unstructured":"Li, Y., Nie, F., Huang, H., Huang, J. (2015). Large-scale multi-view spectral clustering via bipartite graph. In AAAI","DOI":"10.1609\/aaai.v29i1.9598"},{"key":"6837_CR23","doi-asserted-by":"crossref","unstructured":"Li, J., Seo, B., Lin, L. (2019). Optimal transport, mean partition, and uncertainty assessment in cluster analysis. Statistical Analysis and Data Mining: The ASA Data Science Journal12(5)","DOI":"10.1002\/sam.11418"},{"key":"6837_CR24","doi-asserted-by":"crossref","unstructured":"Liu, D. C., Nocedal, J. (1989). On the limited memory bfgs method for large scale optimization. Mathematical Programming45(1)","DOI":"10.1007\/BF01589116"},{"key":"6837_CR25","unstructured":"Loukas, A. (2019). Graph reduction with spectral and cut guarantees. Journal of Machine Learning Research20(116)"},{"key":"6837_CR26","unstructured":"Loukas, A., Vandergheynst, P. (2018). Spectrally approximating large graphs with smaller graphs. In ICML"},{"key":"6837_CR27","doi-asserted-by":"crossref","unstructured":"Newman, M. E. J. (2010). Networks: An introduction","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"6837_CR28","doi-asserted-by":"crossref","unstructured":"Newman, M. E., Girvan, M. (2004). Finding and evaluating community structure in networks. Physical review E69","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"6837_CR29","doi-asserted-by":"crossref","unstructured":"Peixoto, T. P. (2014). Efficient monte carlo and greedy heuristic for the inference of stochastic block models. Physical Review E89(1)","DOI":"10.1103\/PhysRevE.89.012804"},{"key":"6837_CR30","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M., et al. (2019). Computational optimal transport: With applications to data science. Foundations and Trends\u00ae in Machine Learning11(5-6)","DOI":"10.1561\/2200000073"},{"key":"6837_CR31","doi-asserted-by":"crossref","unstructured":"Pourkamali-Anaraki, F. (2020). Scalable spectral clustering with nystr\u00f6m approximation: Practical and theoretical aspects. IEEE Open Journal of Signal Processing1","DOI":"10.1109\/OJSP.2020.3039330"},{"issue":"235","key":"6837_CR32","first-page":"3","volume":"2013","author":"E Quemener","year":"2013","unstructured":"Quemener, E., & Corvellec, M. (2013). Sidus-the solution for extreme deduplication of an operating system. Linux Journal, 2013(235), 3.","journal-title":"Linux Journal"},{"key":"6837_CR33","doi-asserted-by":"crossref","unstructured":"Rissanen, J. (2007). Information and complexity in statistical modeling","DOI":"10.1007\/978-0-387-68812-1"},{"key":"6837_CR34","doi-asserted-by":"crossref","unstructured":"Rossi, R. A., Ahmed, N. K. (2015). The network data repository with interactive graph analytics and visualization. AAAI","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"6837_CR35","doi-asserted-by":"crossref","unstructured":"Rosvall, M., Bergstrom, C. T. (2011). Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLOS ONE6","DOI":"10.1371\/journal.pone.0018209"},{"key":"6837_CR36","first-page":"2","volume":"16","author":"R Rotta","year":"2011","unstructured":"Rotta, R., & Noack, A. (2011). Multilevel local search algorithms for modularity clustering. Journal of Experimental Algorithmics (JEA), 16, 2\u20131.","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"6837_CR37","doi-asserted-by":"crossref","unstructured":"Spielman, D. A., Srivastava, N. (2008). Graph sparsification by effective resistances. In Proceedings of the fortieth annual ACM symposium on theory of computing","DOI":"10.1145\/1374376.1374456"},{"key":"6837_CR38","doi-asserted-by":"crossref","unstructured":"Spielman, D. A., Teng, S.-H. (2011). Spectral sparsification of graphs. SIAM Journal on Computing40(4)","DOI":"10.1137\/08074489X"},{"key":"6837_CR39","doi-asserted-by":"crossref","unstructured":"Traag, V. A., Waltman, L., Van\u00a0Eck, N. J. (2019). From louvain to leiden: guaranteeing well-connected communities. Scientific Reports9(1)","DOI":"10.1038\/s41598-019-41695-z"},{"key":"6837_CR40","doi-asserted-by":"crossref","unstructured":"Tremblay, N., Loukas, A. (2020). Approximating spectral clustering via sampling: A review. Sampling techniques for supervised or unsupervised tasks","DOI":"10.1007\/978-3-030-29349-9_5"},{"key":"6837_CR41","unstructured":"Tremblay, N., Puy, G., Gribonval, R., Vandergheynst, P. (2016). Compressive spectral clustering. ICML"},{"key":"6837_CR42","doi-asserted-by":"crossref","unstructured":"Vinh, N. X., Epps, J., Bailey, J. (2009). Information theoretic measures for clusterings comparison: Is a correction for chance necessary? In ICML","DOI":"10.1145\/1553374.1553511"},{"key":"6837_CR43","doi-asserted-by":"crossref","unstructured":"Von\u00a0Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing17","DOI":"10.1007\/s11222-007-9033-z"},{"key":"6837_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2013-40829-0","volume":"86","author":"L Waltman","year":"2013","unstructured":"Waltman, L., & Van Eck, N. J. (2013). A smart local moving algorithm for large-scale modularity-based community detection. The European Physical Journal B, 86, 1\u201314.","journal-title":"The European Physical Journal B"},{"key":"6837_CR45","doi-asserted-by":"crossref","unstructured":"Wu, J., Liu, H., Xiong, H., Cao, J., Chen, J. (2014). K-means-based consensus clustering: A unified view.IEEE Transactions on Knowledge and Data Engineering27(1)","DOI":"10.1109\/TKDE.2014.2316512"},{"key":"6837_CR46","doi-asserted-by":"crossref","unstructured":"Yan, D., Huang, L., Jordan, M. I. (2009). Fast approximate spectral clustering. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1557019.1557118"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06837-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06837-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06837-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T20:56:16Z","timestamp":1759870576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06837-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":46,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["6837"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06837-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"11 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"212"}}