Probabilistic and reinforced mining of association rules
Yongchao Huang

TL;DR
This paper introduces four novel probabilistic and reinforcement learning methods for association rule mining, enhancing flexibility, uncertainty modeling, and scalability over traditional frequency-based algorithms, with demonstrated effectiveness on various datasets.
Contribution
The work presents four new methods—GPAR, BARM, MAB-ARM, and RLAR—that incorporate probabilistic inference and reinforcement learning into ARM, departing from traditional frequency-based approaches.
Findings
Effective on synthetic and real datasets
Improved discovery of rare and complex patterns
Trade-offs in computational complexity and interpretability
Abstract
This work introduces 4 novel probabilistic and reinforcement-driven methods for association rule mining (ARM): Gaussian process-based association rule mining (GPAR), Bayesian ARM (BARM), multi-armed bandit based ARM (MAB-ARM), and reinforcement learning based association rule mining (RLAR). These methods depart fundamentally from traditional frequency-based algorithms such as Apriori, FP-Growth, and Eclat, offering enhanced capabilities for incorporating prior knowledge, modeling uncertainty, item dependencies, probabilistic inference and adaptive search strategies. GPAR employs Gaussian processes to model item co-occurrence via feature representations, enabling principled inference, uncertainty quantification, and efficient generalization to unseen itemsets without retraining. BARM adopts a Bayesian framework with priors and optional correlation structures, yielding robust uncertainty…
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.
