{"id":"https://openalex.org/W2125056703","doi":"https://doi.org/10.1109/ijcnn.2008.4634300","title":"Combining global optimization algorithms with a simple adaptive distance for feature selection and weighting","display_name":"Combining global optimization algorithms with a simple adaptive distance for feature selection and weighting","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2125056703","doi":"https://doi.org/10.1109/ijcnn.2008.4634300","mag":"2125056703"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2008.4634300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","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/A5113673391","display_name":"Adelia C. A. Barros","orcid":null},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]},{"id":"https://openalex.org/I71437568","display_name":"Universidade de Pernambuco","ror":"https://ror.org/00gtcbp88","country_code":"BR","type":"education","lineage":["https://openalex.org/I71437568"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Adelia C. A. Barros","raw_affiliation_strings":["Center of Informatics (CIn), Federal University of Pernambuco (UFPE), Recife, Pernambuco, Brazil","Center of Inf., Fed. Univ. of Pernambuco, Recife"],"affiliations":[{"raw_affiliation_string":"Center of Informatics (CIn), Federal University of Pernambuco (UFPE), Recife, Pernambuco, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Center of Inf., Fed. Univ. of Pernambuco, Recife","institution_ids":["https://openalex.org/I71437568"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084140678","display_name":"George D. C. Cavalcanti","orcid":"https://orcid.org/0000-0001-7714-2283"},"institutions":[{"id":"https://openalex.org/I71437568","display_name":"Universidade de Pernambuco","ror":"https://ror.org/00gtcbp88","country_code":"BR","type":"education","lineage":["https://openalex.org/I71437568"]},{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"George D. C. Cavalcanti","raw_affiliation_strings":["Center of Informatics (CIn), Federal University of Pernambuco (UFPE), Recife, Pernambuco, Brazil","Center of Inf., Fed. Univ. of Pernambuco, Recife"],"affiliations":[{"raw_affiliation_string":"Center of Informatics (CIn), Federal University of Pernambuco (UFPE), Recife, Pernambuco, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Center of Inf., Fed. Univ. of Pernambuco, Recife","institution_ids":["https://openalex.org/I71437568"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113673391"],"corresponding_institution_ids":["https://openalex.org/I25112270","https://openalex.org/I71437568"],"apc_list":null,"apc_paid":null,"fwci":0.5721,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78920465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3518","last_page":"3523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9890000224113464,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9890000224113464,"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/T10057","display_name":"Face and Expression Recognition","score":0.9729999899864197,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10320","display_name":"Neural Networks and Applications","score":0.9444000124931335,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.7885017395019531},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7740828990936279},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5988990068435669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5967154502868652},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5931062698364258},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.5773822665214539},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.5693118572235107},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.539854884147644},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5346720814704895},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4959128797054291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4701443016529083},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4643891751766205},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4496401846408844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4386010766029358},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3212684392929077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2550005614757538}],"concepts":[{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.7885017395019531},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7740828990936279},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5988990068435669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5967154502868652},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5931062698364258},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.5773822665214539},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5693118572235107},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.539854884147644},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5346720814704895},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4959128797054291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4701443016529083},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4643891751766205},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4496401846408844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4386010766029358},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3212684392929077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2550005614757538},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2008.4634300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","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":14,"referenced_works":["https://openalex.org/W1700821812","https://openalex.org/W1989617207","https://openalex.org/W2002016471","https://openalex.org/W2024060531","https://openalex.org/W2056760934","https://openalex.org/W2084792706","https://openalex.org/W2097653553","https://openalex.org/W2122111042","https://openalex.org/W2124290836","https://openalex.org/W2135190479","https://openalex.org/W2142334564","https://openalex.org/W2143153057","https://openalex.org/W3120740533","https://openalex.org/W4238635517"],"related_works":["https://openalex.org/W173587566","https://openalex.org/W2900012203","https://openalex.org/W2509914111","https://openalex.org/W2388574609","https://openalex.org/W2148102208","https://openalex.org/W2019085397","https://openalex.org/W2026922968","https://openalex.org/W2563889536","https://openalex.org/W2971736757","https://openalex.org/W1232705"],"abstract_inverted_index":{"This":[0],"work":[1,62],"focuses":[2],"on":[3,101],"a":[4,85,107,121],"study":[5],"about":[6],"hybrid":[7,43,86],"optimization":[8,22,59],"techniques":[9],"for":[10,66,94,176],"improving":[11],"feature":[12,95,130],"selection":[13,96],"and":[14,29,46,91,97,111,120,149],"weighting":[15,98],"applications.":[16],"For":[17],"this":[18,73,104],"purpose,":[19],"two":[20,42],"global":[21,58,70],"methods":[23,34],"were":[24,35],"used:":[25],"Tabu":[26],"search":[27],"(TS)":[28],"simulated":[30],"annealing":[31],"(SA).":[32],"These":[33],"combined":[36,164],"to":[37,51,142],"k-nearest":[38],"neighbor":[39],"(k-NN)":[40],"composing":[41],"approaches:":[44],"SA/k-NN":[45,109],"TS/k-NN.":[47],"Those":[48],"approaches":[49],"try":[50],"use":[52,165],"the":[53,57,69,75,82,102,116,134,143,154,160,163,167,174],"main":[54],"advantage":[55],"from":[56],"methods:":[60],"they":[61],"efficiently":[63],"in":[64,68,153,159],"searching":[65],"solutions":[67],"space.":[71],"In":[72,81],"study,":[74],"methodology":[76],"is":[77],"proposed":[78],"by":[79,133],"[4].":[80],"referred":[83],"work,":[84],"TS/k-NN":[87],"approach":[88],"was":[89],"suggested":[90],"successfully":[92],"applied":[93],"problems.":[99],"Based":[100],"later,":[103],"analysis":[105],"indicates":[106],"new":[108],"combination":[110],"compares":[112],"their":[113],"results":[114,127,175],"using":[115],"classical":[117],"Euclidean":[118],"Distance":[119,124],"Simple":[122],"Adaptive":[123],"[8].":[125],"The":[126],"demonstrate":[128],"that":[129],"sets":[131],"optimized":[132],"studied":[135],"models":[136],"are":[137,157],"very":[138],"efficient":[139],"when":[140],"compared":[141],"well-known":[144],"k-NN.":[145],"Both":[146],"accuracy":[147],"classification":[148],"number":[150],"of":[151,166],"features":[152],"resultant":[155],"set":[156],"considered":[158],"conclusions.":[161],"Furthermore,":[162],"simple":[168],"adaptive":[169],"distance":[170],"improves":[171],"even":[172],"more":[173],"all":[177],"datasets":[178],"analyzed.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}