Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huang, Wei, Wang, Hanchen, Wen, Dong, Cao, Xin, Han, Bocheng, Zhang, Ying, Zhang, Wenjie
Format:	Preprint
Publié:	2026
Sujets:	Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
par: Chen, Liuyi, et autres
Publié: (2025)

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
par: Wu, Yanping, et autres
Publié: (2024)

Accelerating K-Core Computation in Temporal Graphs
par: Ma, Zhuo, et autres
Publié: (2025)

FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
par: Sharma, Akshit, et autres
Publié: (2024)

UniCom: Towards a Unified and Cohesiveness-aware Framework for Community Search and Detection
par: Zhu, Yifan, et autres
Publié: (2025)

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
par: Yang, Yi, et autres
Publié: (2025)

DIST: Efficient k-Clique Listing via Induced Subgraph Trie
par: Nam, Yehyun, et autres
Publié: (2025)

Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
par: Zhang, Yalong, et autres
Publié: (2025)

Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking
par: Wang, Yu, et autres
Publié: (2025)

S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
par: Wen, Qi, et autres
Publié: (2026)

Efficient Influence Minimization via Node Blocking
par: Wang, Jinghao, et autres
Publié: (2024)

Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
par: Ye, Yutong, et autres
Publié: (2024)

Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
par: He, Yizhang, et autres
Publié: (2025)

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
par: Shin, Wonseok, et autres
Publié: (2023)

A2RAG: Adaptive Agentic Graph Retrieval for Cost-Aware and Reliable Reasoning
par: Liu, Jiate, et autres
Publié: (2026)

Top-k Representative Search for Comparative Tree Summarization
par: Chen, Yuqi, et autres
Publié: (2024)

Efficient Antagonistic k-plex Enumeration in Signed Graphs
par: Xu, Lantian, et autres
Publié: (2024)

Accelerating Historical K-Core Search in Temporal Graphs
par: Ma, Zhuo, et autres
Publié: (2025)

NeuSO: Neural Optimizer for Subgraph Queries
par: Yang, Linglin, et autres
Publié: (2025)

Efficient Unsupervised Community Search with Pre-trained Graph Transformer
par: Wang, Jianwei, et autres
Publié: (2024)

Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs
par: Xu, Lantian, et autres
Publié: (2026)

Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
par: Ye, Yutong, et autres
Publié: (2023)

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
par: Yu, Yuanhang, et autres
Publié: (2026)

Deep Overlapping Community Search via Subspace Embedding
par: Sima, Qing, et autres
Publié: (2024)

CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
par: Yang, Linglin, et autres
Publié: (2026)

HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery
par: Liu, Shiyuan, et autres
Publié: (2026)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

Hidden Sketch: A Space-Efficient Reversible Sketch for Tracking Frequent Items in Data Streams
par: Xu, Zicang, et autres
Publié: (2025)

Top-k Approximate Functional Dependency Discovery
par: Wan, Xiaolong, et autres
Publié: (2026)

LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
par: Ye, Yutong, et autres
Publié: (2026)

TKG-Thinker: Towards Dynamic Reasoning over Temporal Knowledge Graphs via Agentic Reinforcement Learning
par: Jiang, Zihao, et autres
Publié: (2026)

Representation Learning for Frequent Subgraph Mining
par: Ying, Rex, et autres
Publié: (2024)

gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
par: Chen, Weitian, et autres
Publié: (2026)

Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
par: Deeds, Kyle, et autres
Publié: (2024)

GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
par: Ge, Mingchang, et autres
Publié: (2025)

KnobTree: Intelligent Database Parameter Configuration via Explainable Reinforcement Learning
par: Chen, Jiahan, et autres
Publié: (2024)

Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification
par: Huang, Wei, et autres
Publié: (2026)

ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs
par: Yuan, Zhiqiu, et autres
Publié: (2025)

ACE: A Cardinality Estimator for Set-Valued Queries
par: Sheng, Yufan, et autres
Publié: (2025)

Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs (Technical Report)
par: Jiang, Jiaxin, et autres
Publié: (2025)