activity
20242026
most citedAI-Empowered Catalyst Discovery: A Survey from Classical Machine Learning Approaches to Large Language Models

3 citations · 5 across the 8 of their papers we have counts for

collaborators

9 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

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…

cs.DB2026

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…

cs.SI2025

UniCom: Towards a Unified and Cohesiveness-aware Framework for Community Search and Detection

Yifan Zhu, Hanchen Wang, Wenjie Zhang +2

Searching and detecting communities in real-world graphs underpins a wide range of applications. Despite the success achieved, current learning-based solutions regard community sea…

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.SI2025

WOCD: A Semi-Supervised Method for Overlapping Community Detection Using Weak Cliques

Shaozhen Ma, Hanchen Wang, Dong Wen +3

Overlapping community detection (OCD) is a fundamental graph data analysis task for extracting graph patterns. Traditional OCD methods can be broadly divided into node clustering a…

cs.CE2025★ 3 cited

AI-Empowered Catalyst Discovery: A Survey from Classical Machine Learning Approaches to Large Language Models

Yuanyuan Xu, Hanchen Wang, Wenjie Zhang +6

Catalysts are essential for accelerating chemical reactions and enhancing selectivity, which is crucial for the sustainable production of energy, materials, and bioactive compounds…

cs.LG2024★ 1 cited

Bridging Large Language Models and Graph Structure Learning Models for Robust Representation Learning

Guangxin Su, Yifan Zhu, Wenjie Zhang +2

Graph representation learning, involving both node features and graph structures, is crucial for real-world applications but often encounters pervasive noise. State-of-the-art meth…

cs.LG2024★ 1 cited

RIDA: A Robust Attack Framework on Incomplete Graphs

Jianke Yu, Hanchen Wang, Chen Chen +5

Graph Neural Networks (GNNs) are vital in data science but are increasingly susceptible to adversarial attacks. To help researchers develop more robust GNN models, it's essential t…