16 citations · 35 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…