124 citations · 183 across the 19 of their papers we have counts for
14 papers
Efficient Non-Learning Similar Subtrajectory Search
Jiabao Jin, Peng Cheng, Lei Chen +2
Similar subtrajectory search is a finer-grained operator that can better capture the similarities between one query trajectory and a portion of a data trajectory than the tradition…
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
Qingshuai Feng, You Peng, Wenjie Zhang +2
The widespread use of graph data in various applications and the highly dynamic nature of today's networks have made it imperative to analyze structural trends in dynamic graphs on…
Unleashing the Potential of Unsupervised Deep Outlier Detection through Automated Training Stopping
Yihong Huang, Yuang Zhang, Liping Wang +1
Outlier detection (OD) has received continuous research interests due to its wide applications. With the development of deep learning, increasingly deep OD algorithms are proposed.…
Towards Generating Hop-constrained s-t Simple Path Graphs
Yuzheng Cai, Siyuan Liu, Weiguo Zheng +1
Graphs have been widely used in real-world applications, in which investigating relations between vertices is an important task. In this paper, we study the problem of generating t…
Minimizing the Influence of Misinformation via Vertex Blocking
Jiadong Xie, Fan Zhang, Kai Wang +2
Information cascade in online social networks can be rather negative, e.g., the spread of rumors may trigger panic. To limit the influence of misinformation in an effective and eff…
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
Zhengyi Yang, Wenjie Zhang, Xuemin Lin +2
Hypergraphs are generalisation of graphs in which a hyperedge can connect any number of vertices. It can describe n-ary relationships and high-order information among entities comp…