{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:56Z","timestamp":1773481856381,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CAREER Award","award":["#CCF-1845763"],"award-info":[{"award-number":["#CCF-1845763"]}]},{"name":"Applications Driving Architectures (ADA) Research Center, a JUMP Center co-sponsored by SRC and DARPA"},{"name":"DOE Early Career Award","award":["#DE-SC0018947"],"award-info":[{"award-number":["#DE-SC0018947"]}]},{"name":"Google Faculty Research Award"},{"name":"DARPA SDH Award","award":["#HR0011-18-3-0007"],"award-info":[{"award-number":["#HR0011-18-3-0007"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457296","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1982-1995","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering"],"prefix":"10.1145","author":[{"given":"Yiqiu","family":"Wang","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Shangdi","family":"Yu","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n.d.]. CHEM Dataset.https:\/\/archive.ics.uci.edu\/ml\/datasets\/Gas+sensor+array+under+dynamic+gas+mixtures.  [n.d.]. CHEM Dataset.https:\/\/archive.ics.uci.edu\/ml\/datasets\/Gas+sensor+array+under+dynamic+gas+mixtures."},{"key":"e_1_3_2_2_2_1","unstructured":"[n.d.]. GeoLife Dataset. https:\/\/www.microsoft.com\/en-us\/research\/publication\/geolife-gps-trajectory-dataset-user-guide\/.  [n.d.]. GeoLife Dataset. https:\/\/www.microsoft.com\/en-us\/research\/publication\/geolife-gps-trajectory-dataset-user-guide\/."},{"key":"e_1_3_2_2_3_1","unstructured":"[n.d.]. Household Dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/individual+household+electric+power+consumption.  [n.d.]. Household Dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/individual+household+electric+power+consumption."},{"key":"e_1_3_2_2_4_1","unstructured":"[n.d.]. HT Dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Gas+sensors+for+home+activity+monitoring.  [n.d.]. HT Dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Gas+sensors+for+home+activity+monitoring."},{"key":"e_1_3_2_2_5_1","unstructured":"[n.d.]. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml.  [n.d.]. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_2_2_6_1","volume-title":"Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry","author":"Agarwal Pankaj K.","year":"1991","unstructured":"Pankaj K. Agarwal , Herbert Edelsbrunner , Otfried Schwarzkopf , and Emo Welzl . 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry ( 1991 ), 407--422. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry (1991), 407--422."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_3_2_2_8_1","volume-title":"Mount","author":"Arya Sunil","year":"2016","unstructured":"Sunil Arya and David M . Mount . 2016 . A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. In ACM-SIAM Symposium on Discrete Algorithms. 1220--1233. Sunil Arya and David M. Mount. 2016. A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. In ACM-SIAM Symposium on Discrete Algorithms. 1220--1233."},{"key":"e_1_3_2_2_9_1","volume-title":"Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces","author":"Friedman Bentley","year":"1978","unstructured":"Bentley and Friedman . 1978. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces . IEEE Trans. Comput ., Vol. C-27 , 2 ( Feb 1978 ), 97--105. Bentley and Friedman. 1978. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. IEEE Trans. Comput., Vol. C-27, 2 (Feb 1978), 97--105."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366854"},{"key":"e_1_3_2_2_12_1","volume-title":"Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. In ACM-SIAM Symposium on Discrete Algorithms. 291--300","author":"Callahan Paul B.","unstructured":"Paul B. Callahan and S. Rao Kosaraju . 1993 . Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. In ACM-SIAM Symposium on Discrete Algorithms. 291--300 . Paul B. Callahan and S. Rao Kosaraju. 1993. Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. In ACM-SIAM Symposium on Discrete Algorithms. 291--300."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"e_1_3_2_2_14_1","first-page":"1","article-title":"Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data (TKDD)","volume":"5","author":"Campello Ricardo","year":"2015","unstructured":"Ricardo Campello , Davoud Moulavi , Arthur Zimek , and J\u00f6rg Sander . 2015 . Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data (TKDD) , Article 5 (2015), 5: 1 -- 5 :51 pages. Ricardo Campello, Davoud Moulavi, Arthur Zimek, and J\u00f6rg Sander. 2015. Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data (TKDD), Article 5 (2015), 5:1--5:51 pages.","journal-title":"Article"},{"key":"e_1_3_2_2_15_1","volume-title":"Geometric Minimum Spanning Trees with GeoFilterKruskal. In International Symposium on Experimental Algorithms (SEA)","volume":"6049","author":"Chatterjee Samidh","year":"2010","unstructured":"Samidh Chatterjee , Michael Connor , and Piyush Kumar . 2010 . Geometric Minimum Spanning Trees with GeoFilterKruskal. In International Symposium on Experimental Algorithms (SEA) , Vol. 6049 . 486--500. Samidh Chatterjee, Michael Connor, and Piyush Kumar. 2010. Geometric Minimum Spanning Trees with GeoFilterKruskal. In International Symposium on Experimental Algorithms (SEA), Vol. 6049. 486--500."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195905001683"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_2_18_1","volume-title":"Introduction to Algorithms (3. ed.)","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms (3. ed.) . MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3. ed.) .MIT Press."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195919400028"},{"key":"e_1_3_2_2_20_1","volume-title":"ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 226--231","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , and Xiaowei Xu . 1996 . A Density-based Algorithm for Discovering Clusters a Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise . In ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 226--231 . Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A Density-based Algorithm for Discovering Clusters a Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 226--231."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.snb.2015.03.028"},{"key":"e_1_3_2_2_22_1","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman Jerome H.","year":"1976","unstructured":"Jerome H. Friedman , Jon Louis Bentley , and Raphael Ari Finkel . 1976 . An algorithm for finding best matches in logarithmic expected time . ACM Trans. Math. Software , Vol. 3 , 3 (7 1976), 209--226. Jerome H. Friedman, Jon Louis Bentley, and Raphael Ari Finkel. 1976. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software, Vol. 3, 3 (7 1976), 209--226.","journal-title":"ACM Trans. Math. Software"},{"key":"e_1_3_2_2_23_1","volume-title":"ACM Symposium on Theory of Computing (STOC). 135--143","author":"Gabow Harold N.","unstructured":"Harold N. Gabow , Jon L. Bentley , and Robert E. Tarjan . 1984. Scaling and related techniques for geometry problems . In ACM Symposium on Theory of Computing (STOC). 135--143 . Harold N. Gabow, Jon L. Bentley, and Robert E. Tarjan. 1984. Scaling and related techniques for geometry problems. In ACM Symposium on Theory of Computing (STOC). 135--143."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3083897"},{"key":"e_1_3_2_2_25_1","volume-title":"Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space. In ACM SIGMOD International Conference on Management of Data. 1067--1082","author":"Gan Junhao","year":"2018","unstructured":"Junhao Gan and Yufei Tao . 2018 . Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space. In ACM SIGMOD International Conference on Management of Data. 1067--1082 . Junhao Gan and Yufei Tao. 2018. Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space. In ACM SIGMOD International Conference on Management of Data. 1067--1082."},{"key":"e_1_3_2_2_26_1","volume-title":"IEEE Symposium on Foundations of Computer Science (FOCS). 698--710","author":"Gil J.","unstructured":"J. Gil , Y. Matias , and U. Vishkin . 1991. Towards a theory of nearly constant time parallel algorithms . In IEEE Symposium on Foundations of Computer Science (FOCS). 698--710 . J. Gil, Y. Matias, and U. Vishkin. 1991. Towards a theory of nearly constant time parallel algorithms. In IEEE Symposium on Foundations of Computer Science (FOCS). 698--710."},{"key":"e_1_3_2_2_27_1","first-page":"1","article-title":"HPDBSCAN","volume":"2","author":"G\u00f6tz Markus","year":"2015","unstructured":"Markus G\u00f6tz , Christian Bodenstein , and Morris Riedel . 2015 . HPDBSCAN : Highly Parallel DBSCAN. In MLHPC. Article 2 , 2: 1 -- 2 :10 pages. Markus G\u00f6tz, Christian Bodenstein, and Morris Riedel. 2015. HPDBSCAN: Highly Parallel DBSCAN. In MLHPC. Article 2, 2:1--2:10 pages.","journal-title":"Highly Parallel DBSCAN. In MLHPC. Article"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346439"},{"key":"e_1_3_2_2_29_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34","author":"Gu Yan","unstructured":"Yan Gu , Julian Shun , Yihan Sun , and Guy E. Blelloch . 2015. A Top-Down Parallel Semisort . In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34 . Yan Gu, Julian Shun, Yihan Sun, and Guy E. Blelloch. 2015. A Top-Down Parallel Semisort. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34."},{"key":"e_1_3_2_2_30_1","volume-title":"A faster algorithm for DBSCAN. Master's thesis","author":"Gunawan Ade","unstructured":"Ade Gunawan . 2013. A faster algorithm for DBSCAN. Master's thesis , Eindhoven University of Technology . Ade Gunawan. 2013. A faster algorithm for DBSCAN. Master's thesis, Eindhoven University of Technology."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507511"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133112"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2016.07.004"},{"key":"e_1_3_2_2_34_1","volume-title":"Introduction to Parallel Algorithms","author":"Jaja Joseph","unstructured":"Joseph Jaja . 1992. Introduction to Parallel Algorithms . Addison-Wesley Professional . Joseph Jaja. 1992. Introduction to Parallel Algorithms .Addison-Wesley Professional."},{"key":"e_1_3_2_2_35_1","volume-title":"Karp and Vijaya Ramachandran","author":"Richard","year":"1990","unstructured":"Richard M. Karp and Vijaya Ramachandran . 1990 . Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science , Volume A: Algorithms and Complexity (A). MIT Press, 869-- 941 . Richard M. Karp and Vijaya Ramachandran. 1990. Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A). MIT Press, 869--941."},{"key":"e_1_3_2_2_36_1","volume-title":"The Cilk+ concurrency platform. J. Supercomputing","author":"Leiserson Charles E.","year":"2010","unstructured":"Charles E. Leiserson . 2010. The Cilk+ concurrency platform. J. Supercomputing , Vol. 51 , 3 ( 2010 ). Springer . Charles E. Leiserson. 2010. The Cilk+ concurrency platform. J. Supercomputing, Vol. 51, 3 (2010). Springer."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021932"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835882"},{"key":"e_1_3_2_2_39_1","volume-title":"Accelerated hierarchical density clustering. arXiv preprint arXiv:1705.07321","author":"McInnes Leland","year":"2017","unstructured":"Leland McInnes and John Healy . 2017. Accelerated hierarchical density clustering. arXiv preprint arXiv:1705.07321 ( 2017 ). Leland McInnes and John Healy. 2017. Accelerated hierarchical density clustering. arXiv preprint arXiv:1705.07321 (2017)."},{"key":"e_1_3_2_2_40_1","unstructured":"Daniel M\u00fcllner. 2011. Modern hierarchical agglomerative clustering algorithms. arxiv: 1109.2378 [stat.ML]  Daniel M\u00fcllner. 2011. Modern hierarchical agglomerative clustering algorithms. arxiv: 1109.2378 [stat.ML]"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/945394.945400"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00017-I"},{"key":"e_1_3_2_2_43_1","volume-title":"The Filter-Kruskal Minimum Spanning Tree Algorithm. In Workshop on Algorithm Engineering and Experiments (ALENEX). 52--61","author":"Osipov Vitaly","year":"2009","unstructured":"Vitaly Osipov , Peter Sanders , and Johannes Singler . 2009 . The Filter-Kruskal Minimum Spanning Tree Algorithm. In Workshop on Algorithm Engineering and Experiments (ALENEX). 52--61 . Vitaly Osipov, Peter Sanders, and Johannes Singler. 2009. The Filter-Kruskal Minimum Spanning Tree Algorithm. In Workshop on Algorithm Engineering and Experiments (ALENEX). 52--61."},{"key":"e_1_3_2_2_44_1","volume-title":"International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--11","author":"Patwary M.","unstructured":"M. Patwary , D. Palsetia , A. Agrawal , W. K. Liao , F. Manne , and A. Choudhary . 2012. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure . In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--11 . M. Patwary, D. Palsetia, A. Agrawal, W. K. Liao, F. Manne, and A. Choudhary. 2012. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--11."},{"key":"e_1_3_2_2_45_1","volume-title":"International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--12","author":"Patwary M.","unstructured":"M. Patwary , D. Palsetia , A. Agrawal , W. K. Liao , F. Manne , and A. Choudhary . 2013. Scalable parallel OPTICS data clustering using graph algorithmic techniques . In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--12 . M. Patwary, D. Palsetia, A. Agrawal, W. K. Liao, F. Manne, and A. Choudhary. 2013. Scalable parallel OPTICS data clustering using graph algorithmic techniques. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1--12."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36175-8_8"},{"key":"e_1_3_2_2_47_1","unstructured":"J. Santos T. Syed M. Coelho Naldi R. J. G. B. Campello and J. Sander. 2019. Hierarchical Density-Based Clustering using MapReduce. IEEE Transactions on Big Data (2019) 1--1.  J. Santos T. Syed M. Coelho Naldi R. J. G. B. Campello and J. Sander. 2019. Hierarchical Density-Based Clustering using MapReduce. IEEE Transactions on Big Data (2019) 1--1."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos and Hoey Dan. 1975. Closest-point problems. (1975) 151--162.  Michael Ian Shamos and Hoey Dan. 1975. Closest-point problems. (1975) 151--162.","DOI":"10.1055\/s-1975-23689"},{"key":"e_1_3_2_2_49_1","article-title":"A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction","volume":"1","author":"Shun J.","year":"2014","unstructured":"J. Shun and G. E. Blelloch . 2014 . A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction . ACM Transactions on Parallel Computing (TOPC) , Vol. 1 , 1, Article 8 (Oct. 2014), 8:1--8:20 pages. J. Shun and G. E. Blelloch. 2014. A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction. ACM Transactions on Parallel Computing (TOPC), Vol. 1, 1, Article 8 (Oct. 2014), 8:1--8:20 pages.","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"e_1_3_2_2_50_1","volume-title":"Reducing Contention Through Priority Updates. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 152--163","author":"Shun Julian","unstructured":"Julian Shun , Guy E. Blelloch , Jeremy T. Fineman , and Phillip B. Gibbons . 2013 . Reducing Contention Through Priority Updates. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 152--163 . Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons. 2013. Reducing Contention Through Priority Updates. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 152--163."},{"key":"e_1_3_2_2_51_1","volume-title":"RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning. In ACM SIGMOD International Conference on Management of Data. 1173--1187","author":"Song Hwanjun","unstructured":"Hwanjun Song and J. Lee . 2018 . RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning. In ACM SIGMOD International Conference on Management of Data. 1173--1187 . Hwanjun Song and J. Lee. 2018. RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning. In ACM SIGMOD International Conference on Management of Data. 1173--1187."},{"key":"e_1_3_2_2_52_1","volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","unstructured":"Vijay V. Vazirani . 2010. Approximation Algorithms . Springer Publishing Company, Inc orporated. Vijay V. Vazirani. 2010. Approximation Algorithms .Springer Publishing Company, Incorporated."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020381720601"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380582"},{"key":"e_1_3_2_2_55_1","volume-title":"Genome Informatics","volume":"12","author":"Xu Ying","year":"2001","unstructured":"Ying Xu , Victor Olman , and Dong Xu . 2001 . Minimum Spanning Trees for Gene Expression Data Clustering . Genome Informatics , Vol. 12 (02 2001), 24--33. Ying Xu, Victor Olman, and Dong Xu. 2001. Minimum Spanning Trees for Gene Expression Data Clustering. Genome Informatics, Vol. 12 (02 2001), 24--33."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4908014"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367532"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":58,"alternative-id":["10.1145\/3448016.3457296","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457296","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}