{"id":"https://openalex.org/W2077356777","doi":"https://doi.org/10.1109/eals.2014.7009512","title":"A fully autonomous Data Density based Clustering technique","display_name":"A fully autonomous Data Density based Clustering technique","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2077356777","doi":"https://doi.org/10.1109/eals.2014.7009512","mag":"2077356777"},"language":"en","primary_location":{"id":"doi:10.1109/eals.2014.7009512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eals.2014.7009512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)","raw_type":"proceedings-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/A5018615464","display_name":"Richard W. Hyde","orcid":"https://orcid.org/0000-0001-9034-8745"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Richard Hyde","raw_affiliation_strings":["Data Science Group, Lancaster University, Lancaster, UK","Data Science Group, School of Computing and Communications, Lancaster University, LA1 4WA, UK"],"affiliations":[{"raw_affiliation_string":"Data Science Group, Lancaster University, Lancaster, UK","institution_ids":["https://openalex.org/I67415387"]},{"raw_affiliation_string":"Data Science Group, School of Computing and Communications, Lancaster University, LA1 4WA, UK","institution_ids":["https://openalex.org/I67415387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039480864","display_name":"Plamen Angelov","orcid":"https://orcid.org/0000-0002-5770-934X"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Plamen Angelov","raw_affiliation_strings":["Data Science Group, Lancaster University, Lancaster, UK","Data Science Group, School of Computing and Communications, Lancaster University, LA1 4WA, UK"],"affiliations":[{"raw_affiliation_string":"Data Science Group, Lancaster University, Lancaster, UK","institution_ids":["https://openalex.org/I67415387"]},{"raw_affiliation_string":"Data Science Group, School of Computing and Communications, Lancaster University, LA1 4WA, UK","institution_ids":["https://openalex.org/I67415387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018615464"],"corresponding_institution_ids":["https://openalex.org/I67415387"],"apc_list":null,"apc_paid":null,"fwci":1.636,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87468461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"116","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9934999942779541,"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/T10885","display_name":"Gene expression and cancer classification","score":0.9599000215530396,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.9029792547225952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7259604334831238},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6173112392425537},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.5619217753410339},{"id":"https://openalex.org/keywords/clustering-high-dimensional-data","display_name":"Clustering high-dimensional data","score":0.5361435413360596},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5264557003974915},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5166571140289307},{"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.5056009292602539},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4622582793235779},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.44622674584388733},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.4223410487174988},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.38977742195129395},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33352065086364746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18319541215896606}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.9029792547225952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259604334831238},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6173112392425537},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5619217753410339},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.5361435413360596},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5264557003974915},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5166571140289307},{"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.5056009292602539},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4622582793235779},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.44622674584388733},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.4223410487174988},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.38977742195129395},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33352065086364746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18319541215896606},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eals.2014.7009512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eals.2014.7009512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1501270597","https://openalex.org/W1542813816","https://openalex.org/W1570834090","https://openalex.org/W1673310716","https://openalex.org/W2035679009","https://openalex.org/W2039977457","https://openalex.org/W2155379062","https://openalex.org/W6637131181"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2171610853","https://openalex.org/W2040929534","https://openalex.org/W1988157641","https://openalex.org/W2163563073","https://openalex.org/W2094228100","https://openalex.org/W2065539689","https://openalex.org/W2389934482","https://openalex.org/W1987613674","https://openalex.org/W3123889202"],"abstract_inverted_index":{"A":[0,68],"recently":[1],"introduced":[2],"data":[3,111,165,182],"density":[4],"based":[5,13,56],"approach":[6,178],"to":[7,65,102,145],"clustering,":[8],"known":[9],"as":[10,179],"Data":[11,54],"Density":[12,29,55],"Clustering":[14,57],"has":[15],"been":[16],"presented":[17],"which":[18,77],"automatically":[19,103,153],"determines":[20],"the":[21,27,34,46,89,99,120,133,147,150,155,173,176,189,194],"number":[22,35],"of":[23,36,122,138,149,175,193],"clusters.":[24],"By":[25,152],"using":[26],"Recursive":[28],"Estimation":[30],"for":[31,50],"each":[32],"point":[33],"calculations":[37],"is":[38,48,110],"significantly":[39],"reduced":[40],"in":[41,82],"offline":[42],"mode":[43],"and,":[44],"further,":[45],"method":[47,58,101,195],"suitable":[49,105],"online":[51],"use.":[52],"The":[53,108,170],"however":[59],"requires":[60,114],"an":[61,180],"initial":[62,106,156],"cluster":[63,164],"radius":[64,70],"be":[66],"entered.":[67],"different":[69],"per":[71],"feature/":[72],"dimension":[73],"creates":[74],"hyperellipsoid":[75],"clusters":[76,87,90],"are":[78,91],"axis-orthogonal.":[79],"This":[80],"results":[81,134,171],"a":[83,136],"greater":[84],"differentiation":[85],"between":[86],"where":[88],"highly":[92],"asymmetrical.":[93],"In":[94],"this":[95],"paper":[96],"we":[97,158,161],"update":[98],"DDC":[100,125],"derive":[104],"radii.":[107],"selection":[109,137],"driven":[112,183],"and":[113,126,141,191],"no":[115,167],"user":[116,168],"input.":[117,169],"We":[118,186],"compare":[119],"performance":[121],"DDCAR":[123],"with":[124,166],"other":[127],"standard":[128,139],"clustering":[129,184],"techniques":[130],"by":[131],"comparing":[132],"across":[135],"datasets":[140,143],"test":[142,146],"designed":[144],"abilities":[148],"technique.":[151,185],"estimating":[154],"radii":[157],"show":[159],"that":[160],"can":[162],"effectively":[163],"demonstrate":[172,188],"validity":[174],"proposed":[177],"autonomous,":[181],"also":[187],"speed":[190],"accuracy":[192],"on":[196],"large":[197],"datasets.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}