{"id":"https://openalex.org/W4415250884","doi":"https://doi.org/10.1109/hpec67600.2025.11196273","title":"A Locality Sensitive Hashing Based Algorithm to Accelerate Neighborhood Search in Graph Neural Operators","display_name":"A Locality Sensitive Hashing Based Algorithm to Accelerate Neighborhood Search in Graph Neural Operators","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250884","doi":"https://doi.org/10.1109/hpec67600.2025.11196273"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5044692723","display_name":"Muhammad Mudassar Hassan","orcid":"https://orcid.org/0000-0002-2780-0820"},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mariam Hassan","raw_affiliation_strings":["Case Western Reserve University,Department of Computer and Data Sciences"],"affiliations":[{"raw_affiliation_string":"Case Western Reserve University,Department of Computer and Data Sciences","institution_ids":["https://openalex.org/I58956616"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114285330","display_name":"Sanmukh Kuppannagari","orcid":null},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanmukh Kuppannagari","raw_affiliation_strings":["Case Western Reserve University,Department of Computer and Data Sciences"],"affiliations":[{"raw_affiliation_string":"Case Western Reserve University,Department of Computer and Data Sciences","institution_ids":["https://openalex.org/I58956616"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044692723"],"corresponding_institution_ids":["https://openalex.org/I58956616"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3065673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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.9984999895095825,"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.9984999895095825,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9855999946594238,"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9656000137329102,"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/hash-function","display_name":"Hash function","score":0.6004999876022339},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.5432000160217285},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5422000288963318},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5206000208854675},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4950000047683716},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4821000099182129},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.46720001101493835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46470001339912415},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4584999978542328}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6952000260353088},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6004999876022339},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5432000160217285},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5422000288963318},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5206000208854675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5192000269889832},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4950000047683716},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4821000099182129},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45750001072883606},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.3675000071525574},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.35910001397132874},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.3443000018596649},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30880001187324524},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2847999930381775},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.2587999999523163},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1968781463","https://openalex.org/W2147717514","https://openalex.org/W2604946233","https://openalex.org/W4394578532"],"related_works":[],"abstract_inverted_index":{"Neural":[0,14],"Operators":[1,15],"extend":[2],"traditional":[3],"neural":[4],"networks":[5],"to":[6,47,132],"learn":[7],"mappings":[8],"between":[9,80],"infinite-dimensional":[10],"function":[11],"spaces.":[12],"Graph":[13],"(GNOs),":[16],"which":[17,84],"operate":[18],"on":[19,76],"geometric":[20],"structures,":[21],"have":[22],"shown":[23],"strong":[24],"performance":[25],"in":[26,124],"learning":[27],"such":[28],"mappings,":[29],"particularly":[30],"for":[31,66,119,145],"solving":[32],"partial":[33],"differential":[34],"equations":[35],"(PDEs).":[36],"These":[37],"models":[38],"employ":[39],"message":[40],"passing":[41],"as":[42,73,86],"part":[43],"of":[44,95,157],"their":[45],"architecture":[46],"aggregate":[48],"information":[49],"from":[50],"neighboring":[51,68],"nodes,":[52],"followed":[53],"by":[54],"a":[55,105,138,155],"transformation":[56],"step":[57],"that":[58,107],"updates":[59],"node":[60,82,135],"representations.":[61],"However,":[62],"the":[63,93,112,142],"current":[64],"approach":[65],"identifying":[67],"nodes":[69],"is":[70,92],"computationally":[71],"expensive,":[72],"it":[74],"relies":[75],"pairwise":[77],"distance":[78],"calculations":[79],"all":[81],"pairs,":[83],"scales":[85],"O(N<sup":[87],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[88],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>)":[89],"where":[90],"N":[91],"number":[94],"nodes.":[96],"To":[97],"address":[98],"this,":[99],"we":[100],"leverage":[101],"locality-sensitive":[102],"hashing":[103],"(LSH),":[104],"technique":[106],"hashes":[108],"nearby":[109],"points":[110],"into":[111],"same":[113],"bucket":[114],"with":[115],"high":[116],"probability,":[117],"allowing":[118],"approximate":[120],"nearest":[121],"neighbor":[122],"search":[123],"O(N)":[125],"time.":[126],"We":[127],"develop":[128],"an":[129],"LSH-based":[130],"algorithm":[131],"efficiently":[133],"identify":[134],"pairs":[136],"within":[137],"given":[139],"radius,":[140],"reducing":[141],"preprocessing":[143],"time":[144],"graph":[146],"construction.":[147],"Our":[148],"method":[149],"significantly":[150],"accelerates":[151],"neighborhood":[152],"search,":[153],"achieving":[154],"speedup":[156],"29%.":[158]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-16T00:00:00"}