{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:40:10Z","timestamp":1744051210897,"version":"3.40.3"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>We introduce the ParClusterers Benchmark Suite (PCBS)---a collection of highly scalable parallel graph clustering algorithms and benchmarking tools that streamline comparing different graph clustering algorithms and implementations. The benchmark includes clustering algorithms that target a wide range of modern clustering use cases, including community detection, classification, and dense subgraph mining. The benchmark toolkit makes it easy to run and evaluate multiple instances of different clustering algorithms with respect to both the running time and quality.<\/jats:p>\n          <jats:p>We evaluate the PCBS algorithms empirically and find that they deliver both the state of the art quality and the running time. In terms of the running time, they are on average over 4x faster than the fastest library we compared to. In terms of quality, the correlation clustering algorithm [Shi et al., VLDB'21] optimizing for the LambdaCC objective, which does not have a direct counterpart in other libraries, delivers the highest quality in the majority of datasets that we used.<\/jats:p>","DOI":"10.14778\/3712221.3712246","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:03:04Z","timestamp":1744048984000},"page":"836-849","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering"],"prefix":"10.14778","volume":"18","author":[{"given":"Shangdi","family":"Yu","sequence":"first","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"Shi","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamison","family":"Meindl","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eisenstat","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoen","family":"Ju","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasan","family":"Tavakkol","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"UMD"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"\u0141\u0105cki","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,4,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"[n.d.]. Amazon Neptune. https:\/\/aws.amazon.com\/neptune\/."},{"key":"e_1_2_1_2_1","unstructured":"[n.d.]. ArangoDB. https:\/\/www.arangodb.com\/."},{"key":"e_1_2_1_3_1","unstructured":"[n.d.]. Memgraph. https:\/\/memgraph.com\/."},{"key":"e_1_2_1_4_1","unstructured":"[n.d.]. NebulaGraph. https:\/\/nebula-graph.io\/."},{"key":"e_1_2_1_5_1","unstructured":"[n.d.]. Neo4j. https:\/\/neo4j.com\/."},{"key":"e_1_2_1_6_1","unstructured":"[n.d.]. OrientDB. https:\/\/orientdb.com\/."},{"key":"e_1_2_1_7_1","unstructured":"[n.d.]. textembedding-gecko@003 model. https:\/\/cloud.google.com\/vertex-ai\/generative-ai\/docs\/embeddings\/get-text-embeddings."},{"key":"e_1_2_1_8_1","unstructured":"[n.d.]. TigerGraph. https:\/\/www.tigergraph.com\/."},{"key":"e_1_2_1_9_1","unstructured":"Arthur Asuncion and David Newman. 2007. UCI machine learning repository."},{"key":"e_1_2_1_10_1","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"Bader David A.","unstructured":"David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, and Dorothea Wagner. 2014. Benchmarking for Graph Clustering and Partitioning. In Encyclopedia of Social Network Analysis and Mining. Springer, 73--82."},{"key":"e_1_2_1_11_1","volume-title":"Correlation clustering. Machine learning 56","author":"Bansal Nikhil","year":"2004","unstructured":"Nikhil Bansal, Avrim Blum, and Shuchi Chawla. 2004. Correlation clustering. Machine learning 56 (2004), 89--113."},{"key":"e_1_2_1_12_1","volume-title":"Affinity clustering: Hierarchical clustering at scale. Advances in Neural Information Processing Systems 30","author":"Bateni MohammadHossein","year":"2017","unstructured":"MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni. 2017. Affinity clustering: Hierarchical clustering at scale. Advances in Neural Information Processing Systems 30 (2017)."},{"key":"e_1_2_1_13_1","volume-title":"Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017","author":"Besta Maciej","year":"2019","unstructured":"Maciej Besta, Emanuel Peter, Robert Gerstenberger, Marc Fischer, Micha\u0142 Podstawski, Claude Barthels, Gustavo Alonso, and Torsten Hoefler. 2019. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017 (2019)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476252"},{"key":"e_1_2_1_15_1","unstructured":"K. Bhatia K. Dahiya H. Jain P. Kar A. Mittal Y. Prabhu and M. Varma. 2016. The extreme classification repository: Multi-label datasets and code. http:\/\/manikvarma.org\/downloads\/XC\/XMLRepository.html"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10115-012-0606-6","article-title":"Beyond one billion time series: indexing and mining very large time series collections iSAX2+","volume":"39","author":"Camerra Alessandro","year":"2014","unstructured":"Alessandro Camerra, Jin Shieh, Themis Palpanas, Thanawin Rakthanmanon, and Eamonn Keogh. 2014. Beyond one billion time series: indexing and mining very large time series collections iSAX2+. Knowledge and Information Systems 39, 1 (2014), 123--151.","journal-title":"Knowledge and Information Systems"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-022-00491-w"},{"key":"e_1_2_1_20_1","volume-title":"R-MAT: A Recursive Model for Graph Mining. In SIAM International Conference on Data Mining (SDM). 442--446","author":"Chakrabarti Deepayan","year":"2004","unstructured":"Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. In SIAM International Conference on Data Mining (SDM). 442--446."},{"key":"e_1_2_1_21_1","volume-title":"Parallel spectral clustering in distributed systems","author":"Chen Wen-Yen","year":"2010","unstructured":"Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen Lin, and Edward Y Chang. 2010. Parallel spectral clustering in distributed systems. IEEE transactions on pattern analysis and machine intelligence 33, 3 (2010), 568--586."},{"key":"e_1_2_1_22_1","volume-title":"Mark EJ Newman, and Cristopher Moore","author":"Clauset Aaron","year":"2004","unstructured":"Aaron Clauset, Mark EJ Newman, and Cristopher Moore. 2004. Finding community structure in very large networks. Physical review E 70, 6 (2004), 066111."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures (SPAA).","author":"Dhulipala Laxman","year":"2017","unstructured":"Laxman Dhulipala, Guy Blelloch, and Julian Shun. 2017. Julienne: A Framework for Parallel Graph Algorithms Using Work-efficient Bucketing. In Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures (SPAA)."},{"key":"e_1_2_1_25_1","volume-title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).","author":"Dhulipala Laxman","year":"2018","unstructured":"Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)."},{"key":"e_1_2_1_26_1","volume-title":"International conference on machine learning. PMLR, 2676--2686","author":"Dhulipala Laxman","year":"2021","unstructured":"Laxman Dhulipala, David Eisenstat, Jakub \u0141\u0105cki, Vahab Mirrokni, and Jessica Shi. 2021. Hierarchical agglomerative graph clustering in nearly-linear time. In International conference on machine learning. PMLR, 2676--2686."},{"key":"e_1_2_1_27_1","first-page":"22925","article-title":"Hierarchical agglomerative graph clustering in poly-logarithmic depth","volume":"35","author":"Dhulipala Laxman","year":"2022","unstructured":"Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, and Jessica Shi. 2022. Hierarchical agglomerative graph clustering in poly-logarithmic depth. Advances in Neural Information Processing Systems 35 (2022), 22925--22940.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_28_1","volume-title":"Connectit: A framework for static and incremental parallel graph connectivity algorithms. arXiv preprint arXiv:2008.03909","author":"Dhulipala Laxman","year":"2020","unstructured":"Laxman Dhulipala, Changwan Hong, and Julian Shun. 2020. Connectit: A framework for static and incremental parallel graph connectivity algorithms. arXiv preprint arXiv:2008.03909 (2020)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617341"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"D. Dominguez-Sal P. Urb\u00f3n-Bayes A. Gim\u00e9nez-Va\u00f1\u00f3 S. G\u00f3mez-Villamor N. Mart\u00ednez-Baz\u00e1n and J. L. Larriba-Pey. 2010. Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmark. In Web-Age Information Management Heng Tao Shen Jian Pei M. Tamer \u00d6zsu Lei Zou Jiaheng Lu Tok-Wang Ling Ge Yu Yi Zhuang and Jie Shao (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 37--48.","DOI":"10.1007\/978-3-642-16720-1_4"},{"key":"e_1_2_1_31_1","volume-title":"The faiss library. arXiv preprint arXiv:2401.08281","author":"Douze Matthijs","year":"2024","unstructured":"Matthijs Douze, Alexandr Guzhva, Chengqi Deng, Jeff Johnson, Gergely Szilvasy, Pierre-Emmanuel Mazar\u00e9, Maria Lomeli, Lucas Hosseini, and Herv\u00e9 J\u00e9gou. 2024. The faiss library. arXiv preprint arXiv:2401.08281 (2024)."},{"key":"e_1_2_1_32_1","volume-title":"Mauricio GC Resende, and Celso C Ribeiro","author":"Festa Paola","year":"2002","unstructured":"Paola Festa, Panos M Pardalos, Mauricio GC Resende, and Celso C Ribeiro. 2002. Randomized heuristics for the MAX-CUT problem. Optimization methods and software 17, 6 (2002), 1033--1058."},{"key":"e_1_2_1_33_1","volume-title":"Community detection in graphs. Physics reports 486, 3-5","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato. 2010. Community detection in graphs. Physics reports 486, 3-5 (2010), 75--174."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_35_1","volume-title":"Sparse Matrices and their Applications","author":"Gustavson Fred G","unstructured":"Fred G Gustavson. 1972. Some basic techniques for solving sparse systems of linear equations. In Sparse Matrices and their Applications. Springer, 41--52."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933108"},{"key":"e_1_2_1_39_1","volume-title":"GraB: Graph Benchmark for Heterogeneous Graph Clustering. In The First Learning on Graphs Conference.","author":"St\u00e6r Knudsen Malik Sebastian","year":"2022","unstructured":"Malik Sebastian St\u00e6r Knudsen, Laurits Almskou Brodal, Peter Kristoffer Peczalski, Atefeh Moradan, Davide Mottin, and Ira Assent. 2022. GraB: Graph Benchmark for Heterogeneous Graph Clustering. In The First Learning on Graphs Conference."},{"key":"e_1_2_1_40_1","volume-title":"Detecting the overlapping and hierarchical community structure in complex networks. New journal of physics 11, 3","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti, Santo Fortunato, and J\u00e1nos Kert\u00e9sz. 2009. Detecting the overlapping and hierarchical community structure in complex networks. New journal of physics 11, 3 (2009), 033015."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.066107"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the ECML\/PKDD Graph Embedding and Mining Workshop. 1--5.","author":"Maekawa Seiji","year":"2019","unstructured":"Seiji Maekawa, Jianpeng Zhang, George Fletcher, and Makoto Onizuka. 2019. General generator for attributed graphs with community structure. In Proceedings of the ECML\/PKDD Graph Embedding and Mining Workshop. 1--5."},{"key":"e_1_2_1_44_1","volume-title":"Introduction to Information Retrieval","author":"Manning Christopher D","unstructured":"Christopher D Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press."},{"key":"e_1_2_1_45_1","volume-title":"Normalized mutual information to evaluate overlapping community finding algorithms. arXiv preprint arXiv:1110.2515","author":"McDaid Aaron F","year":"2011","unstructured":"Aaron F McDaid, Derek Greene, and Neil Hurley. 2011. Normalized mutual information to evaluate overlapping community finding algorithms. arXiv preprint arXiv:1110.2515 (2011)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486180"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467404"},{"key":"e_1_2_1_48_1","volume-title":"Finding and evaluating community structure in networks. Physical review E 69, 2","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E 69, 2 (2004), 026113."},{"key":"e_1_2_1_49_1","volume-title":"On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14","author":"Ng Andrew","year":"2001","unstructured":"Andrew Ng, Michael Jordan, and Yair Weiss. 2001. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14 (2001)."},{"key":"e_1_2_1_50_1","volume-title":"Digital Information and Communication Technology and Its Applications: International Conference, DICTAP 2011, Dijon, France, June 21-23, 2011, Proceedings, Part II. Springer, 265--279","author":"Orman G\u00fcnce Keziban","year":"2011","unstructured":"G\u00fcnce Keziban Orman, Vincent Labatut, and Hocine Cherifi. 2011. Qualitative comparison of community detection algorithms. In Digital Information and Communication Technology and Its Applications: International Conference, DICTAP 2011, Dijon, France, June 21-23, 2011, Proceedings, Part II. Springer, 265--279."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08001"},{"key":"e_1_2_1_52_1","volume-title":"Identifying Well-Connected Communities in Real-World and Synthetic Networks. In International Conference on Complex Networks and Their Applications. Springer, 3--14","author":"Park Minhyuk","year":"2023","unstructured":"Minhyuk Park, Yasamin Tabatabaee, Vikram Ramavarapu, Baqiao Liu, Vidya Kamath Pailodi, Rajiv Ramachandran, Dmitriy Korobskiy, Fabio Ayres, George Chacko, and Tandy Warnow. 2023. Identifying Well-Connected Communities in Real-World and Synthetic Networks. In International Conference on Complex Networks and Their Applications. Springer, 3--14."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--12","author":"Ali Patwary Md Mostofa","year":"2015","unstructured":"Md Mostofa Ali Patwary, Suren Byna, Nadathur Rajagopalan Satish, Narayanan Sundaram, Zarija Luki\u0107, Vadim Roytershteyn, Michael J Anderson, Yushu Yao, Pradeep Dubey, et al. 2015. BD-CATS: big data clustering at trillion particle scale. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--12."},{"key":"e_1_2_1_54_1","volume-title":"Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76, 3","author":"Raghavan Usha Nandini","year":"2007","unstructured":"Usha Nandini Raghavan, R\u00e9ka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical review E 76, 3 (2007), 036106."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"e_1_2_1_56_1","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI). 455--468","author":"Shalita Alon","year":"2016","unstructured":"Alon Shalita, Brian Karrer, Igor Kabiljo, Arun Sharma, Alessandro Presta, Aaron Adcock, Herald Kllapi, and Michael Stumm. 2016. Social hash: an assignment framework for optimizing distributed systems operations on social networks. In USENIX Symposium on Networked Systems Design and Implementation (NSDI). 455--468."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476282"},{"key":"e_1_2_1_58_1","volume-title":"Comparison and Benchmark of Graph Clustering Algorithms. arXiv preprint arXiv:2005.04806","author":"Shi Lizhen","year":"2020","unstructured":"Lizhen Shi and Bo Chen. 2020. Comparison and Benchmark of Graph Clustering Algorithms. arXiv preprint arXiv:2005.04806 (2020)."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.61"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2390633"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.20"},{"key":"e_1_2_1_62_1","volume-title":"From Louvain to","author":"Traag Vincent A","year":"2019","unstructured":"Vincent A Traag, Ludo Waltman, and Nees Jan Van Eck. 2019. From Louvain to Leiden: guaranteeing well-connected communities. Scientific reports 9, 1 (2019), 5233."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457278"},{"key":"e_1_2_1_64_1","volume-title":"Parallel Index-Based Structural Graph Clustering and Its Approximation. In International Conference on Management of Data. 1851--1864","author":"Tseng Tom","year":"2021","unstructured":"Tom Tseng, Laxman Dhulipala, and Julian Shun. 2021. Parallel Index-Based Structural Graph Clustering and Its Approximation. In International Conference on Management of Data. 1851--1864."},{"key":"e_1_2_1_65_1","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin Anton","year":"2023","unstructured":"Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2023. Graph clustering with graph neural networks. Journal of Machine Learning Research 24, 127 (2023), 1--21.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157795"},{"key":"e_1_2_1_69_1","volume-title":"Overlapping community detection in networks: The state-of-the-art and comparative study. Acm computing surveys (csur) 45, 4","author":"Xie Jierui","year":"2013","unstructured":"Jierui Xie, Stephen Kelley, and Boleslaw K Szymanski. 2013. Overlapping community detection in networks: The state-of-the-art and comparative study. Acm computing surveys (csur) 45, 4 (2013), 1--35."},{"key":"e_1_2_1_70_1","volume-title":"Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In 2011 ieee 11th international conference on data mining workshops","author":"Xie Jierui","year":"2011","unstructured":"Jierui Xie, Boleslaw K Szymanski, and Xiaoming Liu. 2011. Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In 2011 ieee 11th international conference on data mining workshops. IEEE, 344--349."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_2_1_73_1","volume-title":"A comparative analysis of community detection algorithms on artificial networks. Scientific reports 6, 1","author":"Yang Zhao","year":"2016","unstructured":"Zhao Yang, Ren\u00e9 Algesheimer, and Claudio J Tessone. 2016. A comparative analysis of community detection algorithms on artificial networks. Scientific reports 6, 1 (2016), 1--18."},{"key":"e_1_2_1_74_1","volume-title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search. arXiv preprint arXiv:2312.03940","author":"Yu Shangdi","year":"2023","unstructured":"Shangdi Yu, Joshua Engels, Yihao Huang, and Julian Shun. 2023. PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search. arXiv preprint arXiv:2312.03940 (2023)."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3712221.3712246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:25:04Z","timestamp":1744050304000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3712221.3712246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.14778\/3712221.3712246"],"URL":"https:\/\/doi.org\/10.14778\/3712221.3712246","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"2025-04-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}