{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:10Z","timestamp":1777965730741,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031434112","type":"print"},{"value":"9783031434129","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43412-9_42","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:28:38Z","timestamp":1694896118000},"page":"711-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["cuSLINK: Single-Linkage Agglomerative Clustering on\u00a0the\u00a0GPU"],"prefix":"10.1007","author":[{"given":"Corey J.","family":"Nolet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divye","family":"Gala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Fender","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Doijade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Eaton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Raff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Zedlewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brad","family":"Rees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Oates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Anibal, J., et al.: HAL-X: scalable hierarchical clustering for rapid and tunable single-cell analysis. PLoS Comput. Biol. 18(10), e1010349 (2022)","DOI":"10.1371\/journal.pcbi.1010349"},{"key":"42_CR2","doi-asserted-by":"publisher","unstructured":"Arefin, A.S., Riveros, C., Berretta, R., Moscato, P.: kNN-Bor\u016fvka-GPU: a fast and scalable MST construction from kNN graphs on GPU. In: Murgante, B., et al. (eds.) ICCSA 2012. LNCS, vol. 7333, pp. 71\u201386. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31125-3_6. http:\/\/www.newcastle.edu.au\/research-centre\/cibm\/","DOI":"10.1007\/978-3-642-31125-3_6"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Arefin, A.S., Riveros, C., Berretta, R., Moscato, P.: KNN-MST-agglomerative: a fast and scalable graph-based data clustering approach on GPU. In: 2012 7th International Conference on Computer Science & Education (ICCSE), pp. 585\u2013590. IEEE (2012)","DOI":"10.1109\/ICCSE.2012.6295143"},{"issue":"2","key":"42_CR4","first-page":"208","volume":"7","author":"D Bakunas-Milanowski","year":"2017","unstructured":"Bakunas-Milanowski, D., Rego, V., Sang, J., Chansu, Y.: Efficient algorithms for stream compaction on GPUS. Int. J. Netw. Comput. 7(2), 208\u2013226 (2017)","journal-title":"Int. J. Netw. Comput."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Cayton, L.: Accelerating nearest neighbor search on manycore systems. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp. 402\u2013413. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.45"},{"key":"42_CR6","doi-asserted-by":"publisher","unstructured":"Chan, D.M., Rao, R., Huang, F., Canny, J.F.: T-SNE-CUDA: GPU-accelerated t-SNE and its applications to modern data. In: 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp. 330\u2013338 (2018). https:\/\/doi.org\/10.1109\/CAHPC.2018.8645912","DOI":"10.1109\/CAHPC.2018.8645912"},{"key":"42_CR7","unstructured":"Chang, D.J., Kantardzic, M.M., Ouyang, M.: Hierarchical clustering with CUDA\/GPU. In: ISCA PDCCS, pp. 7\u201312. Citeseer (2009)"},{"key":"42_CR8","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 226\u2013232 (1983). https:\/\/doi.org\/10.1109\/SFCS.1983.16","DOI":"10.1109\/SFCS.1983.16"},{"key":"42_CR9","doi-asserted-by":"publisher","unstructured":"Da Silva Sousa, C., Mariano, A., Proen\u00e7a, A.: A generic and highly efficient parallel variant of Bor\u00e5vka\u2019s algorithm. In: Proceedings - 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2015, pp. 610\u2013617 (2015). https:\/\/doi.org\/10.1109\/PDP.2015.72. http:\/\/cudpp.github.io\/https:\/\/www.semanticscholar.org\/paper\/A-Generic-and-Highly-Efficient-Parallel-Variant-of-Sousa-Mariano\/e9106835936711b416189cd5917dd61704510ee4","DOI":"10.1109\/PDP.2015.72"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.datak.2006.07.004","volume":"61","author":"M Dash","year":"2007","unstructured":"Dash, M., Petrutiu, S., Scheuermann, P.: pPOP: fast yet accurate parallel hierarchical clustering using partitioning. Data Knowl. Eng. 61(3), 563\u2013578 (2007)","journal-title":"Data Knowl. Eng."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Gasperini, M., et al.: A genome-wide framework for mapping gene regulation via cellular genetic screens. Cell 176(1\u20132), 377\u2013390 (2019)","DOI":"10.1016\/j.cell.2018.11.029"},{"key":"42_CR12","unstructured":"Harish, P., Vineet, V., Narayanan, P.J.: Large graph algorithms for massively multithreaded architectures. Iiit\/Tr(74), 1\u201320 (2009). 10.1.1.417.2999"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Hendrix, W., Palsetia, D., Patwary, M.M.A., Agrawal, A., Liao, W.K., Choudhary, A.: A scalable algorithm for single-linkage hierarchical clustering on distributed-memory architectures. In: 2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), pp. 7\u201313. IEEE (2013)","DOI":"10.1109\/LDAV.2013.6675153"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Hendrix, W., Patwary, M.M.A., Agrawal, A., Liao, W.K., Choudhary, A.: Parallel hierarchical clustering on shared memory platforms. In: 2012 19th International Conference on High Performance Computing, pp. 1\u20139. IEEE (2012)","DOI":"10.1109\/HiPC.2012.6507511"},{"issue":"1","key":"42_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"42_CR16","doi-asserted-by":"publisher","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUS (2017). https:\/\/doi.org\/10.48550\/ARXIV.1702.08734. https:\/\/arxiv.org\/abs\/1702.08734","DOI":"10.48550\/ARXIV.1702.08734"},{"key":"42_CR17","doi-asserted-by":"publisher","unstructured":"McInnes, L., Healy, J.: Accelerated hierarchical density based clustering. In: IEEE International Conference on Data Mining Workshops, ICDMW 2017-November, pp. 33\u201342 (2017). https:\/\/doi.org\/10.1109\/ICDMW.2017.12","DOI":"10.1109\/ICDMW.2017.12"},{"issue":"5","key":"42_CR18","doi-asserted-by":"publisher","first-page":"S602","DOI":"10.1137\/140980260","volume":"37","author":"M Naumov","year":"2015","unstructured":"Naumov, M., et al.: AMGX: a library for GPU accelerated algebraic multigrid and preconditioned iterative methods. SIAM J. Sci. Comput. 37(5), S602\u2013S626 (2015). https:\/\/doi.org\/10.1137\/140980260","journal-title":"SIAM J. Sci. Comput."},{"key":"42_CR19","doi-asserted-by":"publisher","unstructured":"Nolet, C.J., et al.: Bringing UMAP closer to the speed of light with GPU acceleration (2020). https:\/\/doi.org\/10.48550\/ARXIV.2008.00325. https:\/\/arxiv.org\/abs\/2008.00325","DOI":"10.48550\/ARXIV.2008.00325"},{"issue":"8","key":"42_CR20","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"CF Olson","year":"1995","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. 21(8), 1313\u20131325 (1995)","journal-title":"Parallel Comput."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Pan, J., Manocha, D.: Fast GPU-based locality sensitive hashing for K-nearest neighbor computation. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 211\u2013220 (2011)","DOI":"10.1145\/2093973.2094002"},{"issue":"23","key":"42_CR22","first-page":"1","volume":"18","author":"E Raff","year":"2017","unstructured":"Raff, E.: JSAT: Java statistical analysis tool, a library for machine learning. J. Mach. Learn. Res. 18(23), 1\u20135 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"42_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","volume":"31","author":"J Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, J., Samet, H., Varshney, A.: A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput. Graph. 31(2), 157\u2013174 (2007)","journal-title":"Comput. Graph."},{"key":"42_CR24","doi-asserted-by":"publisher","unstructured":"Shalom, S.A.A., Dash, M., Tue, M.: An approach for fast hierarchical agglomerative clustering using graphics processors with CUDA. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS (LNAI), vol. 6119, pp. 35\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13672-6_4. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-13672-6_4","DOI":"10.1007\/978-3-642-13672-6_4"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Shalom, S.A., Dash, M.: Efficient hierarchical agglomerative clustering algorithms on GPU using data partitioning. In: 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 134\u2013139. IEEE (2011)","DOI":"10.1109\/PDCAT.2011.38"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Shalom, S.A., Dash, M., Tue, M., Wilson, N.: Hierarchical agglomerative clustering using graphics processor with compute unified device architecture. In: 2009 International Conference on Signal Processing Systems, pp. 556\u2013561. IEEE (2009)","DOI":"10.1109\/ICSPS.2009.167"},{"key":"42_CR27","doi-asserted-by":"publisher","unstructured":"Sibson, R.: SLINK: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973). https:\/\/doi.org\/10.1093\/comjnl\/16.1.30","DOI":"10.1093\/comjnl\/16.1.30"},{"issue":"2","key":"42_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM (JACM) 22(2), 215\u2013225 (1975)","journal-title":"J. ACM (JACM)"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Vineet, V., Harish, P., Patidar, S., Narayanan, P.J.: Fast minimum spanning tree for large graphs on the GPU. In: Proceedings of the SIGGRAPH\/Eurographics Workshop on Graphics Hardware, pp. 167\u2013172 (2009). https:\/\/cvit.iiit.ac.in\/resources","DOI":"10.1145\/1572769.1572796"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Yengo, L., et al.: A saturated map of common genetic variants associated with human height. Nature 610(7933), 704\u2013712 (2022)","DOI":"10.1038\/s41586-022-05275-y"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43412-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:35:37Z","timestamp":1694896537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43412-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434112","9783031434129"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43412-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}