2014
DOI: 10.4028/www.scientific.net/amm.668-669.1102
|View full text |Cite
|
Sign up to set email alerts
|

Research and Application of Improved Apriori Algorithm Based on Matrix

Abstract: This article put forward a NCM_Apriori algorithm, which through compressing matrix and reducing the scan times to reduce the database I/O overhead, effectively improve the efficiency of association rule mining. At the same time in the process of generating association rules, computation is greatly reduced by using the nature of probability. And applies the algorithm to the mining of students' course selection system, which can provide decision support for colleges and universities.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…For the classic Apriori algorithm, literature [8] improved algorithm and IW-Apriori algorithm, experiments are carried out in the same experimental environment. Experimental environment: the processor is Intel(R) Core(TM) i 5-7500 CPU @ 3.40 GHz; the operating system is Windows 10 Professional Edition 64 -bit; the algorithm simulation experiment is performed in Python 3.8 platform to achieve.…”
Section: Standard Dataset Verificationmentioning
confidence: 99%
See 2 more Smart Citations
“…For the classic Apriori algorithm, literature [8] improved algorithm and IW-Apriori algorithm, experiments are carried out in the same experimental environment. Experimental environment: the processor is Intel(R) Core(TM) i 5-7500 CPU @ 3.40 GHz; the operating system is Windows 10 Professional Edition 64 -bit; the algorithm simulation experiment is performed in Python 3.8 platform to achieve.…”
Section: Standard Dataset Verificationmentioning
confidence: 99%
“…Wang C et al proposed an improved Apriori algorithm for Boolean matrix reduction [5][6] , which reduces the number of times and shortens the running time of the algorithm. Shuwen L et al proposed the improved Apriori algorithm based on the compression matrix [7][8][9] , which only needs to scan the database once to generate a Boolean matrix. However, all itemsets are treated equally without distinction.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The execution time of the Apriori algorithm increases exponentially with an increasing number of transactions. Multiple studies used a parallelization approach using a mapreduce framework to deal with this issue (Liu and Lou;. Another approach that is used to solve this issue is the reduction of the database size.…”
Section: Challenges In Association Rule Miningmentioning
confidence: 99%
“…Quantization refers that by reasonable analysis the complex CMM data are divided into independent and exclusive minimum information units that consist of several Chinese characters and numbers and cannot be subdivided. [ 3 ] Regarding research subject selection, the authoritative work Pharmacopoeia of the People's Republic of China 2015 edition (hereinafter referred to as Pharmacopoeia) was taken as reference, and the information of 619 CMM recorded in the Pharmacopoeia was extracted. The extracted information included the natures, flavors, channel tropisms, toxicities, therapeutic efficacies, and indications of CMM.…”
mentioning
confidence: 99%