{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:05Z","timestamp":1750306745166,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000105","name":"Office of Cyberinfrastructure","doi-asserted-by":"publisher","award":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"],"award-info":[{"award-number":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"],"award-info":[{"award-number":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0458"],"award-info":[{"award-number":["FA9550-12-1-0458"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-FG02-08ER25848, DE-SC0001283, DE-SC0005309, DESC0005340, DESC0 007456"],"award-info":[{"award-number":["DE-FG02-08ER25848, DE-SC0001283, DE-SC0005309, DESC0005340, DESC0 007456"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"],"award-info":[{"award-number":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"],"award-info":[{"award-number":["CCF-0833131, CNS-0830927, IIS-0905205, CCF-0938000, CCF-1029166, OCI-1144061"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,17]]},"DOI":"10.1145\/2503210.2503255","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T12:55:22Z","timestamp":1383137722000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Scalable parallel OPTICS data clustering using graph algorithmic techniques"],"prefix":"10.1145","author":[{"given":"Mostofa Ali","family":"Patwary","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana","family":"Palsetia","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-keng","family":"Liao","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[{"name":"University of Bergen, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Choudhary","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Parallel K-means data clustering 2005. http:\/\/users.eecs.northwestern.edu\/wkliao\/Kmeans\/.  Parallel K-means data clustering 2005. http:\/\/users.eecs.northwestern.edu\/wkliao\/Kmeans\/."},{"key":"e_1_3_2_1_2_1","unstructured":"CLUTO - clustering high-dimensional datasets 2006. http:\/\/glaros.dtc.umn.edu\/gkhome\/cluto\/cluto\/.  CLUTO - clustering high-dimensional datasets 2006. http:\/\/glaros.dtc.umn.edu\/gkhome\/cluto\/cluto\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Cliquemod 2009. http:\/\/www.cs.bris.ac.uk\/steve\/networks\/cliquemod\/.  Cliquemod 2009. http:\/\/www.cs.bris.ac.uk\/steve\/networks\/cliquemod\/."},{"key":"e_1_3_2_1_4_1","volume-title":"Quest synthetic data generator","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Quest synthetic data generator . IBM Almaden Research Center , 1994 . R. Agrawal and R. Srikant. Quest synthetic data generator. IBM Almaden Research Center, 1994."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646666.699596"},{"key":"e_1_3_2_1_7_1","volume-title":"A density-based spatial clustering of application with noise","author":"Backlund H.","year":"2011","unstructured":"H. Backlund , A. Hedblom , and N. Neijman . A density-based spatial clustering of application with noise . 2011 . http:\/\/staffwww.itn.liu.se\/aidvi\/courses\/06\/dm\/Seminars2011. H. Backlund, A. Hedblom, and N. Neijman. A density-based spatial clustering of application with noise. 2011. http:\/\/staffwww.itn.liu.se\/aidvi\/courses\/06\/dm\/Seminars2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98741"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2966.2007.11997.x"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2006.01.013"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2966.2006.10519.x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_22"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIME.2010.5477926"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.661036"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1207\/s15327906mbr2302_6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(02)00095-9"},{"key":"e_1_3_2_1_18_1","volume-title":"Introduction to algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen . Introduction to algorithms . The MIT press , 2001 . T. Cormen. Introduction to algorithms. The MIT press, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2966.2006.11287.x"},{"key":"e_1_3_2_1_20_1","first-page":"226","volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining","volume":"1996","author":"Ester M.","year":"1996","unstructured":"M. Ester , H. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining , volume 1996 , pages 226 -- 231 . AAAI Press , 1996 . M. Ester, H. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining, volume 1996, pages 226--231. AAAI Press, 1996."},{"issue":"3","key":"e_1_3_2_1_21_1","first-page":"37","article-title":"From data mining to knowledge discovery in databases","volume":"17","author":"Fayyad U.","year":"1996","unstructured":"U. Fayyad , G. Piatetsky-Shapiro , and P. Smyth . From data mining to knowledge discovery in databases . AI magazine , 17 ( 3 ): 37 , 1996 . U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. From data mining to knowledge discovery in databases. AI magazine, 17(3):37, 1996.","journal-title":"AI magazine"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aca.2004.02.064"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.301-303.1133"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/364099.364331"},{"key":"e_1_3_2_1_25_1","series-title":"Series C (Applied Statistics), 18(1):pp. 54--64","volume-title":"Minimum spanning trees and single linkage cluster analysis. Journal of the Royal Statistical Society","author":"Gower J. C.","year":"1969","unstructured":"J. C. Gower and G. J. S. Ross . Minimum spanning trees and single linkage cluster analysis. Journal of the Royal Statistical Society . Series C (Applied Statistics), 18(1):pp. 54--64 , 1969 . J. C. Gower and G. J. S. Ross. Minimum spanning trees and single linkage cluster analysis. Journal of the Royal Statistical Society. Series C (Applied Statistics), 18(1):pp. 54--64, 1969."},{"key":"e_1_3_2_1_26_1","volume-title":"Morgan Kaufmann","author":"Han J.","year":"2011","unstructured":"J. Han , M. Kamber , and J. Pei . Data mining: concepts and techniques . Morgan Kaufmann , 2011 . J. Han, M. Kamber, and J. Pei. Data mining: concepts and techniques. Morgan Kaufmann, 2011."},{"key":"e_1_3_2_1_27_1","volume-title":"Next generation of data mining","author":"Kargupta H.","year":"2009","unstructured":"H. Kargupta and J. Han . Next generation of data mining , volume 7 . Chapman & Hall\/CRC , 2009 . H. Kargupta and J. Han. Next generation of data mining, volume 7. Chapman & Hall\/CRC, 2009."},{"key":"e_1_3_2_1_28_1","volume-title":"KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space","author":"Kennel M. B.","year":"2004","unstructured":"M. B. Kennel . KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space , 2004 . Institute for Nonlinear Science , University of California. M. B. Kennel. KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space, 2004. Institute for Nonlinear Science, University of California."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.75"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.143"},{"key":"e_1_3_2_1_32_1","unstructured":"G. Lemson and the Virgo Consortium. Halo and galaxy formation histories from the millennium simulation: Public release of a VO-oriented and SQL-queryable database for studying the evolution of galaxies in the LambdaCDM cosmogony. Arxiv preprint astro-ph\/0608019 2006.  G. Lemson and the Virgo Consortium. Halo and galaxy formation histories from the millennium simulation: Public release of a VO-oriented and SQL-queryable database for studying the evolution of galaxies in the LambdaCDM cosmogony. Arxiv preprint astro-ph\/0608019 2006."},{"key":"e_1_3_2_1_33_1","first-page":"82","volume-title":"Proceedings of IPDPS","author":"Liu Y.","year":"2003","unstructured":"Y. Liu , W.-k. Liao , and A. Choudhary . Design and evaluation of a parallel HOP clustering algorithm for cosmological simulation . In Proceedings of IPDPS 2003 , page 82 .1, Washington, DC, USA, 2003. IEEE. Y. Liu, W.-k. Liao, and A. Choudhary. Design and evaluation of a parallel HOP clustering algorithm for cosmological simulation. In Proceedings of IPDPS 2003, page 82.1, Washington, DC, USA, 2003. IEEE."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1088\/0004-637X\/692\/1\/217"},{"key":"e_1_3_2_1_35_1","first-page":"281","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability","volume":"1","author":"J. MacQueen","year":"1967","unstructured":"J. MacQueen et al. Some methods for classification and analysis of multivariate observations . In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability , volume 1 , pages 281 -- 297 . USA, 1967 . J. MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pages 281--297. USA, 1967."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.2"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882792.1882815"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAPR.2009.50"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391258.2391260"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145842"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.79"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_35"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389081"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_47_1","first-page":"1","volume-title":"Proc. International Conference on High Performance Computing (HiPC)","author":"Setia R.","year":"2009","unstructured":"R. Setia , A. Nedunchezhian , and S. Balachandran . A new parallel algorithm for minimum spanning tree problem . In Proc. International Conference on High Performance Computing (HiPC) , pages 1 -- 5 , 2009 . R. Setia, A. Nedunchezhian, and S. Balachandran. A new parallel algorithm for minimum spanning tree problem. In Proc. International Conference on High Performance Computing (HiPC), pages 1--5, 2009."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050009"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03597"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081957"},{"key":"e_1_3_2_1_51_1","volume-title":"Journal of computer and system sciences, 18(2):110--127","author":"Tarjan R.","year":"1979","unstructured":"R. Tarjan . A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of computer and system sciences, 18(2):110--127 , 1979 . R. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of computer and system sciences, 18(2):110--127, 1979."},{"key":"e_1_3_2_1_52_1","first-page":"186","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"Wang W.","year":"1997","unstructured":"W. Wang , J. Yang , and R. Muntz . STING: A statistical information grid approach to spatial data mining . In Proceedings of the International Conference on Very Large Data Bases , pages 186 -- 195 . IEEE, 1997 . W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. In Proceedings of the International Conference on Very Large Data Bases, pages 186--195. IEEE, 1997."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009884809343"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233324"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02948834"}],"event":{"name":"SC13: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"],"location":"Denver Colorado","acronym":"SC13"},"container-title":["Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503210.2503255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:21Z","timestamp":1750231701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":55,"alternative-id":["10.1145\/2503210.2503255","10.1145\/2503210"],"URL":"https:\/\/doi.org\/10.1145\/2503210.2503255","relation":{},"subject":[],"published":{"date-parts":[[2013,11,17]]},"assertion":[{"value":"2013-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}