{"id":"https://openalex.org/W4384661698","doi":"https://doi.org/10.1145/3597635.3598021","title":"Faster Parallel Exact Density Peaks Clustering (Abstract)","display_name":"Faster Parallel Exact Density Peaks Clustering (Abstract)","publication_year":2023,"publication_date":"2023-07-18","ids":{"openalex":"https://openalex.org/W4384661698","doi":"https://doi.org/10.1145/3597635.3598021"},"language":"en","primary_location":{"id":"doi:10.1145/3597635.3598021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598021","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598021","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102907689","display_name":"Yihao Huang","orcid":"https://orcid.org/0009-0006-0020-3563"},"institutions":[{"id":"https://openalex.org/I2800174090","display_name":"Phillips Academy","ror":"https://ror.org/0562sdw81","country_code":"US","type":"education","lineage":["https://openalex.org/I2800174090"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihao Huang","raw_affiliation_strings":["Phillips Academy, Andover, MA, USA"],"raw_orcid":"https://orcid.org/0009-0006-0020-3563","affiliations":[{"raw_affiliation_string":"Phillips Academy, Andover, MA, USA","institution_ids":["https://openalex.org/I2800174090"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063461740","display_name":"Shangdi Yu","orcid":"https://orcid.org/0000-0002-8907-692X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shangdi Yu","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8907-692X","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6163-6625","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.739,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69270769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7809762954711914},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7332456111907959},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7252120971679688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5061542391777039},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4806348383426666},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41009169816970825},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35799306631088257},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28184011578559875},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12815898656845093}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7809762954711914},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7332456111907959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7252120971679688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5061542391777039},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4806348383426666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41009169816970825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35799306631088257},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28184011578559875},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12815898656845093}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3597635.3598021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598021","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/152173","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/152173","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/152173/1/3597635.3598021.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3597635.3598021","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598021","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598021","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3636379132","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G4363747310","display_name":"CAREER: Parallel Algorithms and Frameworks for Graph and Hypergraph Processing","funder_award_id":"1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6650245637","display_name":null,"funder_award_id":"HR0011-18-3-0007","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7809439052","display_name":null,"funder_award_id":"CCF-1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8510928812","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320306087","display_name":"Semiconductor Research Corporation","ror":"https://ror.org/047z4n946"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320315933","display_name":"Siebel Scholars Foundation","ror":null},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384661698.pdf","grobid_xml":"https://content.openalex.org/works/W4384661698.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1519769038","https://openalex.org/W3174637788"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2607998022","https://openalex.org/W2059382600","https://openalex.org/W2005006850"],"abstract_inverted_index":{"Clustering":[0,77],"multidimensional":[1],"points":[2],"is":[3,27,35,112,138],"a":[4,36,79,130,142,162,190,203,226],"fundamental":[5],"data":[6,105,131],"mining":[7],"task,":[8],"with":[9,193],"applications":[10],"in":[11,63,94,97],"many":[12,64],"fields,":[13],"such":[14],"as":[15,42],"astronomy,":[16],"neuroscience,":[17],"bioinformatics,":[18],"and":[19,96,182],"computer":[20],"vision.":[21],"The":[22],"goal":[23],"of":[24,45,51,57,82,133,179],"clustering":[25,34,37],"algorithms":[26,73,88,181],"to":[28,54,103,173,215],"group":[29],"similar":[30],"objects":[31],"together.":[32],"Density-based":[33],"approach":[38],"that":[39,165,198],"defines":[40],"clusters":[41,56],"dense":[43],"regions":[44],"points.":[46,135],"It":[47],"has":[48],"the":[49,146,207,216],"advantage":[50],"being":[52,230],"able":[53],"detect":[55],"arbitrary":[58],"shapes,":[59],"rendering":[60],"it":[61],"useful":[62],"applications.":[65],"In":[66,153],"this":[67],"paper,":[68],"we":[69,155,196],"propose":[70],"fast":[71],"parallel":[72,210,218],"for":[74,129,169],"Density":[75],"Peaks":[76],"(DPC),":[78],"popular":[80],"version":[81],"density-based":[83],"clustering.":[84],"Existing":[85],"exact":[86,150,211],"DPC":[87,151,158,212,220],"suffer":[89],"from":[90],"low":[91],"parallelism":[92],"both":[93],"theory":[95],"practice,":[98],"which":[99,111],"limits":[100],"their":[101,184],"application":[102],"large-scale":[104],"sets.":[106],"Our":[107,136],"most":[108],"performant":[109],"algorithm,":[110,221],"based":[113,160],"on":[114,161],"priority":[115],"search":[116],"d-trees,":[117],"achieves":[118,202,225],"O":[119],"(log":[120],"n":[121,134],"log":[122,123],"n)":[124],"span":[125],"(parallel":[126],"time":[127],"complexity)":[128],"set":[132],"algorithm":[137,159,201,224],"also":[139],"work-efficient,":[140],"achieving":[141],"work":[143],"complexity":[144,172],"matching":[145],"best":[147,200,209,223],"existing":[148],"sequential":[149],"algorithm.":[152,213],"addition,":[154],"present":[156],"another":[157],"Fenwick":[163],"tree":[164],"makes":[166],"fewer":[167],"assumptions":[168],"its":[170],"average-case":[171],"hold.":[174],"We":[175],"provide":[176],"optimized":[177],"implementations":[178],"our":[180,199,222],"evaluate":[183],"performance":[185],"via":[186],"extensive":[187],"experiments.":[188],"On":[189],"30-core":[191],"machine":[192],"two-way":[194],"hyperthreading,":[195],"find":[197],"10.8-13169x":[204],"speedup":[205],"over":[206],"previous":[208],"Compared":[214],"state-of-the-art":[217],"approximate":[219],"1.5-4206X":[227],"speedup,":[228],"while":[229],"exact.":[231]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}