{"id":"https://openalex.org/W7140145247","doi":"https://doi.org/10.1109/tkde.2026.3676380","title":"Scalable Similarity Search Over Large Attributed Bipartite Graphs","display_name":"Scalable Similarity Search Over Large Attributed Bipartite Graphs","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140145247","doi":"https://doi.org/10.1109/tkde.2026.3676380"},"language":null,"primary_location":{"id":"doi:10.1109/tkde.2026.3676380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2026.3676380","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5019722977","display_name":"Xi Ou","orcid":null},"institutions":[{"id":"https://openalex.org/I142108993","display_name":"Southwest University","ror":"https://ror.org/01kj4z117","country_code":"CN","type":"education","lineage":["https://openalex.org/I142108993"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xi Ou","raw_affiliation_strings":["College of Computer and Information Science, Southwest University, Chongqing, China"],"raw_orcid":"https://orcid.org/0009-0005-4818-2899","affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Southwest University, Chongqing, China","institution_ids":["https://openalex.org/I142108993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130393383","display_name":"Longlong Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I142108993","display_name":"Southwest University","ror":"https://ror.org/01kj4z117","country_code":"CN","type":"education","lineage":["https://openalex.org/I142108993"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longlong Lin","raw_affiliation_strings":["College of Computer and Information Science, Southwest University, Chongqing, China"],"raw_orcid":"https://orcid.org/0000-0002-2194-8146","affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Southwest University, Chongqing, China","institution_ids":["https://openalex.org/I142108993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101397036","display_name":"Zeli Wang","orcid":"https://orcid.org/0000-0002-5053-5201"},"institutions":[{"id":"https://openalex.org/I10535382","display_name":"Chongqing University of Posts and Telecommunications","ror":"https://ror.org/03dgaqz26","country_code":"CN","type":"education","lineage":["https://openalex.org/I10535382"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zeli Wang","raw_affiliation_strings":["Chongqing University of Posts and Telecommunications, Chongqing, China"],"raw_orcid":"https://orcid.org/0000-0002-5053-5201","affiliations":[{"raw_affiliation_string":"Chongqing University of Posts and Telecommunications, Chongqing, China","institution_ids":["https://openalex.org/I10535382"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024499331","display_name":"Pingpeng Yuan","orcid":"https://orcid.org/0000-0002-1656-5634"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pingpeng Yuan","raw_affiliation_strings":["School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rong-Hua Li","orcid":"https://orcid.org/0000-0001-8658-6599"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong-Hua Li","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-8658-6599","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"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":0,"citation_normalized_percentile":{"value":0.38919792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"5","first_page":"3080","last_page":"3094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.46230000257492065,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.46230000257492065,"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.14010000228881836,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.050999999046325684,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7236999869346619},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5415999889373779},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.44179999828338623},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.430400013923645},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.302700012922287},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.29319998621940613}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7236999869346619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7056000232696533},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5415999889373779},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4542999863624573},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336899995803833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3142000138759613},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C143271835","wikidata":"https://www.wikidata.org/wiki/Q254515","display_name":"Similitude","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26260000467300415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2621999979019165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2026.3676380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2026.3676380","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6195402092","display_name":null,"funder_award_id":"62402399","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bipartite":[0],"graphs":[1,65,90,140],"are":[2,15],"widely":[3],"used":[4],"to":[5,30,56,68,75,119],"model":[6,117],"relationships":[7],"between":[8],"entities":[9],"of":[10,63,93,97,99,168,173],"different":[11],"types,":[12],"where":[13],"nodes":[14,28,94],"divided":[16],"into":[17],"two":[18,148],"disjoint":[19],"sets.":[20],"Similarity":[21],"search,":[22],"a":[23,31,36,113],"fundamental":[24],"operation":[25],"that":[26],"retrieves":[27],"similar":[29],"given":[32],"query":[33],"node,":[34],"plays":[35],"crucial":[37],"role":[38],"in":[39],"various":[40],"real-world":[41,161],"applications,":[42],"including":[43],"machine":[44],"learning":[45],"and":[46,95,128,146,162,170],"graph":[47],"clustering.":[48],"However,":[49],"existing":[50],"state":[51],"of-the-art":[52],"methods":[53],"often":[54],"struggle":[55],"accurately":[57],"capture":[58],"the":[59,70,123,134,166,171],"unique":[60],"structural":[61],"properties":[62],"bipartite":[64,125,139],"or":[66],"fail":[67],"incorporate":[69],"informative":[71],"node":[72],"attributes,":[73],"leading":[74],"suboptimal":[76],"performance.":[77],"Besides,":[78],"their":[79],"high":[80],"computational":[81],"complexity":[82],"limits":[83],"scalability,":[84],"making":[85],"them":[86],"impractical":[87],"for":[88],"large":[89],"with":[91,153,179],"millions":[92],"tens":[96],"thousands":[98],"attributes.":[100],"To":[101],"overcome":[102],"these":[103],"challenges,":[104],"we":[105],"first":[106],"introduce":[107],"Attribute-augmented":[108],"Hidden":[109],"Personalized":[110],"PageRank":[111],"(AHPP),":[112],"novel":[114],"random":[115],"walk":[116],"designed":[118],"blend":[120],"seamlessly":[121],"both":[122],"higher-order":[124],"structure":[126],"proximity":[127],"attribute":[129],"similarity.":[130],"We":[131],"then":[132],"formulate":[133],"similarity":[135],"search":[136],"over":[137],"attributed":[138],"as":[141],"an":[142],"approximate":[143],"AHPP":[144,169],"problem":[145],"propose":[147],"efficient":[149],"push-style":[150],"local":[151],"algorithms":[152,176],"provable":[154],"approximation":[155],"guarantees.":[156],"Finally,":[157],"extensive":[158],"experiments":[159],"on":[160],"synthetic":[163],"datasets":[164],"validate":[165],"effectiveness":[167],"efficiency":[172],"our":[174],"proposed":[175],"when":[177],"compared":[178],"fifteen":[180],"competitors.":[181]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-24T00:00:00"}