{"id":"https://openalex.org/W2061351061","doi":"https://doi.org/10.1109/grc.2005.1547385","title":"A k-nearest neighbor based algorithm for multi-label classification","display_name":"A k-nearest neighbor based algorithm for multi-label classification","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2061351061","doi":"https://doi.org/10.1109/grc.2005.1547385","mag":"2061351061"},"language":"en","primary_location":{"id":"doi:10.1109/grc.2005.1547385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2005.1547385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Conference on Granular Computing","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/A5050076910","display_name":"Min-Ling Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Min-Ling Zhang","raw_affiliation_strings":["National Laboratory for Novel Software Technology, Nanjing University, Nanjing, China","National Lab. for Novel Software Technol., Nanjing Univ., China"],"affiliations":[{"raw_affiliation_string":"National Laboratory for Novel Software Technology, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"National Lab. for Novel Software Technol., Nanjing Univ., China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zhi-Hua Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi-Hua Zhou","raw_affiliation_strings":["National Laboratory for Novel Software Technology, Nanjing University, Nanjing, China","National Lab. for Novel Software Technol., Nanjing Univ., China"],"affiliations":[{"raw_affiliation_string":"National Laboratory for Novel Software Technology, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"National Lab. for Novel Software Technol., Nanjing Univ., China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050076910"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":12.3421,"has_fulltext":false,"cited_by_count":442,"citation_normalized_percentile":{"value":0.98556863,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"718","last_page":"721 Vol. 2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11550","display_name":"Text and Document Classification Technologies","score":0.9991999864578247,"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/T11550","display_name":"Text and Document Classification Technologies","score":0.9991999864578247,"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/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9954000115394592,"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"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9753000140190125,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.775300920009613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7254630923271179},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6980305910110474},{"id":"https://openalex.org/keywords/multi-label-classification","display_name":"Multi-label classification","score":0.6465678811073303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6215357184410095},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5940550565719604},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5814509391784668},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5148688554763794},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5093832612037659},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43797820806503296},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.420840859413147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3965511918067932},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3246683180332184},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.1433410346508026}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.775300920009613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7254630923271179},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6980305910110474},{"id":"https://openalex.org/C2776482837","wikidata":"https://www.wikidata.org/wiki/Q3553958","display_name":"Multi-label classification","level":2,"score":0.6465678811073303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6215357184410095},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5940550565719604},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5814509391784668},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5148688554763794},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5093832612037659},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43797820806503296},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.420840859413147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3965511918067932},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3246683180332184},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.1433410346508026},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"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/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/grc.2005.1547385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2005.1547385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Conference on Granular Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488209167","https://openalex.org/W1504694836","https://openalex.org/W1558901573","https://openalex.org/W1753402186","https://openalex.org/W1881647329","https://openalex.org/W1988790447","https://openalex.org/W2032210760","https://openalex.org/W2049633694","https://openalex.org/W2053463056","https://openalex.org/W2071106922","https://openalex.org/W2118712128","https://openalex.org/W2125055259","https://openalex.org/W2156935079","https://openalex.org/W2170654002","https://openalex.org/W2473999760","https://openalex.org/W4248437541","https://openalex.org/W4255930413","https://openalex.org/W6639409548","https://openalex.org/W6677758222"],"related_works":["https://openalex.org/W2519241726","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W2125687350","https://openalex.org/W2182477562","https://openalex.org/W325985789","https://openalex.org/W2107686700","https://openalex.org/W1671890395","https://openalex.org/W4297819076","https://openalex.org/W2795392346"],"abstract_inverted_index":{"In":[0,35,57],"multi-label":[1,39,100,111],"learning,":[2],"each":[3,32,60],"instance":[4],"in":[5],"the":[6,17,51,73,89,93],"training":[7],"set":[8,13,24,91],"is":[9,19,27,45,48,85,106],"associated":[10],"with":[11],"a":[12,22,29,38,81,98],"of":[14,76],"labels,":[15],"and":[16],"task":[18],"to":[20,72,87,109],"output":[21],"label":[23,74,90],"whose":[25],"size":[26],"unknown":[28],"priori":[30],"for":[31,59,92],"unseen":[33],"instance.":[34,95],"this":[36],"paper,":[37],"lazy":[40],"learning":[41,112],"approach":[42],"named":[43],"ML-kNN":[44,105],"presented,":[46],"which":[47],"derived":[49],"from":[50],"traditional":[52],"k-nearest":[53,64],"neighbor":[54],"(kNN)":[55],"algorithm.":[56],"detail,":[58],"new":[61,94],"instance,":[62],"its":[63],"neighbors":[65],"are":[66],"firstly":[67],"identified.":[68],"After":[69],"that,":[70],"according":[71],"sets":[75],"these":[77],"neighboring":[78],"instances,":[79],"maximum":[80],"posteriori":[82],"(MAP)":[83],"principle":[84],"utilized":[86],"determine":[88],"Experiments":[96],"on":[97],"real-world":[99],"bioinformatic":[101],"data":[102],"show":[103],"that":[104],"highly":[107],"comparable":[108],"existing":[110],"algorithms.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":27},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":36},{"year":2020,"cited_by_count":46},{"year":2019,"cited_by_count":44},{"year":2018,"cited_by_count":36},{"year":2017,"cited_by_count":26},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":23},{"year":2014,"cited_by_count":25},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}