2019
DOI: 10.1007/s12065-019-00234-5
|View full text |Cite
|
Sign up to set email alerts
|

Application of improved time series Apriori algorithm by frequent itemsets in association rule data mining based on temporal constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0
1

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 55 publications
(30 citation statements)
references
References 6 publications
0
29
0
1
Order By: Relevance
“…It has been successfully used in computer network, recommendation system, and medical care [9][10]. Wang et al (2020) studied an improved Apriori algorithm for time series of frequent itemsets, applied it to mining association rules based on time constraints, and concluded that this algorithm was superior to the traditional algorithm in storage space [11]. Sun et al (2020) built 0-1 transaction matrix by scanning transaction database to gain weighted support and confidence.…”
Section: Introductionmentioning
confidence: 99%
“…It has been successfully used in computer network, recommendation system, and medical care [9][10]. Wang et al (2020) studied an improved Apriori algorithm for time series of frequent itemsets, applied it to mining association rules based on time constraints, and concluded that this algorithm was superior to the traditional algorithm in storage space [11]. Sun et al (2020) built 0-1 transaction matrix by scanning transaction database to gain weighted support and confidence.…”
Section: Introductionmentioning
confidence: 99%
“…The main idea of deep page Association prefetch is to not only consider the current request of customers, but also consider the current request sequence of customers or the suffix sub-sequence of the current request sequence of customers, so as to improve the accuracy of prefetch [21][22][23]. The basic idea of prefetch model is to use the historical access sequence of customers to build a deep structure tree.…”
Section: Deep Page Association Prefetch Modelmentioning
confidence: 99%
“…1. Some methods make use of with specific data structures [33][35] [45]. For example, one of the most popular of these methods is the use of hashing function and a file with direct access to store items k > 1 in buckets where the amount of support is calculated based on buckets rather the individual data.Hence, access becomes easy to frequent patterns [29].…”
Section: Related Workmentioning
confidence: 99%