Towards Target Sequential Rules
- URL: http://arxiv.org/abs/2206.04728v1
- Date: Thu, 9 Jun 2022 18:59:54 GMT
- Title: Towards Target Sequential Rules
- Authors: Wensheng Gan, Gengsen Huang, Jian Weng, Tianlong Gu, and Philip S. Yu
- Abstract summary: 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.
- Score: 52.4562332499155
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In many real-world applications, sequential rule mining (SRM) can provide
prediction and recommendation functions for a variety of services. It is an
important technique of pattern mining to discover all valuable rules that
belong to high-frequency and high-confidence sequential rules. Although several
algorithms of SRM are proposed to solve various practical problems, there are
no studies on target sequential rules. Targeted sequential rule mining aims at
mining the interesting sequential rules that users focus on, thus avoiding the
generation of other invalid and unnecessary rules. This approach can further
improve the efficiency of users in analyzing rules and reduce the consumption
of data resources. In this paper, we provide the relevant definitions of target
sequential rule and formulate the problem of targeted sequential rule mining.
Furthermore, we propose an efficient algorithm, called targeted sequential rule
mining (TaSRM). Several pruning strategies and an optimization are introduced
to improve the efficiency of TaSRM. Finally, a large number of experiments are
conducted on different benchmarks, and we analyze the results in terms of their
running time, memory consumption, and scalability, as well as query cases with
different query rules. It is shown that the novel algorithm TaSRM and its
variants can achieve better experimental performance compared to the existing
baseline algorithm.
Related papers
- Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning [62.81324245896717]
We introduce an exploration-agnostic algorithm, called C-PG, which exhibits global last-ite convergence guarantees under (weak) gradient domination assumptions.
We numerically validate our algorithms on constrained control problems, and compare them with state-of-the-art baselines.
arXiv Detail & Related papers (2024-07-15T14:54:57Z) - Iteratively Refined Behavior Regularization for Offline Reinforcement
Learning [57.10922880400715]
In this paper, we propose a new algorithm that substantially enhances behavior-regularization based on conservative policy iteration.
By iteratively refining the reference policy used for behavior regularization, conservative policy update guarantees gradually improvement.
Experimental results on the D4RL benchmark indicate that our method outperforms previous state-of-the-art baselines in most tasks.
arXiv Detail & Related papers (2023-06-09T07:46:24Z) - Association Rules Mining with Auto-Encoders [5.175050215292647]
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.
arXiv Detail & Related papers (2023-04-26T17:55:44Z) - 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) - 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) - Totally-ordered Sequential Rules for Utility Maximization [49.57003933142011]
We propose two novel algorithms, called TotalSR and TotalSR+, which aim to identify all high utility totally-ordered sequential rules (HTSRs)
TotalSR creates a utility table that can efficiently calculate antecedent support and a utility prefix sum list that can compute the remaining utility in O(1) time for a sequence.
There are numerous experimental results on both real and synthetic datasets demonstrating that TotalSR is significantly more efficient than algorithms with fewer pruning strategies.
arXiv Detail & Related papers (2022-09-27T16:17:58Z) - TaSPM: Targeted Sequential Pattern Mining [53.234101208024335]
We propose a generic framework namely TaSPM, based on the fast CM-SPAM algorithm.
We also propose several pruning strategies to reduce meaningless operations in mining processes.
Experiments show that the novel targeted mining algorithm TaSPM can achieve faster running time and less memory consumption.
arXiv Detail & Related papers (2022-02-26T17:49:47Z) - US-Rule: Discovering Utility-driven Sequential Rules [52.68017415747925]
We propose a faster algorithm, called US-Rule, to efficiently mine high-utility sequential rules.
Four tighter upper bounds (LEEU, REEU, LERSU, RERSU) and their corresponding pruning strategies are proposed.
US-Rule can achieve better performance in terms of execution time, memory consumption and scalability.
arXiv Detail & Related papers (2021-11-29T23:38:28Z)
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.