{"id":"https://openalex.org/W2219637520","doi":"https://doi.org/10.1007/s10044-015-0527-6","title":"A novel supervised cluster adjustment method using a fast exact nearest neighbor search algorithm","display_name":"A novel supervised cluster adjustment method using a fast exact nearest neighbor search algorithm","publication_year":2015,"publication_date":"2015-12-16","ids":{"openalex":"https://openalex.org/W2219637520","doi":"https://doi.org/10.1007/s10044-015-0527-6","mag":"2219637520"},"language":"en","primary_location":{"id":"doi:10.1007/s10044-015-0527-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10044-015-0527-6","pdf_url":null,"source":{"id":"https://openalex.org/S45497385","display_name":"Pattern Analysis and Applications","issn_l":"1433-7541","issn":["1433-7541","1433-755X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Analysis and Applications","raw_type":"journal-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/A5057242776","display_name":"Ali Zaghian","orcid":null},"institutions":[{"id":"https://openalex.org/I78323350","display_name":"Malek Ashtar University of Technology","ror":"https://ror.org/0043ezw98","country_code":"IR","type":"education","lineage":["https://openalex.org/I78323350"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Zaghian","raw_affiliation_strings":["Department of Mathematics and Cryptography, Malek Ashtar University of Technology, Isfahan, 83145-115, Iran","Department of Mathematics and Cryptography, Malek Ashtar University of Technology, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Cryptography, Malek Ashtar University of Technology, Isfahan, 83145-115, Iran","institution_ids":["https://openalex.org/I78323350"]},{"raw_affiliation_string":"Department of Mathematics and Cryptography, Malek Ashtar University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I78323350"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025585983","display_name":"Fakhroddin Noorbehbahani","orcid":"https://orcid.org/0000-0001-8771-0205"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Fakhroddin Noorbehbahani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran","Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025585983"],"corresponding_institution_ids":["https://openalex.org/I170013655"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11373539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"3","first_page":"701","last_page":"715"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9987000226974487,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9868000149726868,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9861000180244446,"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/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.8381425142288208},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8337365388870239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6675547957420349},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6662251949310303},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5630427002906799},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5627588033676147},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5179868936538696},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.49649912118911743},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.47791537642478943},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4778118431568146},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4669996500015259},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.46699681878089905},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.46311628818511963},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4616483747959137},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.45391303300857544},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4379495680332184},{"id":"https://openalex.org/keywords/affinity-propagation","display_name":"Affinity propagation","score":0.41024050116539}],"concepts":[{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.8381425142288208},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8337365388870239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6675547957420349},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6662251949310303},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5630427002906799},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5627588033676147},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5179868936538696},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.49649912118911743},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.47791537642478943},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4778118431568146},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4669996500015259},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.46699681878089905},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.46311628818511963},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4616483747959137},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.45391303300857544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4379495680332184},{"id":"https://openalex.org/C109659709","wikidata":"https://www.wikidata.org/wiki/Q3407504","display_name":"Affinity propagation","level":5,"score":0.41024050116539},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10044-015-0527-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10044-015-0527-6","pdf_url":null,"source":{"id":"https://openalex.org/S45497385","display_name":"Pattern Analysis and Applications","issn_l":"1433-7541","issn":["1433-7541","1433-755X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Analysis and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W46659105","https://openalex.org/W65738273","https://openalex.org/W141581199","https://openalex.org/W1480376833","https://openalex.org/W1502916507","https://openalex.org/W1543003006","https://openalex.org/W1564583583","https://openalex.org/W1596382552","https://openalex.org/W1651093245","https://openalex.org/W2047555270","https://openalex.org/W2050206309","https://openalex.org/W2072240081","https://openalex.org/W2073459066","https://openalex.org/W2094535545","https://openalex.org/W2102524069","https://openalex.org/W2113227740","https://openalex.org/W2115657355","https://openalex.org/W2117284930","https://openalex.org/W2118269922","https://openalex.org/W2129070834","https://openalex.org/W2132824401","https://openalex.org/W2139956879","https://openalex.org/W2142827986","https://openalex.org/W2149906774","https://openalex.org/W2157092487","https://openalex.org/W2164068772","https://openalex.org/W2164456230","https://openalex.org/W2170531092","https://openalex.org/W2787894218","https://openalex.org/W2988864014","https://openalex.org/W3022351671","https://openalex.org/W3120740533","https://openalex.org/W3139328003","https://openalex.org/W3152290665","https://openalex.org/W4230521134","https://openalex.org/W4251391716","https://openalex.org/W4254240410"],"related_works":["https://openalex.org/W2519241726","https://openalex.org/W2375128115","https://openalex.org/W2125687350","https://openalex.org/W2182477562","https://openalex.org/W2169618946","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W4297819076","https://openalex.org/W2107754327","https://openalex.org/W2802487487"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}