{"id":"https://openalex.org/W2474743935","doi":"https://doi.org/10.1145/2835022.2835029","title":"Probabilistic Group Nearest Neighbors query based on Voronoi diagram","display_name":"Probabilistic Group Nearest Neighbors query based on Voronoi diagram","publication_year":2015,"publication_date":"2015-11-03","ids":{"openalex":"https://openalex.org/W2474743935","doi":"https://doi.org/10.1145/2835022.2835029","mag":"2474743935"},"language":"en","primary_location":{"id":"doi:10.1145/2835022.2835029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2835022.2835029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","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/A5103935146","display_name":"Weige Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weige Wang","raw_affiliation_strings":["School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031166307","display_name":"Jian Xu","orcid":"https://orcid.org/0000-0002-0583-5512"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Xu","raw_affiliation_strings":["School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041210918","display_name":"Ming Xu","orcid":"https://orcid.org/0000-0001-9332-5258"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming Xu","raw_affiliation_strings":["School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047378832","display_name":"Ning Zheng","orcid":"https://orcid.org/0000-0003-3503-8167"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ning Zheng","raw_affiliation_strings":["School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014552430","display_name":"Enquan Ge","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Enquan Ge","raw_affiliation_strings":["School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24388982,"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":"36","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.8518288135528564},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5744730830192566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5710591673851013},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5671833753585815},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.552038848400116},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5042341947555542},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4815973937511444},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47455722093582153},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3872191309928894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3680979609489441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33207473158836365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26791274547576904},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.19928544759750366}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8518288135528564},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5744730830192566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710591673851013},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5671833753585815},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.552038848400116},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5042341947555542},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4815973937511444},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47455722093582153},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3872191309928894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3680979609489441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33207473158836365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26791274547576904},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.19928544759750366},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"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.1145/2835022.2835029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2835022.2835029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W163639508","https://openalex.org/W1491547607","https://openalex.org/W1992419399","https://openalex.org/W2013333366","https://openalex.org/W2015396066","https://openalex.org/W2060700520","https://openalex.org/W2061122559","https://openalex.org/W2131796944","https://openalex.org/W2145814045","https://openalex.org/W2151135734","https://openalex.org/W2167956717","https://openalex.org/W2997027240","https://openalex.org/W4254420769"],"related_works":["https://openalex.org/W3020555194","https://openalex.org/W2793256277","https://openalex.org/W4360958759","https://openalex.org/W2348235448","https://openalex.org/W2116218375","https://openalex.org/W2389906634","https://openalex.org/W176898926","https://openalex.org/W288156810","https://openalex.org/W1562406979","https://openalex.org/W2962797788"],"abstract_inverted_index":{"In":[0,63],"order":[1],"to":[2,33,49,120,134],"solve":[3],"the":[4,36,51,58,77,84,88,91,97,102,109,117,135,141,150],"problem":[5],"of":[6,38,54,70,80,87,90,112,152],"probabilistic":[7],"group":[8,25],"nearest":[9,26,52],"neighbor":[10,27,53],"query":[11,28,55,92,162],"on":[12,21,29],"uncertain":[13,30,39,81,126],"data,":[14],"we":[15],"present":[16],"an":[17],"effective":[18],"method":[19],"based":[20],"Voronoi":[22,78],"diagram.":[23],"Probabilistic":[24],"data":[31],"is":[32,73],"find":[34],"out":[35],"set":[37,56,69,89,99,119],"objects,":[40],"in":[41,116],"which":[42,155],"each":[43,113],"object":[44,115],"has":[45,157],"a":[46,67],"higher":[47],"probability":[48,110],"be":[50,121],"than":[57,131],"threshold":[59,137],"specified":[60],"by":[61,75],"user.":[62],"this":[64],"paper,":[65],"first":[66],"candidate":[68,98,118],"target":[71,114],"objects":[72,82,127],"got":[74],"constructing":[76],"diagram":[79],"and":[83,147,160],"convex":[85],"hull":[86],"points.":[93],"Then":[94],"further":[95],"reduce":[96],"through":[100],"using":[101],"space":[103],"pruning":[104],"algorithm.":[105],"At":[106],"last,":[107],"calculate":[108],"value":[111],"GNN":[122],"result":[123,142],"exactly.":[124],"The":[125,144],"whose":[128],"probabilities":[129],"greater":[130],"or":[132],"equal":[133],"user-specified":[136],"are":[138],"put":[139],"into":[140],"set.":[143],"theoretical":[145],"analysis":[146],"experiments":[148],"show":[149],"effectiveness":[151],"our":[153],"algorithm,":[154],"also":[156],"good":[158],"performance":[159],"less":[161],"time.":[163]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}