{"id":"https://openalex.org/W2023878529","doi":"https://doi.org/10.1109/bmei.2012.6513101","title":"Enhancement of K-nearest neighbor algorithm based on weighted entropy of attribute value","display_name":"Enhancement of K-nearest neighbor algorithm based on weighted entropy of attribute value","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2023878529","doi":"https://doi.org/10.1109/bmei.2012.6513101","mag":"2023878529"},"language":"en","primary_location":{"id":"doi:10.1109/bmei.2012.6513101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2012.6513101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 5th International Conference on BioMedical Engineering and Informatics","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/A5013428655","display_name":"Xingjiang Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I142108993","display_name":"Southwest University","ror":"https://ror.org/01kj4z117","country_code":"CN","type":"education","lineage":["https://openalex.org/I142108993"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xingjiang Xiao","raw_affiliation_strings":["Department of Information Management, Southwest University, Chongqing, China","Dept. of Inf. Manage., Southwest Univ., Chongqing, China"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, Southwest University, Chongqing, China","institution_ids":["https://openalex.org/I142108993"]},{"raw_affiliation_string":"Dept. of Inf. Manage., Southwest Univ., Chongqing, China","institution_ids":["https://openalex.org/I142108993"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086030665","display_name":"Huafeng Ding","orcid":"https://orcid.org/0000-0001-6057-8857"},"institutions":[{"id":"https://openalex.org/I142108993","display_name":"Southwest University","ror":"https://ror.org/01kj4z117","country_code":"CN","type":"education","lineage":["https://openalex.org/I142108993"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huafeng Ding","raw_affiliation_strings":["Department of Information Management, Southwest University, Chongqing, China","Dept. of Inf. Manage., Southwest Univ., Chongqing, China"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, Southwest University, Chongqing, China","institution_ids":["https://openalex.org/I142108993"]},{"raw_affiliation_string":"Dept. of Inf. Manage., Southwest Univ., Chongqing, China","institution_ids":["https://openalex.org/I142108993"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013428655"],"corresponding_institution_ids":["https://openalex.org/I142108993"],"apc_list":null,"apc_paid":null,"fwci":1.6891,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86181615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"44","issue":null,"first_page":"1261","last_page":"1264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13717","display_name":"Advanced Algorithms and Applications","score":0.8652999997138977,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13717","display_name":"Advanced Algorithms and Applications","score":0.8652999997138977,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.8173999786376953,"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/T13890","display_name":"Remote Sensing and Land Use","score":0.8136000037193298,"subfield":{"id":"https://openalex.org/subfields/1902","display_name":"Atmospheric Science"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.8058618903160095},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.777423620223999},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5847355127334595},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5597991347312927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49268418550491333},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.46949508786201477},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4658416509628296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44811350107192993},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.44742751121520996},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43096572160720825},{"id":"https://openalex.org/keywords/nearest-neighbour","display_name":"Nearest neighbour","score":0.42511314153671265},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4201541543006897},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4111822247505188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4075988829135895},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3862444758415222},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.17923951148986816},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10580524802207947}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.8058618903160095},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.777423620223999},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5847355127334595},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5597991347312927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49268418550491333},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.46949508786201477},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4658416509628296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44811350107192993},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.44742751121520996},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43096572160720825},{"id":"https://openalex.org/C2983946233","wikidata":"https://www.wikidata.org/wiki/Q4088109","display_name":"Nearest neighbour","level":2,"score":0.42511314153671265},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4201541543006897},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4111822247505188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4075988829135895},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3862444758415222},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.17923951148986816},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10580524802207947},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bmei.2012.6513101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2012.6513101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 5th International Conference on BioMedical Engineering and Informatics","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2368415703","https://openalex.org/W2519241726","https://openalex.org/W2245581955","https://openalex.org/W325985789","https://openalex.org/W1981914622","https://openalex.org/W2358559774","https://openalex.org/W2589681725","https://openalex.org/W2097149198","https://openalex.org/W2131082717","https://openalex.org/W3014913653"],"abstract_inverted_index":{"The":[0,81],"traditional":[1,41,88],"K-nearest":[2,71,89],"neighbor":[3,72,90],"algorithm":[4,73,93],"usually":[5],"adopts":[6],"Euclidean":[7],"distance":[8,13,47,52],"formula":[9],"to":[10,39,62],"measure":[11,63],"the":[12,23,28,31,51,64,87,92,102,109],"between":[14],"two":[15],"samples.":[16],"Since":[17],"each":[18],"attribute":[19,65,79],"functions":[20],"differently":[21],"in":[22,95],"actual":[24],"sample":[25],"data":[26],"collection,":[27],"accuracy":[29,110],"of":[30,78,104,111],"classification":[32,105],"will":[33],"be":[34],"reduced":[35],"consequently.":[36],"In":[37],"order":[38],"improve":[40],"KNN":[42,44],"and":[43,54,67],"with":[45,86],"weighted":[46,76],"which":[48],"is":[49],"on":[50,75],"definition":[53],"test":[55],"mode,":[56],"this":[57,96],"article":[58,97],"proposes":[59],"one":[60],"method":[61],"value":[66],"entropy":[68,77],"weight,":[69],"namely":[70],"based":[74],"value.":[80],"experiment":[82],"indicated":[83],"that,":[84],"compared":[85],"algorithm,":[91],"proposed":[94],"can":[98],"not":[99],"only":[100],"guarantee":[101],"efficiency":[103],"but":[106],"also":[107],"enhance":[108],"classification.":[112]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}