Hanchen Wang
  • About
  • News
  • Publications
  • Academic Services
  • Supervision
    • 🧑‍🎓 Supervision
    • Full List
    • Current Ph.D.
    • Current MPhil
  • More about me
  • Supervision
  • Projects
    • Pandas
    • PyTorch
    • scikit-learn
  • News
    • 🎉 Agentic AI Survey & ICDE 2026 Tutorial
    • 🎉 One paper accepted by ICML 2026
    • 🎉 One paper accepted by TKDE 2026
    • 🎉 One paper accepted by EDBT 2026
    • 🎉 One paper accepted by Information Sciences
    • 🎉 One paper accepted by NeurIPS 2025
    • 🎉 One paper accepted by CIKM 2025
    • 🎉 VLDB Tutorial
    • 🎉 One paper accepted by VLDB 2025
    • 🎉 New Position at UTS
    • 🎉 One paper accepted by ICDE 2025
  • Publications
    • Data-Centric Foundations of Agentic AI
    • Towards Generative Graph Matching for Graph Edit Distance Computation
    • MGDN: A Graph of Graphs Neural Network for Malware Detection
    • Data in Agentic AI: A Comprehensive Survey
    • Accelerating K-Core Computation in Temporal Graphs
    • Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification
    • Finding critical users in social networks with reinforcement learning
    • RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
    • Give Me Some SALT: Structure-Aware Link Modeling for Temporal Weighted Link Prediction
    • Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN
    • Machine Learning for Graph Data Management and Query Processing
    • Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning based Approach
    • Structure and Position-Aware Graph Modeling for Trajectory Similarity Computation Over Road Networks
    • Predicting Membrane Fouling of Submerged Membrane Bioreactor Wastewater Treatment Plants Using Machine Learning
    • AIGC for Graphs: Current Techniques and Future Trends
    • Covering K-Cliques in Billion-Scale Graphs
    • DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching
    • AI-Empowered Catalyst Discovery: A Survey from Classical Machine Learning Approaches to Large Language Models
    • Inferring gene regulatory networks by hypergraph generative model
    • RIDA: a robust attack framework on incomplete graphs
    • Bridging Large Language Models and Graph Structure Learning Models for Robust Representation Learning
    • Temporal Insights for Group-Based Fraud Detection on e-Commerce Platforms
    • Deep Learning Approaches for Similarity Computation: A Survey
    • Bipartite Graph Analytics: Current Techniques and Future Trends
    • Simple and Deep Graph Attention Networks
    • STG-Mamba: Spatial-Temporal Graph Learning via Selective State Space Model
    • Influence Maximization on Hypergraphs via Multi-Hop Influence Estimation
    • GQ*: Towards Generalizable Deep Q-Learning for Steiner Tree in Graphs
    • TIformer: A Transformer-Based Framework for Time-Series Forecasting with Missing Data
    • FPGN: follower prediction framework for infectious disease prevention
    • Group-based Fraud Detection Network on e-Commerce Platforms
    • Denoising Variational Graph of Graphs Auto-Encoder for Predicting Structured Entity Interactions
    • Neural Similarity Search on Supergraph Containment
    • TMN: Trajectory Matching Networks for Learning Similarity Computation
    • Neural Subgraph Counting with Wasserstein Estimator
    • Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
    • Polarity-based Graph Neural Network for Sign Prediction in Signed Bipartite Graphs
    • Bipartite Graph Capsule Network
    • Powerful Graph of Graphs Neural Network for Structured Entity Analysis
    • Binarized Graph Neural Network
    • T3S: Effective Representation Learning for Trajectory Similarity Computation
    • EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search
    • GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
    • I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space
    • Skyline Nearest Neighbor Search on Multi-layer Graphs
    • I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space
  • Students
    • Jianke Yu
    • Xinyi Li
    • Yifan Zhu
    • Yunyi Zhu
    • Han Chen
    • Jueying Huang
    • Shenghao Xu
    • Xulu Gong
    • Zhouyang Xie
    • Runze Li
    • Wei Huang
    • Zuocheng Ding
    • Yijia Mi
    • Yuxin Jin
    • Shaozhen Ma
    • Shulun Chen
    • Kuiye Ding
    • Yuanyuan Zhou
    • Shiqi Yang
    • Yang Yang
    • Zhehao Dai
    • Guangxin Su
    • Yiheng Hu
    • Xingbo Du
    • Dejun Kong
    • Jiadong Chen
    • Xiaoxian Liu
    • Guangjian Zhang
    • Xingyu Tan
    • Mengting Pan
  • Teaching
    • Learn JavaScript
    • Learn Python

RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning

Jan 1, 2026·
Wei Huang
Hanchen Wang
Hanchen Wang
,
Dong Wen
,
Xin Cao
,
Ying Zhang
,
Wenjie Zhang
· 0 min read
DOI URL
Type
Journal article
Publication
CoRR (Preprint)
Last updated on May 18, 2026
Hanchen Wang
Authors
Hanchen Wang
ARC DECRA Fellow, Lecturer
← Finding critical users in social networks with reinforcement learning Jan 1, 2026
Give Me Some SALT: Structure-Aware Link Modeling for Temporal Weighted Link Prediction Oct 1, 2025 →

© 2026 Hanchen Wang. This work is licensed under CC BY NC ND 4.0

Published with Hugo Blox Builder — the free, open source website builder that empowers creators.