4 papers · 1 filter
Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
Yuanhang Yu, Dawei Cheng, Ying Zhang +3
Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numer…
HL-index: Fast Reachability Query in Hypergraphs
Peiting Xie, Xiangjun Zai, Yanping Wu +3
Reachability in hypergraphs is essential for modeling complex groupwise interactions in real-world applications such as co-authorship, social network, and biological analysis, wher…
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Yanping Wu, Renjie Sun, Xiaoyang Wang +4
Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, whic…
Efficient Influence Minimization via Node Blocking
Jinghao Wang, Yanping Wu, Xiaoyang Wang +4
Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spre…