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 $k$ in a target graph is a fundamental graph mining problem with direct implications for Web-related data mining and social n…