160 citations · 272 across the 18 of their papers we have counts for
6 papers · 1 filter
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,…
ISO-RAG: Isoperimetric Noise Control for Retrieval-Augmented Generation
Siyuan Zhang, Hanchen Wang, Dong Wen +2
Retrieval-Augmented Generation (RAG) mitigates large language models (LLMs) hallucinations, yet conventional dense retrieval struggles with the complex reasoning paths of multi-hop…
Algebraic Subgraph Counting
Qiuyu Guo, Jianye Yang, Wenjie Zhang +3
Subgraph isomorphism counting is a fundamental problem in graph analytics, which aims to find the number of subgraph isomorphisms of a query graph in a data graph. The candidate tr…
GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model
Shaozhen Ma, Wei Huang, Hanchen Wang +2
Conditional generative models, particularly diffusion-based methods, have recently been applied to graph prediction by modeling the target as a conditional distribution given the i…
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
Wei Huang, Hanchen Wang, Dong Wen +4
Identifying the most frequent induced subgraph of size in a target graph is a fundamental graph mining problem with direct implications for Web-related data mining and social n…
Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification
Wei Huang, Hanchen Wang, Dong Wen +1
The Traveling Salesman Problem (TSP) is one of the most representative NP-hard problems in route planning and a long-standing benchmark in combinatorial optimization. Traditional h…