16 citations · 35 across the 10 of their papers we have counts for
11 papers
Common-Neighbor-Count-Based Representative Possible World Finding on Uncertain Graphs
Chengjie Gu, Xiaoliang Xu, Yuxiang Wang +5
A representative possible world (RPW) is a deterministic graph derived from an uncertain graph where a designated structural feature closely approximates its expected…
Graph Similarity Computation via Interpretable Neural Node Alignment
Jingjing Wang, Hongjie Zhu, Haoran Xie +3
\Graph similarity computation is an essential task in many real-world graph-related applications such as retrieving the similar drugs given a query chemical compound or finding the…
Scalable Community Search with Accuracy Guarantee on Attributed Graphs
Yuxiang Wang, Shuzhan Ye, Xiaoliang Xu +4
Given an attributed graph and a query node , \underline{C}ommunity \underline{S}earch over \underline{A}ttributed \underline{G}raphs (CS-AG) aims to find a structure- and at…
Prompting Disentangled Embeddings for Knowledge Graph Completion with Pre-trained Language Model
Yuxia Geng, Jiaoyan Chen, Yuhang Zeng +5
Both graph structures and textual information play a critical role in Knowledge Graph Completion (KGC). With the success of Pre-trained Language Models (PLMs) such as BERT, they ha…
Routing-Guided Learned Product Quantization for Graph-Based Approximate Nearest Neighbor Search
Qiang Yue, Xiaoliang Xu, Yuxiang Wang +2
Given a vector dataset , a query vector , graph-based Approximate Nearest Neighbor Search (ANNS) aims to build a proximity graph (PG) as an index of $\mathc…
DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex
Jiongkang Ni, Xiaoliang Xu, Yuxiang Wang +4
Given a vector dataset and a query vector , graph-based Approximate Nearest Neighbor Search (ANNS) aims to build a graph index and approximately return…
Random Walk-based Community Key-members Search over Large Graphs
Yuxiang Wang, Yuyang Zhao, Xiaoliang Xu +3
Given a graph , a query node , and an integer , community search (CS) seeks a cohesive subgraph (measured by community models such as -core or -truss) from that…
Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints
Mengzhao Wang, Lingwei Lv, Xiaoliang Xu +3
As research interest surges, vector similarity search is applied in multiple fields, including data mining, computer vision, and information retrieval. {Given a set of objects (e.g…
Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling
Yuxiang Wang, Arijit Khan, Xiaoliang Xu +3
A knowledge graph (KG) manages large-scale and real-world facts as a big graph in a schema-flexible manner. Aggregate query is a fundamental query over KGs, e.g., "what is the aver…
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search
Mengzhao Wang, Xiaoliang Xu, Qiang Yue +1
Approximate nearest neighbor search (ANNS) constitutes an important operation in a multitude of applications, including recommendation systems, information retrieval, and pattern r…
Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs
Yuxiang Wang, Arijit Khan, Tianxing Wu +2
Recently, graph query is widely adopted for querying knowledge graphs. Given a query graph , the graph query finds subgraphs in a knowledge graph that exactly or approxima…