{"id":"https://openalex.org/W1997684205","doi":"https://doi.org/10.1109/fuzz-ieee.2012.6250773","title":"Improvement by sorting and thresholding in PCA based nearest neighbor search","display_name":"Improvement by sorting and thresholding in PCA based nearest neighbor search","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1997684205","doi":"https://doi.org/10.1109/fuzz-ieee.2012.6250773","mag":"1997684205"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz-ieee.2012.6250773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2012.6250773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Fuzzy Systems","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/A5111906720","display_name":"Hidetomo Ichihashi","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hidetomo Ichihashi","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]},{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061112446","display_name":"Toshiro Ogita","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiro Ogita","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]},{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065073668","display_name":"Katsuhiro Honda","orcid":"https://orcid.org/0000-0001-9080-5942"},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Katsuhiro Honda","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]},{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068927261","display_name":"Akira Notsu","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akira Notsu","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]},{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan","institution_ids":["https://openalex.org/I15807432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111906720"],"corresponding_institution_ids":["https://openalex.org/I15807432"],"apc_list":null,"apc_paid":null,"fwci":0.5491,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66614646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9995999932289124,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9937999844551086,"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/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.6914218664169312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6396228671073914},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6213019490242004},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5625836849212646},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5481557846069336},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5475581288337708},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.5247312188148499},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5078900456428528},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4881630539894104},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.48056891560554504},{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.4659396708011627},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4388354420661926},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4251660704612732},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4220000207424164},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.4200233519077301},{"id":"https://openalex.org/keywords/principal-component-analysis","display_name":"Principal component analysis","score":0.4188993573188782},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41013550758361816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40417715907096863},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.40279489755630493},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.363246887922287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3001422882080078},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.20660534501075745},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.10248354077339172},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08621245622634888}],"concepts":[{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.6914218664169312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6396228671073914},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6213019490242004},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5625836849212646},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5481557846069336},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5475581288337708},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5247312188148499},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5078900456428528},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4881630539894104},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.48056891560554504},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.4659396708011627},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4388354420661926},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4251660704612732},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4220000207424164},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.4200233519077301},{"id":"https://openalex.org/C27438332","wikidata":"https://www.wikidata.org/wiki/Q2873","display_name":"Principal component analysis","level":2,"score":0.4188993573188782},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41013550758361816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40417715907096863},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.40279489755630493},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.363246887922287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3001422882080078},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.20660534501075745},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.10248354077339172},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08621245622634888},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fuzz-ieee.2012.6250773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2012.6250773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Fuzzy Systems","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":15,"referenced_works":["https://openalex.org/W1496508106","https://openalex.org/W2024668293","https://openalex.org/W2038276547","https://openalex.org/W2090398718","https://openalex.org/W2097021296","https://openalex.org/W2097921974","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2162555381","https://openalex.org/W2165558283","https://openalex.org/W2293597654","https://openalex.org/W2427881153","https://openalex.org/W6629717046","https://openalex.org/W6674878074","https://openalex.org/W6697214482"],"related_works":["https://openalex.org/W1558159560","https://openalex.org/W2182477562","https://openalex.org/W2245581955","https://openalex.org/W2375128115","https://openalex.org/W4246757943","https://openalex.org/W2902799860","https://openalex.org/W3096071782","https://openalex.org/W4289129280","https://openalex.org/W50423144","https://openalex.org/W2045263322"],"abstract_inverted_index":{"This":[0],"paper":[1,205],"proposes":[2],"a":[3,44,47,59,63,113,162],"revised":[4,180],"algorithm":[5,56],"of":[6,30,46,150,174,178],"the":[7,13,24,27,52,55,70,76,81,94,100,110,122,129,136,144,147,172,186,192,214],"nearest":[8,71,158],"neighbor":[9,72],"searching":[10],"(NNS)":[11],"with":[12,171,218],"PCA":[14],"based":[15],"binary":[16,49],"tree":[17,198],"data":[18,111,137],"structure":[19],"by":[20,26,99,108,128],"Sproull":[21],"[1].":[22],"In":[23,51],"PCA-tree,":[25],"successive":[28],"use":[29],"principal":[31],"component":[32],"analysis":[33],"(PCA),":[34],"database":[35],"is":[36,66,83,106,166,182],"partitioned":[37],"into":[38,138],"clusters.":[39],"A":[40],"cluster":[41],"corresponds":[42],"to":[43,68,92,116,143,169],"node":[45,82,115,118],"complete":[48],"tree.":[50],"search":[53,78],"step,":[54],"first":[57],"choses":[58],"leaf":[60,86,114,117,139],"node,":[61],"i.e.,":[62],"cluster,":[64],"which":[65,88],"likely":[67,91],"include":[69,93],"(NN)":[73],"point.":[74],"Then":[75],"exhaustive":[77],"only":[79,184],"in":[80,146,156,185,191,203],"done.":[84],"Other":[85],"nodes":[87,127,140],"are":[89,97],"also":[90,190],"NN":[95,151],"point":[96],"searched":[98],"back":[101],"tracking":[102],"approach.":[103],"The":[104,153,176,196],"performance":[105],"improved":[107],"sorting":[109],"on":[112],"basis":[119],"and":[120,161],"updating":[121,155],"threshold":[123,154,164],"value":[124],"for":[125,227],"choosing":[126],"minimum":[130],"distance":[131],"found":[132],"so":[133],"far.":[134],"Sorting":[135],"contributes":[141],"greatly":[142],"improvement":[145],"detection":[148,187],"time":[149,188],"points.":[152],"\u03b5-approximate":[157],"neighbors":[159],"approach":[160,165,181,199],"fixed":[163],"enough":[167],"efficient":[168],"cope":[170],"deterioration":[173],"accuracy.":[175],"advantage":[177],"our":[179],"not":[183,207],"but":[189],"computer":[193],"memory":[194],"usage.":[195],"k-dimensional":[197],"[2],":[200],"[3]":[201],"used":[202],"this":[204],"does":[206],"need":[208,223],"large":[209,225,228],"sized":[210,229],"additional":[211],"tables,":[212],"whereas":[213],"popular":[215],"NNS":[216],"algorithms":[217],"multiple":[219],"hash":[220],"functions":[221],"method":[222],"significantly":[224],"tables":[226],"databases.":[230]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}