{"id":"https://openalex.org/W1995920661","doi":"https://doi.org/10.1109/cec.2008.4630801","title":"An effective evolutionary algorithm for discrete-valued data clustering","display_name":"An effective evolutionary algorithm for discrete-valued data clustering","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W1995920661","doi":"https://doi.org/10.1109/cec.2008.4630801","mag":"1995920661"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4630801","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/A5110693170","display_name":"C. H. Patrick","orcid":null},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Patrick C.H. Ma","raw_affiliation_strings":["Dept. of Comput., Hong Kong Polytech. Univ., Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput., Hong Kong Polytech. Univ., Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107049960","display_name":"Keith C. C. Chan","orcid":"https://orcid.org/0000-0001-7962-6564"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Keith C.C. Chan","raw_affiliation_strings":["Depatment of Computhing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China","Dept. of Comput., Hong Kong Polytech. Univ., Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Depatment of Computhing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Dept. of Comput., Hong Kong Polytech. Univ., Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I1118541","display_name":"University of East Anglia","ror":"https://ror.org/026k5mg93","country_code":"GB","type":"education","lineage":["https://openalex.org/I1118541"]},{"id":"https://openalex.org/I4210093666","display_name":"The Edgbaston Hospital","ror":"https://ror.org/007bv1h22","country_code":"GB","type":"healthcare","lineage":["https://openalex.org/I4210093666","https://openalex.org/I4210104184"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["Chrcia, School of Computer Science, University of Binningham, Birmingham, UK","CERCIA, School of Computer Science, The University of Birmingham, Edgbaston B15 2TT, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chrcia, School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":["https://openalex.org/I1118541"]},{"raw_affiliation_string":"CERCIA, School of Computer Science, The University of Birmingham, Edgbaston B15 2TT, U.K","institution_ids":["https://openalex.org/I4210093666","https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08455416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"210","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9986000061035156,"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.9986000061035156,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8520879745483398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.662638247013092},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6592631340026855},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5470557808876038},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4960189759731293},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.48709559440612793},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.45433714985847473},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.45433172583580017},{"id":"https://openalex.org/keywords/distance-measures","display_name":"Distance measures","score":0.44280192255973816},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.4337584674358368},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43259796500205994},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.4222131073474884},{"id":"https://openalex.org/keywords/similarity-measure","display_name":"Similarity measure","score":0.4212697744369507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24998685717582703},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.0749284029006958}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8520879745483398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.662638247013092},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6592631340026855},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5470557808876038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4960189759731293},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.48709559440612793},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.45433714985847473},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.45433172583580017},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.44280192255973816},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.4337584674358368},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43259796500205994},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.4222131073474884},{"id":"https://openalex.org/C2776517306","wikidata":"https://www.wikidata.org/wiki/Q29017317","display_name":"Similarity measure","level":2,"score":0.4212697744369507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24998685717582703},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0749284029006958},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2008.4630801","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/21887","is_oa":false,"landing_page_url":"http://hdl.handle.net/10397/21887","pdf_url":null,"source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/07f60457-9a13-45db-a6f5-771b911ec267","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/an-effective-evolutionary-algorithm-for-discretevalued-data-clustering(07f60457-9a13-45db-a6f5-771b911ec267).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ma, PCH, Chan, KCC & Yao, X 2008, 'An Effective Evolutionary Algorithm for Discrete-valued Data Clustering', Paper presented at Proceedings of 2008 IEEE Congress on Evolutionary Computation (CEC 2008), 6/06/08 pp. 210-216. https://doi.org/10.1109/CEC.2008.4630801","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W201726549","https://openalex.org/W634568521","https://openalex.org/W1524704912","https://openalex.org/W1991848143","https://openalex.org/W2016381774","https://openalex.org/W2047019718","https://openalex.org/W2057712948","https://openalex.org/W2069711114","https://openalex.org/W2070412788","https://openalex.org/W2071965987","https://openalex.org/W2073308541","https://openalex.org/W2084812512","https://openalex.org/W2099581008","https://openalex.org/W2103868202","https://openalex.org/W2117341849","https://openalex.org/W2127218421","https://openalex.org/W2135547590","https://openalex.org/W2140190241","https://openalex.org/W2155687169","https://openalex.org/W2162038040","https://openalex.org/W2886661658","https://openalex.org/W3023540311","https://openalex.org/W3112020351","https://openalex.org/W4230450987","https://openalex.org/W4234536190","https://openalex.org/W4241582122","https://openalex.org/W4244519650","https://openalex.org/W4301173492","https://openalex.org/W6753898695"],"related_works":["https://openalex.org/W2556490192","https://openalex.org/W2892323093","https://openalex.org/W2361242132","https://openalex.org/W3071522575","https://openalex.org/W3140018618","https://openalex.org/W2406185607","https://openalex.org/W2389934482","https://openalex.org/W2374506950","https://openalex.org/W2353443653","https://openalex.org/W4308301473"],"abstract_inverted_index":{"Clustering":[0],"is":[1,142,212],"concerned":[2],"with":[3,204],"the":[4,15,39,58,63,72,81,112,117,177,191],"discovery":[5],"of":[6,9,28,33,41,84,126,130],"interesting":[7],"groupings":[8],"records":[10,76],"in":[11,25,94,116,138],"a":[12,26,31,124,145],"database.":[13],"Of":[14],"many":[16,129],"algorithms":[17,43,49,98,193],"have":[18,175],"been":[19,36],"developed":[20,52,150],"to":[21,53,70,79,103,111,151],"tackle":[22],"clustering":[23,146,166],"problems":[24],"variety":[27],"application":[29],"domains,":[30],"lot":[32],"effort":[34],"has":[35],"put":[37],"into":[38],"development":[40],"effective":[42,164],"for":[44,168,196],"handling":[45],"spatial":[46],"data.":[47,109],"These":[48],"were":[50],"originally":[51],"handle":[54,104,152],"continuous-valued":[55],"attributes,":[56,128],"and":[57,200,207],"distance":[59,65,88],"functions":[60,89],"such":[61,87],"as":[62,78],"Euclidean":[64],"measure":[66,71],"are":[67,120,132],"often":[68],"used":[69,102,195],"pair-wise":[73],"similarity/distance":[74],"between":[75],"so":[77],"determine":[80],"cluster":[82],"memberships":[83],"records.":[85],"Since":[86],"cannot":[90,100],"be":[91,101,149],"validly":[92],"defined":[93],"non-Euclidean":[95],"space,":[96],"these":[97],"therefore":[99],"databases":[105,119],"that":[106,114,144,188],"contain":[107],"discrete-valued":[108,197,208],"Owing":[110],"fact":[113],"data":[115,153,183,198],"real-life":[118],"always":[121],"described":[122],"by":[123],"set":[125],"descriptive":[127],"which":[131],"not":[133],"numerical":[134],"or":[135],"inherently":[136],"ordered":[137],"any":[139],"way,":[140],"it":[141,189],"important":[143],"algorithm":[147,167,179],"should":[148],"mining":[154],"tasks":[155],"involving":[156],"them.":[157],"In":[158],"this":[159,169],"paper,":[160],"we":[161,174],"propose":[162],"an":[163],"evolutionary":[165],"problem.":[170],"For":[171],"performance":[172,211],"evaluation,":[173],"tested":[176],"proposed":[178],"using":[180],"several":[181],"real":[182],"sets.":[184],"Experimental":[185],"results":[186],"show":[187],"outperforms":[190],"existing":[192],"commonly":[194],"clustering,":[199],"also,":[201],"when":[202],"dealing":[203],"mixed":[205],"continuous-":[206],"data,":[209],"its":[210],"also":[213],"promising.":[214]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}