{"id":"https://openalex.org/W4281749824","doi":"https://doi.org/10.1109/eais51927.2022.9787746","title":"Evolving clustering algorithm based on average cluster distance - eCAD","display_name":"Evolving clustering algorithm based on average cluster distance - eCAD","publication_year":2022,"publication_date":"2022-05-25","ids":{"openalex":"https://openalex.org/W4281749824","doi":"https://doi.org/10.1109/eais51927.2022.9787746"},"language":"en","primary_location":{"id":"doi:10.1109/eais51927.2022.9787746","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eais51927.2022.9787746","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Evolving and Adaptive Intelligent Systems (EAIS)","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/A5043073463","display_name":"Goran Andonovski","orcid":"https://orcid.org/0000-0002-2584-917X"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Goran Andonovski","raw_affiliation_strings":["University of Ljubljana,Faculty of Electrical Engineering,Ljubljana,Slovenia","Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"University of Ljubljana,Faculty of Electrical Engineering,Ljubljana,Slovenia","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040998302","display_name":"Igor \u0160krjanc","orcid":"https://orcid.org/0000-0002-0502-5376"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Igor Skrjanc","raw_affiliation_strings":["University of Ljubljana,Faculty of Electrical Engineering,Ljubljana,Slovenia","Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"University of Ljubljana,Faculty of Electrical Engineering,Ljubljana,Slovenia","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043073463"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":0.5553,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71452322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987000226974487,"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.9987000226974487,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.996999979019165,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9805999994277954,"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.880635678768158},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7208040952682495},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6790893077850342},{"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.5986018776893616},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5440702438354492},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5383817553520203},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5213785767555237},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.516546905040741},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.49815845489501953},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.432604044675827},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.42670509219169617},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.4101334512233734},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2955433428287506}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.880635678768158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7208040952682495},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6790893077850342},{"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.5986018776893616},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5440702438354492},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5383817553520203},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5213785767555237},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.516546905040741},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.49815845489501953},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.432604044675827},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.42670509219169617},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4101334512233734},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2955433428287506},{"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/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eais51927.2022.9787746","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eais51927.2022.9787746","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Evolving and Adaptive Intelligent Systems (EAIS)","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":35,"referenced_works":["https://openalex.org/W1673310716","https://openalex.org/W1980791070","https://openalex.org/W2018189414","https://openalex.org/W2057923756","https://openalex.org/W2061278117","https://openalex.org/W2101234009","https://openalex.org/W2105268089","https://openalex.org/W2113076747","https://openalex.org/W2127218421","https://openalex.org/W2132377940","https://openalex.org/W2141937972","https://openalex.org/W2146561754","https://openalex.org/W2150415479","https://openalex.org/W2165012164","https://openalex.org/W2465549242","https://openalex.org/W2475489172","https://openalex.org/W2559950244","https://openalex.org/W2569580858","https://openalex.org/W2701398813","https://openalex.org/W2884586244","https://openalex.org/W2884851420","https://openalex.org/W2893167765","https://openalex.org/W2903535881","https://openalex.org/W2929291387","https://openalex.org/W2965794323","https://openalex.org/W2992711753","https://openalex.org/W3001398650","https://openalex.org/W3011621907","https://openalex.org/W3038505635","https://openalex.org/W3099347911","https://openalex.org/W6637131181","https://openalex.org/W6675354045","https://openalex.org/W6678914141","https://openalex.org/W6755108618","https://openalex.org/W6755915452"],"related_works":["https://openalex.org/W2160785859","https://openalex.org/W2559422900","https://openalex.org/W2188840951","https://openalex.org/W2770741777","https://openalex.org/W2171610853","https://openalex.org/W2185849206","https://openalex.org/W2393816671","https://openalex.org/W2389934482","https://openalex.org/W4241252752","https://openalex.org/W2567087402"],"abstract_inverted_index":{"This":[0,19,70,105],"paper":[1],"presents":[2],"a":[3,56,64,102,111],"preliminary":[4],"study":[5],"of":[6,27,80,96],"an":[7],"evolving":[8,50],"clustering":[9,113,124],"algorithm":[10,20,73,106,114],"based":[11],"on":[12],"the":[13,33,45,49,72,78,81,94],"average":[14,34],"cluster":[15],"distance":[16,35],"-":[17],"eCAD.":[18],"is":[21,42,98],"mainly":[22],"intended":[23],"for":[24],"online":[25],"processing":[26],"data":[28,39],"streams.":[29],"It":[30],"recursively":[31],"computes":[32],"between":[36],"two":[37],"consecutive":[38],"samples,":[40],"which":[41,83],"included":[43,55],"as":[44,101,110],"main":[46],"measure":[47],"in":[48],"mechanisms.":[51],"Accordingly,":[52],"we":[53,116],"have":[54],"mechanism":[57,65],"to":[58,66,77,87],"automatically":[59],"detect":[60],"new":[61],"clusters":[62,97],"and":[63,75,115],"merge":[67],"existing":[68],"clusters.":[69],"makes":[71],"autonomous":[74],"insensitive":[76],"distribution":[79],"data,":[82],"does":[84],"not":[85,99],"need":[86],"be":[88,108],"prescaled":[89],"or":[90],"normalized.":[91],"In":[92],"addition,":[93],"number":[95],"required":[100],"predefined":[103],"parameter.":[104],"could":[107],"classified":[109],"density-based":[112],"therefore":[117],"provide":[118],"some":[119],"comparison":[120],"results":[121],"with":[122],"established":[123],"techniques.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-06T07:47:59.780226","created_date":"2025-10-10T00:00:00"}