activity
20242026
collaborators

8 papers

cs.CR2026

HYDRA: Proactive Android Malware Drift Adaptation via Hierarchical Graph Contrastive Learning

Han Chen, Hanchen Wang, Hongmei Chen +3

Concept drift, driven by the rapid evolution of Android malware, severely degrades the performance of machine learning detectors. Current adaptation strategies are often reactive,…

cs.AI2026

EXG: Self-Evolving Agents with Experience Graphs

Yuxin Jin, Siyuan Zhang, Hanchen Wang +3

Large language model (LLM)-based agents have demonstrated strong capabilities in complex reasoning and problem solving through multi-step interactions, yet most deployed agents rem…

cs.DB2026

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…

cs.CL2026

HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery

Shiyuan Liu, Jianwei Wang, Xuemin Lin +3

As a pivotal task in data lake management, joinable table discovery has attracted widespread interest. While existing language model-based methods achieve remarkable performance by…

cs.DB2025

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…

cs.LG2025

HiGraph: A Large-Scale Hierarchical Graph Dataset for Malware Analysis

Han Chen, Hanchen Wang, Hongmei Chen +3

The advancement of graph-based malware analysis is critically limited by the absence of large-scale datasets that capture the inherent hierarchical structure of software. Existing…

cs.DB2024

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…

cs.DB2024

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…