1 citations · 2 across the 7 of their papers we have counts for
8 papers
Efficient Graph Indexing for Interval-Aware Vector Search
Siyuan Liang, Ziqi Yin, Qi Zhang +5
Interval-aware Approximate Nearest Neighbor (ANN) search arises in applications where each object is associated with a numeric value or interval, and queries must satisfy both vect…
Optimal -Dense Subgraph Search in Bipartite Graphs
Yalong Zhang, Rong-Hua Li, Qi Zhang +1
Dense subgraph search in bipartite graphs is a fundamental problem in graph analysis, with wide-ranging applications in fraud detection, recommendation systems, and social network…
When LLMs meet open-world graph learning: a new perspective for unlabeled data uncertainty
Yanzhe Wen, Xunkai Li, Qi Zhang +4
Recently, large language models (LLMs) have significantly advanced text-attributed graph (TAG) learning. However, existing methods inadequately handle data uncertainty in open-worl…
Scalable -clique Densest Subgraph Search
Xiaowei Ye, Miao Qiao, Rong-Hua Li +2
In this paper, we present a collection of novel and scalable algorithms designed to tackle the challenges inherent in the -clique densest subgraph problem (\kcdsp) within networ…
Efficient Maximum Fair Clique Search over Large Networks
Qi Zhang, Rong-Hua Li, Zifan Zheng +3
Mining cohesive subgraphs in attributed graphs is an essential problem in the domain of graph data analysis. The integration of fairness considerations significantly fuels interest…
Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs
Ziqi Yin, Qi Zhang, Wentao Zhang +2
Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and al…
Efficient Top-k Ego-Betweenness Search
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Betweenness centrality, measured by the number of times a vertex occurs on all shortest paths of a graph, has been recognized as a key indicator for the importance of a vertex in t…
Fairness-aware Maximal Clique in Large Graphs: Concepts and Algorithms
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Cohesive subgraph mining on attributed graphs is a fundamental problem in graph data analysis. Existing cohesive subgraph mining algorithms on attributed graphs do not consider the…