{"id":"https://openalex.org/W2951943056","doi":"https://doi.org/10.1142/s0218195919400028","title":"Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces","display_name":"Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2951943056","doi":"https://doi.org/10.1142/s0218195919400028","mag":"2951943056"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195919400028","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195919400028","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1702.08607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072973920","display_name":"Ade Gunawan","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ade Gunawan","raw_affiliation_strings":["Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031959850","display_name":"Marcel Roeloffzen","orcid":"https://orcid.org/0000-0002-1129-461X"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marcel Roeloffzen","raw_affiliation_strings":["Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1129-461X","affiliations":[{"raw_affiliation_string":"Department of Computing Science, TU Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.309,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57911891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"01","first_page":"21","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"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.9980999827384949,"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.9965999722480774,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/dbscan","display_name":"DBSCAN","score":0.8291174173355103},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5947744846343994},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5776494145393372},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5249635577201843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4945504367351532},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4929046630859375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4788896441459656},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4643310606479645},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4634537398815155},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.4300052523612976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4262159466743469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4171518385410309},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.1045965850353241},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09574338793754578},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.094200998544693},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.08209294080734253}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.8291174173355103},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5947744846343994},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5776494145393372},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5249635577201843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4945504367351532},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4929046630859375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4788896441459656},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4643310606479645},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4634537398815155},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4300052523612976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4262159466743469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4171518385410309},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.1045965850353241},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09574338793754578},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.094200998544693},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.08209294080734253},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1142/s0218195919400028","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195919400028","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1702.08607","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.08607","pdf_url":"https://arxiv.org/pdf/1702.08607","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:openaire/bac2d079-7bbf-4706-b810-a078f035b90a","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bac2d079-7bbf-4706-b810-a078f035b90a","pdf_url":"https://pure.tue.nl/ws/files/134970579/s0218195919400028.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M, Gunawan, A & Roeloffzen, M 2019, 'Faster DBScan and HDBScan in low-dimensional Euclidean spaces', International Journal of Computational Geometry and Applications, vol. 29, no. 1, pp. 21-47. https://doi.org/10.1142/S0218195919400028","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/bac2d079-7bbf-4706-b810-a078f035b90a","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/bac2d079-7bbf-4706-b810-a078f035b90a","pdf_url":"https://research.tue.nl/nl/publications/bac2d079-7bbf-4706-b810-a078f035b90a","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications, 29(1), 21 - 47. World Scientific","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2951943056","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1702.08607","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1702.08607","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.08607","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1702.08607","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.08607","pdf_url":"https://arxiv.org/pdf/1702.08607","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W108314478","https://openalex.org/W151377110","https://openalex.org/W1505970908","https://openalex.org/W1547671143","https://openalex.org/W1565377632","https://openalex.org/W1673310716","https://openalex.org/W1993216012","https://openalex.org/W2033139834","https://openalex.org/W2063567013","https://openalex.org/W2079207448","https://openalex.org/W2092799168","https://openalex.org/W2093241092","https://openalex.org/W2100928221","https://openalex.org/W2103893986","https://openalex.org/W2118268275","https://openalex.org/W2123747287","https://openalex.org/W2152601912","https://openalex.org/W2160642098","https://openalex.org/W2189503625","https://openalex.org/W4213149062","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W3007721825","https://openalex.org/W2561479996","https://openalex.org/W163149739","https://openalex.org/W2809347089","https://openalex.org/W2095535627","https://openalex.org/W2091684877","https://openalex.org/W1939644217","https://openalex.org/W2898972642","https://openalex.org/W2166505687","https://openalex.org/W1991111385","https://openalex.org/W2164083313","https://openalex.org/W2612312463","https://openalex.org/W1977126025","https://openalex.org/W2054464090","https://openalex.org/W2520718064","https://openalex.org/W1536319852","https://openalex.org/W2403033910","https://openalex.org/W1531307275","https://openalex.org/W2964317125","https://openalex.org/W1682116256"],"abstract_inverted_index":{"We":[0,99],"present":[1,101],"a":[2,14,52,75,116],"new":[3,65],"algorithm":[4,26,66,107],"for":[5,108],"the":[6,28,37,45,57,64,88,95,111],"widely":[7],"used":[8],"density-based":[9],"clustering":[10],"method":[11],"dbscan.":[12],"For":[13],"set":[15,50],"of":[16,36,90,119,133],"[Formula:":[17,22,31,40,91,103],"see":[18,23,32,41,92,104],"text]":[19,24,33,42,93,105],"points":[20],"in":[21,30,59,71,81,110,135,138],"our":[25],"computes":[27],"dbscan-clustering":[29],"time,":[34],"irrespective":[35],"scale":[38],"parameter":[39,47],"(and":[43],"assuming":[44],"second":[46],"MinPts":[48],"is":[49,56,67,79,115],"to":[51,87,128],"fixed":[53,140],"constant,":[54],"as":[55],"case":[58],"practice).":[60],"Experiments":[61],"show":[62,126],"that":[63,74],"not":[68],"only":[69],"fast":[70],"theory,":[72],"but":[73],"slightly":[76],"simplified":[77],"version":[78,118,132],"competitive":[80],"practice":[82],"and":[83,124],"much":[84],"less":[85],"sensitive":[86],"choice":[89],"than":[94],"original":[96],"dbscan":[97,120],"algorithm.":[98],"also":[100],"an":[102,130],"randomized":[106],"hdbscan":[109,114,134],"plane":[112],"\u2014":[113,123],"hierarchical":[117],"introduced":[121],"recently":[122],"we":[125],"how":[127],"compute":[129],"approximate":[131],"near-linear":[136],"time":[137],"any":[139],"dimension.":[141]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}