RLMiner: 通过强化学习寻找最频繁的k-sized子图
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
AI总结:
RLMiner通过强化学习和任务状态感知图神经网络,高效寻找最频繁的k-sized子图,提升计算效率和稳定性。
摘要:
识别目标图中大小为k的最频繁诱导子图是一个基础的图挖掘问题,对网络相关数据挖掘和社会网络分析有直接的影响。尽管其重要性,找到最频繁的诱导子图仍然计算成本很高,因为子图计数任务具有NP难的性质。传统精确枚举算法往往面临高时间复杂度,尤其是当图的大小k很大时。为缓解这一问题,现有方法通常利用频率测量与向下闭包性质来减少搜索空间,对任务施加了额外的约束。在本文中,我们首先将此任务建模为马尔可夫决策过程,并采用多任务强化学习框架进行处理。具体而言,我们引入了RLMiner,一种新颖的框架,将强化学习与我们提出的任务状态感知图神经网络相结合,以在时间复杂度与k线性相关的条件下找到大小为k的最频繁诱导子图。在现实世界数据集上的广泛实验表明,我们提出的RLMiner能够有效识别频率接近真实最频繁诱导子图的子图,同时在运行时间和稳定性方面显著优于传统方法。
英文摘要:
Identifying the most frequent induced subgraph of size $k$ in a target graph is a fundamental graph mining problem with direct implications for Web-related data mining and social network analysis. Despite its importance, finding the most frequent induced subgraph remains computationally expensive due to the NP-hard nature of the subgraph counting task. Traditional exact enumeration algorithms often suffer from high time complexity, especially for a large graph size $k$. To mitigate this, existing approaches often utilize frequency measurement with the Downward Closure Property to reduce the search space, imposing additional constraints on the task. In this paper, we first formulate this task as a Markov Decision Process and approach it using a multi-task reinforcement learning framework. Specifically, we introduce RLMiner, a novel framework that integrates reinforcement learning with our proposed task-state-aware Graph Neural Network to find the most frequent induced subgraph of size $k$ with a time complexity linear to $k$. Extensive experiments on real-world datasets demonstrate that our proposed RLMiner effectively identifies subgraphs with frequencies closely matching the ground-truth most frequent induced subgraphs, while achieving significantly shorter and more stable running times compared to traditional methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。