{"id":"https://openalex.org/W2572786489","doi":"https://doi.org/10.17706/jcp.12.2.105-115","title":"k-Expected Nearest Neighbor Search over Gaussian Objects","display_name":"k-Expected Nearest Neighbor Search over Gaussian Objects","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2572786489","doi":"https://doi.org/10.17706/jcp.12.2.105-115","mag":"2572786489"},"language":"en","primary_location":{"id":"doi:10.17706/jcp.12.2.105-115","is_oa":true,"landing_page_url":"https://doi.org/10.17706/jcp.12.2.105-115","pdf_url":"http://www.jcomputers.us/vol12/jcp1202-02.pdf","source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.jcomputers.us/vol12/jcp1202-02.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100524563","display_name":"Tingting Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tingting Dong","raw_affiliation_strings":["Department of Systems and Social Informatics, Nagoya University, Nagoya, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Social Informatics, Nagoya University, Nagoya, Aichi, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100524563"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00365694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9940999746322632,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7085961103439331},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6326689720153809},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5647031664848328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5487754940986633},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5167631506919861},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.46190980076789856},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.42962753772735596},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3672543466091156},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12417265772819519},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.057112038135528564}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7085961103439331},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6326689720153809},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5647031664848328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5487754940986633},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5167631506919861},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.46190980076789856},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.42962753772735596},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3672543466091156},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12417265772819519},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.057112038135528564},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.17706/jcp.12.2.105-115","is_oa":true,"landing_page_url":"https://doi.org/10.17706/jcp.12.2.105-115","pdf_url":"http://www.jcomputers.us/vol12/jcp1202-02.pdf","source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.17706/jcp.12.2.105-115","is_oa":true,"landing_page_url":"https://doi.org/10.17706/jcp.12.2.105-115","pdf_url":"http://www.jcomputers.us/vol12/jcp1202-02.pdf","source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2572786489.pdf","grobid_xml":"https://content.openalex.org/works/W2572786489.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1824657313","https://openalex.org/W2009086942","https://openalex.org/W2027675779","https://openalex.org/W2033626816","https://openalex.org/W2076287166","https://openalex.org/W2099700811","https://openalex.org/W2103895255","https://openalex.org/W2109436423","https://openalex.org/W2118462151","https://openalex.org/W2133246278","https://openalex.org/W2136046112","https://openalex.org/W2137298116","https://openalex.org/W2146485383","https://openalex.org/W2167140130","https://openalex.org/W2531454488","https://openalex.org/W2950563475","https://openalex.org/W4230946174","https://openalex.org/W4237271683","https://openalex.org/W4239146293","https://openalex.org/W4244343699","https://openalex.org/W6629510986","https://openalex.org/W6630096803","https://openalex.org/W6638373262","https://openalex.org/W6657299507","https://openalex.org/W6681470053","https://openalex.org/W6684412678","https://openalex.org/W6684820662"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2182477562","https://openalex.org/W2169618946","https://openalex.org/W2375128115","https://openalex.org/W2245581955","https://openalex.org/W2519241726","https://openalex.org/W2381195555","https://openalex.org/W1558159560","https://openalex.org/W4297819076","https://openalex.org/W1671890395"],"abstract_inverted_index":{"Probabilistic":[0],"location":[1,39,52,87,91,105],"information":[2,88],"has":[3,20,68],"been":[4,76],"attracting":[5],"more":[6,8],"and":[7,17,19,130,149,154],"attention":[9],"due":[10],"to":[11,36,63,80,89,166],"the":[12,42,48,54,96,101,116,132],"advances":[13],"in":[14,26,71,110],"computing":[15],"devices":[16],"technologies,":[18],"become":[21],"an":[22],"important":[23],"research":[24],"topic":[25],"recent":[27],"years.":[28],"In":[29],"particular,":[30],"Gaussian":[31,122,146],"distribution":[32],"is":[33,95,176],"frequently":[34],"used":[35],"represent":[37],"probabilistic":[38,90,104],"information.":[40,92,106],"On":[41],"other":[43],"hand,":[44],"as":[45],"one":[46],"of":[47,134,142,173],"commonest":[49],"queries":[50],"over":[51,85,103],"information,":[53],"distance-based":[55],"nearest":[56,82,136],"neighbor":[57,83,137],"search,":[58],"which":[59,99],"finds":[60],"closest":[61],"objects":[62,119],"a":[64],"given":[65],"query":[66],"point,":[67],"extensive":[69,179],"applications":[70],"various":[72],"areas.":[73],"There":[74],"have":[75],"considerable":[77],"efforts":[78],"made":[79],"extend":[81],"search":[84],"traditional":[86],"An":[93],"example":[94],"expected":[97,128,143],"distance,":[98],"defines":[100],"distance":[102,129,144],"Following":[107],"this":[108,111,169],"trend,":[109],"paper,":[112],"we":[113,161],"assume":[114],"that":[115],"closeness":[117],"between":[118],"represented":[120],"by":[121,126],"distributions":[123,147],"are":[124],"measured":[125],"their":[127],"consider":[131],"problem":[133],"k-expected":[135],"search.":[138],"We":[139],"analyze":[140],"properties":[141],"on":[145,158],"mathematically":[148],"derive":[150],"its":[151],"lower":[152],"bound":[153],"upper":[155],"bound.":[156],"Based":[157],"our":[159,174],"analysis,":[160],"propose":[162],"three":[163],"novel":[164],"approaches":[165,175],"efficiently":[167],"solve":[168],"problem.":[170],"The":[171],"efficiency":[172],"demonstrated":[177],"through":[178],"experiments.":[180]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}