Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search
Guillaume Bosc, Jean-Fran\c{c}ois Boulicaut, Chedy Ra\"issi, Mehdi, Kaytoue

TL;DR
This paper introduces a novel Monte Carlo Tree Search approach for pattern discovery in data mining, enabling the anytime extraction of diverse, high-quality pattern sets more effectively than existing methods, especially in large search spaces.
Contribution
The paper formally defines pattern mining as a game and applies MCTS, providing a new, generic, and efficient search technique for diverse pattern discovery.
Findings
MCTS outperforms existing methods in large pattern search spaces.
It enables anytime discovery of diverse, high-quality patterns.
The approach is applicable to various pattern mining tasks.
Abstract
The discovery of patterns that accurately discriminate one class label from another remains a challenging data mining task. Subgroup discovery (SD) is one of the frameworks that enables to elicit such interesting hypotheses from labeled data. A question remains fairly open: How to select an accurate heuristic search technique when exhaustive enumeration of the pattern space is infeasible? Existing approaches make use of beam-search, sampling and genetic algorithms for discovering a pattern set that is non-redundant and of high quality w.r.t. a pattern quality measure. We argue that such approaches produce pattern sets that lack of diversity: Only few patterns of high quality, and different enough, are discovered. Our main contribution is then to formally define pattern mining as a game and to solve it with Monte Carlo tree search (MCTS). It can be seen as an exhaustive search guided by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Metaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications
