{"id":"https://openalex.org/W2569560853","doi":"https://doi.org/10.1109/iecon.2016.7793380","title":"An efficient grid-based clustering method by finding density peaks","display_name":"An efficient grid-based clustering method by finding density peaks","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2569560853","doi":"https://doi.org/10.1109/iecon.2016.7793380","mag":"2569560853"},"language":"en","primary_location":{"id":"doi:10.1109/iecon.2016.7793380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2016.7793380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2016 - 42nd Annual Conference of the IEEE Industrial Electronics Society","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100672634","display_name":"Bo Wu","orcid":"https://orcid.org/0000-0003-0763-8675"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Wu","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084622054","display_name":"Bogdan M. Wilamowski","orcid":null},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. M. Wilamowski","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82497590"],"apc_list":null,"apc_paid":null,"fwci":0.1941,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52669967,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"344","issue":null,"first_page":"837","last_page":"842"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9950000047683716,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.8665938377380371},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6347255110740662},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.602506160736084},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5465828776359558},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5226102471351624},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5019016265869141},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48012518882751465},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.4750549793243408},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47147324681282043},{"id":"https://openalex.org/keywords/determining-the-number-of-clusters-in-a-data-set","display_name":"Determining the number of clusters in a data set","score":0.450241357088089},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.4263092279434204},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4236871600151062},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.4206281900405884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39589571952819824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2646750807762146},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18759343028068542}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8665938377380371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6347255110740662},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.602506160736084},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5465828776359558},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5226102471351624},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5019016265869141},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48012518882751465},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.4750549793243408},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47147324681282043},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.450241357088089},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.4263092279434204},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4236871600151062},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.4206281900405884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39589571952819824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2646750807762146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18759343028068542},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iecon.2016.7793380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2016.7793380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2016 - 42nd Annual Conference of the IEEE Industrial Electronics Society","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1511349766","https://openalex.org/W1673310716","https://openalex.org/W1841961408","https://openalex.org/W1965306581","https://openalex.org/W1971784203","https://openalex.org/W1986261740","https://openalex.org/W1990368529","https://openalex.org/W1998871699","https://openalex.org/W2013858170","https://openalex.org/W2049633694","https://openalex.org/W2095693822","https://openalex.org/W2127218421","https://openalex.org/W2130473611","https://openalex.org/W2165835468","https://openalex.org/W2319660501","https://openalex.org/W2551050623","https://openalex.org/W6637131181","https://openalex.org/W6678914141","https://openalex.org/W6770641979","https://openalex.org/W7048738093"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2171610853","https://openalex.org/W2050713761","https://openalex.org/W2040929534","https://openalex.org/W2394193399","https://openalex.org/W2892323093","https://openalex.org/W2036298232","https://openalex.org/W4240938748","https://openalex.org/W2770741777","https://openalex.org/W2738096727"],"abstract_inverted_index":{"Clustering":[0],"or":[1],"categorizing":[2],"an":[3,72],"unprocessed":[4],"data":[5,28,67,131,196],"set":[6],"is":[7,82,111,127,138,152,232],"essential":[8],"and":[9,48,133,172,235],"critical":[10],"in":[11,55,93,210,222,237],"many":[12],"areas.":[13],"Much":[14],"success":[15],"has":[16],"been":[17],"published,":[18],"which":[19,179,214,248],"first":[20],"needs":[21],"to":[22,120,156,168,193,218],"calculate":[23,169],"the":[24,37,42,86,89,94,97,102,109,128,134,146,170,181,187,229,244,250],"mutual":[25],"distances":[26],"between":[27],"points.":[29],"It":[30,84,225],"suffers":[31],"from":[32,58],"considerable":[33],"computational":[34],"costs,":[35],"preventing":[36],"state-of-the-art":[38],"methods":[39],"such":[40],"as":[41,198],"clustering":[43,75,211,220,238],"method":[44,77,117,161,202,231,252],"by":[45,78,162,203],"fast":[46],"search":[47],"find":[49],"of":[50,66,88,108,130,136,149],"density":[51,80,164,205],"peaks":[52,81,165,206],"(FSFDP,":[53],"published":[54,223],"Science,":[56],"2014)":[57],"applying":[59],"into":[60,240],"real":[61],"life":[62],"(e.g.,":[63],"with":[64],"thousands":[65],"points).":[68],"In":[69],"this":[70],"paper,":[71],"efficient":[73,236],"grid-based":[74],"(GBC)":[76],"finding":[79,163,204],"described.":[83],"keeps":[85],"advantage":[87],"friendly":[90],"interactive":[91],"interface":[92],"FSFDP,":[95],"at":[96],"mean":[98],"time,":[99,178],"decreases":[100,118],"enormously":[101],"computation":[103],"complexity.":[104],"The":[105,158,200],"time":[106,147],"complexity":[107,148],"FSFDP":[110],"o(np(np":[112],"\u2212":[113],"l)/2)":[114],"while":[115],"our":[116,150],"it":[119,190],"o(np":[121],"*":[122],"sizeof":[123],"(grid)),":[124],"where":[125],"np":[126,143],"number":[129],"points":[132],"size":[135],"grid":[137],"always":[139],"much":[140,176,233],"smaller":[141],"than":[142,243],"so":[144],"that":[145,228],"approach":[151],"almost":[153],"linearly":[154],"proportional":[155],"np.":[157],"presented":[159,188,230],"GBC":[160,201],"was":[166,191,207],"able":[167],"densities":[171],"categorize":[173],"datasets":[174,239],"within":[175],"less":[177],"makes":[180,249],"density-peak-based":[182],"algorithm":[183],"practical.":[184],"By":[185],"using":[186],"algorithm,":[189],"possible":[192],"cluster":[194],"high-dimensional":[195],"sets":[197],"well.":[199],"successfully":[208],"verified":[209],"several":[212],"datasets,":[213],"are":[215],"commonly":[216],"used":[217],"test":[219],"algorithms":[221],"articles.":[224],"turned":[226],"out":[227],"faster":[234],"different":[241],"categories":[242],"conventional":[245],"density-based":[246],"ones,":[247],"proposed":[251],"more":[253],"preferable.":[254]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}