{"id":"https://openalex.org/W4250412413","doi":"https://doi.org/10.1109/icpr.2004.1334569","title":"Direct condensing: an efficient Voronoi condensing algorithm for nearest neighbor classifiers","display_name":"Direct condensing: an efficient Voronoi condensing algorithm for nearest neighbor classifiers","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4250412413","doi":"https://doi.org/10.1109/icpr.2004.1334569"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2004.1334569","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334569","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059207457","display_name":"T. Kato","orcid":null},"institutions":[{"id":"https://openalex.org/I75198481","display_name":"Wakayama University","ror":"https://ror.org/05wr49d48","country_code":"JP","type":"education","lineage":["https://openalex.org/I75198481"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Kato","raw_affiliation_strings":["Department of Computer and Communication Science, Wakayama University, Wakayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Communication Science, Wakayama University, Wakayama, Japan","institution_ids":["https://openalex.org/I75198481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068654156","display_name":"T. Wada","orcid":null},"institutions":[{"id":"https://openalex.org/I75198481","display_name":"Wakayama University","ror":"https://ror.org/05wr49d48","country_code":"JP","type":"education","lineage":["https://openalex.org/I75198481"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Wada","raw_affiliation_strings":["Department of Computer and Communication Science, Wakayama University, Wakayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Communication Science, Wakayama University, Wakayama, Japan","institution_ids":["https://openalex.org/I75198481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I75198481"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.31516888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"474","last_page":"477 Vol.3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9998000264167786,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9998000264167786,"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.9936000108718872,"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/T12111","display_name":"Industrial Vision Systems and Defect Detection","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.9698013067245483},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7072269916534424},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6496078968048096},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.6222351789474487},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.588989794254303},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.5771986246109009},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5595812797546387},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.5163996815681458},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.48978090286254883},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.45581239461898804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42707958817481995},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.41933953762054443},{"id":"https://openalex.org/keywords/statistical-classification","display_name":"Statistical classification","score":0.4125683009624481},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3131036162376404},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.16009953618049622},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.147409588098526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08359798789024353},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05822718143463135}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9698013067245483},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7072269916534424},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6496078968048096},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.6222351789474487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.588989794254303},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.5771986246109009},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5595812797546387},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.5163996815681458},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48978090286254883},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.45581239461898804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42707958817481995},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.41933953762054443},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.4125683009624481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3131036162376404},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.16009953618049622},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.147409588098526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08359798789024353},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05822718143463135},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpr.2004.1334569","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334569","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","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":7,"referenced_works":["https://openalex.org/W1988790447","https://openalex.org/W1994410331","https://openalex.org/W2105306795","https://openalex.org/W2122111042","https://openalex.org/W2148603752","https://openalex.org/W2153504150","https://openalex.org/W2156546584"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2358559774","https://openalex.org/W2589681725","https://openalex.org/W2125687350","https://openalex.org/W4255472592","https://openalex.org/W2131082717","https://openalex.org/W2130238014","https://openalex.org/W1528158669","https://openalex.org/W2153860641","https://openalex.org/W1999866745"],"abstract_inverted_index":{"Voronoi":[0,53,95,118],"condensing":[1,54,96,99,115],"reduces":[2],"training":[3,72,109],"patterns":[4,42],"of":[5,82,108],"nearest":[6,23],"neighbor":[7,24],"classifiers":[8,25,31],"without":[9],"changing":[10],"the":[11,22,29,34,39,80,104],"classification":[12],"boundaries.":[13],"This":[14,63],"method":[15],"plays":[16],"important":[17],"roles":[18],"not":[19,102],"only":[20],"in":[21,28,46,58,121],"but":[26],"also":[27],"other":[30],"such":[32],"as":[33],"support":[35,44],"vector":[36],"machines,":[37],"because":[38,65],"resulting":[40],"prototype":[41],"involve":[43],"vectors":[45],"many":[47],"cases.":[48],"However,":[49],"previous":[50],"algorithms":[51],"for":[52,70,79,94],"were":[55],"computationally":[56],"inefficient":[57],"general":[59],"pattern":[60,83],"recognition":[61],"tasks.":[62],"is":[64],"they":[66],"use":[67],"proximity":[68,106],"graphs":[69,107],"entire":[71,105],"patterns,":[73],"which":[74],"require":[75,103],"computational":[76],"time":[77],"exponentially":[78],"dimension":[81,123],"space.":[84],"For":[85],"solving":[86],"this":[87],"problem,":[88],"we":[89],"proposed":[90],"an":[91],"efficient":[92],"algorithm":[93],"named":[97],"direct":[98,114],"that":[100,113],"does":[101],"patterns.":[110],"We":[111],"confirmed":[112],"efficiently":[116],"calculates":[117],"condensed":[119],"prototypes":[120],"high":[122],"(from":[124],"2":[125],"to":[126],"20":[127],"dimensions).":[128]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}