{"id":"https://openalex.org/W1964799279","doi":"https://doi.org/10.1016/s0031-3203(98)00002-8","title":"CHARACTERIZATIONS OF NEAREST AND FARTHEST NEIGHBOR ALGORITHMS BY CLUSTERING ADMISSIBILITY CONDITIONS","display_name":"CHARACTERIZATIONS OF NEAREST AND FARTHEST NEIGHBOR ALGORITHMS BY CLUSTERING ADMISSIBILITY CONDITIONS","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W1964799279","doi":"https://doi.org/10.1016/s0031-3203(98)00002-8","mag":"1964799279"},"language":"en","primary_location":{"id":"doi:10.1016/s0031-3203(98)00002-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(98)00002-8","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","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/A5101862970","display_name":"Zhenmin Chen","orcid":"https://orcid.org/0000-0001-6348-6739"},"institutions":[{"id":"https://openalex.org/I19700959","display_name":"Florida International University","ror":"https://ror.org/02gz6gg07","country_code":"US","type":"education","lineage":["https://openalex.org/I19700959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ZHENMIN CHEN","raw_affiliation_strings":["Department of Statistics, Florida International University, Miami, FL 33 199, USA"],"affiliations":[{"raw_affiliation_string":"Department of Statistics, Florida International University, Miami, FL 33 199, USA","institution_ids":["https://openalex.org/I19700959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110094338","display_name":"John Van Ness","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOHN VAN NESS","raw_affiliation_strings":["Programs in Mathematical Sciences, University of Texas at Dallas, Richardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Programs in Mathematical Sciences, University of Texas at Dallas, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101862970"],"corresponding_institution_ids":["https://openalex.org/I19700959"],"apc_list":{"value":2710,"currency":"USD","value_usd":2710},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.10269271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"10","first_page":"1573","last_page":"1578"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9922000169754028,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9860000014305115,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7770575881004333},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7707055807113647},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6985369324684143},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.6225633025169373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5889906883239746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5882778167724609},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48093172907829285},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.380563348531723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31952497363090515},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24231067299842834},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.16104096174240112},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.15069100260734558},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0709027647972107}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7770575881004333},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7707055807113647},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6985369324684143},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.6225633025169373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5889906883239746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5882778167724609},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48093172907829285},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.380563348531723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31952497363090515},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24231067299842834},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.16104096174240112},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.15069100260734558},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0709027647972107},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0031-3203(98)00002-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(98)00002-8","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","raw_type":"journal-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/W2519241726","https://openalex.org/W2375128115","https://openalex.org/W2362413895","https://openalex.org/W2368415703","https://openalex.org/W2011582495","https://openalex.org/W2169618946","https://openalex.org/W2391642054","https://openalex.org/W2182477562","https://openalex.org/W1671890395","https://openalex.org/W4297819076"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}