Association Rules Mining with Auto-Encoders
- URL: http://arxiv.org/abs/2304.13717v1
- Date: Wed, 26 Apr 2023 17:55:44 GMT
- Title: Association Rules Mining with Auto-Encoders
- Authors: Th\'eophile Berteloot, Richard Khoury, Audrey Durand
- Abstract summary: We present an auto-encoder solution to mine association rule called ARM-AE.
Our algorithm discovers high support and confidence rule set and has a better execution time than classical methods.
- Score: 5.175050215292647
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Association rule mining is one of the most studied research fields of data
mining, with applications ranging from grocery basket problems to explainable
classification systems. Classical association rule mining algorithms have
several limitations, especially with regards to their high execution times and
number of rules produced. Over the past decade, neural network solutions have
been used to solve various optimization problems, such as classification,
regression or clustering. However there are still no efficient way association
rules using neural networks. In this paper, we present an auto-encoder solution
to mine association rule called ARM-AE. We compare our algorithm to FP-Growth
and NSGAII on three categorical datasets, and show that our algorithm discovers
high support and confidence rule set and has a better execution time than
classical methods while preserving the quality of the rule set produced.
Related papers
- Cambrian Explosion Algorithm for Multi-Objective Association Rules
Mining [5.175050215292647]
Association rule mining is one of the most studied research fields of data mining.
We compare the performances of state-of-the-art meta-heuristics on the association rule mining problem.
We propose a new algorithm designed to mine rules efficiently from massive datasets by exploring a large variety of solutions.
arXiv Detail & Related papers (2022-11-23T08:34:05Z) - HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection [75.84584400866254]
We propose a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses.
HARRIS' decisions are based on a forest model, whose trees are created based on optimized on a hybrid ranking and regression loss function.
arXiv Detail & Related papers (2022-10-31T14:06:11Z) - Towards Correlated Sequential Rules [4.743965372344134]
High-utility sequential rule mining (HUSRM) is designed to explore the confidence or probability of predicting the occurrence of consequence sequential patterns.
The existing algorithm, known as HUSRM, is limited to extracting all eligible rules while neglecting the correlation between the generated sequential rules.
We propose a novel algorithm called correlated high-utility sequential rule miner (CoUSR) to integrate the concept of correlation into HUSRM.
arXiv Detail & Related papers (2022-10-27T17:27:23Z) - Towards Target Sequential Rules [52.4562332499155]
We propose an efficient algorithm, called targeted sequential rule mining (TaSRM)
It is shown that the novel algorithm TaSRM and its variants can achieve better experimental performance compared to the existing baseline algorithm.
arXiv Detail & Related papers (2022-06-09T18:59:54Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms.
For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime.
In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem.
We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
arXiv Detail & Related papers (2021-09-13T18:10:52Z) - Discovering Categorical Main and Interaction Effects Based on
Association Rule Mining [0.0]
We use association rules to select features and their interactions, then modify the algorithm for several practical concerns.
We analyze the computational complexity of the proposed algorithm to show its efficiency.
arXiv Detail & Related papers (2021-04-10T10:13:07Z) - A brief overview of swarm intelligence-based algorithms for numerical
association rule mining [2.535671322516818]
Numerical Association Rule Mining is a popular variant of Association Rule Mining, where numerical attributes are handled without discretization.
This chapter makes a historical overview of swarm intelligence-based algorithms for Numerical Association Rule Mining, as well as to present the main features of these algorithms for the observed problem.
arXiv Detail & Related papers (2020-10-29T12:44:15Z) - Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
A fundamental component of neural network verification is the computation of bounds on the values their outputs can take.
We propose a novel approach based on Lagrangian Decomposition.
We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
arXiv Detail & Related papers (2020-02-24T17:55:10Z) - Optimal Clustering from Noisy Binary Feedback [75.17453757892152]
We study the problem of clustering a set of items from binary user feedback.
We devise an algorithm with a minimal cluster recovery error rate.
For adaptive selection, we develop an algorithm inspired by the derivation of the information-theoretical error lower bounds.
arXiv Detail & Related papers (2019-10-14T09:18:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.