1 citations · 1 across the 21 of their papers we have counts for
5 papers · 1 filter
MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
Xiaowei Ye, Rong-Hua Li, Guoren Wang +3
Approximate Nearest Neighbor Search with arbitrary filtering predicates (AFANNS) is essential for modern data applications, yet existing methods often incur substantial storage and…
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
Zhiqiu Zou, Ziqi Yin, Rong-Hua Li +3
Range-filtered approximate nearest neighbor (RFANN) search is a fundamental operation in modern data systems. Given a set of objects, each with a vector and a numerical attribute,…
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…
Efficient Antagonistic k-plex Enumeration in Signed Graphs
Lantian Xu, Rong-Hua Li, Dong Wen +3
A signed graph is a graph where each edge receives a sign, positive or negative. The signed graph model has been used in many real applications, such as protein complex discovery a…
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…