Generic Itemset Mining Based on Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
One of the biggest problems in itemset mining is the requirement of developing a data structure or algorithm, every time a user wants to extract a different type of itemsets. To overcome this, we propose a method, called Generic Itemset Mining based on Reinforcement Learning (GIM-RL), that offers a unified framework to train an agent for extracting any type of itemsets. In GIM-RL, the environment formulates iterative steps of extracting a target type of itemsets from a dataset. At each step, an agent performs an action to add or remove an item to or from the current itemset, and then obtains from the environment a reward that represents how relevant the itemset resulting from the action is to the target type. Through numerous trial-and-error steps where various rewards are obtained by diverse actions, the agent is trained to maximise cumulative rewards so that it acquires the optimal action policy for forming as many itemsets of the target type as possible. In this framework, an agent for extracting any type of itemsets can be trained as long as a reward suitable for the type can be defined. The extensive experiments on mining high utility itemsets, frequent itemsets and association rules show the general effectiveness and one remarkable potential (agent transfer) of GIM-RL. We hope that GIM-RL opens a new research direction towards learning-based itemset mining.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 40 references that are in the map. First posted on arXiv 17 May 2021.
Builds on
9 of 40 references.
References · 9
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
- 2018Recurrent World Models Facilitate Policy Evolutioncited by 785
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2018An Introduction to Deep Reinforcement Learningcited by 206
- 2017Learning model-based planning from scratchcited by 22
- 2016Flexible constrained sampling with guarantees for pattern miningcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.