{"id":"https://openalex.org/W2100928221","doi":"https://doi.org/10.1142/s0218195905001683","title":"GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING","display_name":"GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2100928221","doi":"https://doi.org/10.1142/s0218195905001683","mag":"2100928221"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195905001683","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195905001683","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANNY Z. CHEN","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA","Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA,","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"MICHIEL SMID","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037135234","display_name":"Bin Xu","orcid":"https://orcid.org/0000-0001-7695-9515"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BIN XU","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA","Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA,","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2826,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.80531449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"03","first_page":"239","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.996999979019165,"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/cluster-analysis","display_name":"Cluster analysis","score":0.6926639080047607},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6716329455375671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6461122632026672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6319133043289185},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5106566548347473},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.45348426699638367}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6926639080047607},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6716329455375671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6461122632026672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6319133043289185},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5106566548347473},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.45348426699638367},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195905001683","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195905001683","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1577072181","https://openalex.org/W1999073695","https://openalex.org/W2126751256","https://openalex.org/W2165558283","https://openalex.org/W2220451813","https://openalex.org/W2319660501","https://openalex.org/W2427881153","https://openalex.org/W4206206918"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2317200988","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2804364458","https://openalex.org/W2053286651","https://openalex.org/W4298130764","https://openalex.org/W2181743346","https://openalex.org/W2187401768"],"abstract_inverted_index":{"Data":[0],"clustering":[1,26,129],"is":[2,188,217],"a":[3,63],"fundamental":[4],"problem":[5,27,45,130],"arising":[6],"in":[7,28,99,131],"many":[8],"practical":[9,191],"applications.":[10],"In":[11,85,135],"this":[12,44],"paper,":[13],"we":[14,118],"present":[15],"new":[16],"geometric":[17],"approximation":[18,121,138,186,206,215],"and":[19,122,157,167,208],"exact":[20,123,159,196],"algorithms":[21,42,97,124,160,172,197],"for":[22,43,125,151],"the":[23,50,58,72,80,86,90,126,142,209],"density-based":[24,127],"data":[25,74,91,128,179],"d-dimensional":[29],"space":[30],"\u211d":[31,132],"d":[32,37,133],"(for":[33],"any":[34,152,177],"constant":[35,64],"integer":[36],"\u2265":[38],"2).":[39],"Previously":[40],"known":[41],"are":[46,93,198],"efficient":[47,218],"only":[48],"when":[49,89],"specified":[51],"range":[52],"around":[53],"each":[54],"input":[55,67,73,221],"point,":[56],"called":[57],"\u03b4-neighborhood,":[59],"contains":[60],"on":[61,79,110,141,176,219],"average":[62],"number":[65],"of":[66,71,82,170,189,200],"points.":[68],"Different":[69],"distributions":[70],"points":[75,92],"have":[76],"significant":[77],"impact":[78],"efficiency":[81],"these":[83,96],"algorithms.":[84],"worst":[87],"case":[88],"highly":[94],"clustered,":[95],"run":[98],"quadratic":[100],"time,":[101],"although":[102],"such":[103],"situations":[104],"might":[105],"not":[106,174],"occur":[107],"very":[108],"frequently":[109],"real":[111],"data.":[112],"By":[113],"using":[114],"computational":[115],"geometry":[116],"techniques,":[117],"develop":[119],"faster":[120],".":[134],"particular,":[136],"our":[137,158,171,184,194,205,214],"algorithm":[139,187,207,216],"based":[140],"\u220a-fuzzy":[143],"distance":[144],"function":[145],"takes":[146],"O(n":[147],"log":[148],"n)":[149],"time":[150],"given":[153],"fixed":[154],"value":[155],"\u220a>0,":[156],"take":[161],"sub-quadratic":[162,195],"time.":[163],"The":[164],"running":[165],"times":[166],"output":[168],"quality":[169],"do":[173],"depend":[175],"particular":[178],"distribution.":[180],"We":[181,203],"believe":[182],"that":[183,213],"fast":[185],"considerable":[190],"importance,":[192],"while":[193],"more":[199],"theoretical":[201],"interest.":[202],"implemented":[204],"experimental":[210],"results":[211],"show":[212],"arbitrary":[220],"point":[222],"sets.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}