|
[1] Agrawal R,Imielimski T,Swami A.Mining association rules
between sets of items in large databases[C].Proceedings of
the ACM SIGMOD Conference on Management of Data,
1993:207-216.
[2] Agrawal R,Srikant R.Fast algorithms for mining association
rules[C].Proceedings of the 20th International Conference
on Very Large Data Bases.Morgan Kaufmann Publishers
Inc.,1994,1215:487-499.
[3] Han J,Pei J,Yin Y.Mining frequent patterns without candi⁃
date generation[J].ACM Sigmod Record,2000,29(2):1-12.
[4] Aggarwal S,Kaur R.Comparative study of various improved
versions of apriori algorithm[J].International Journal of En⁃
gineering Trends and Technology,2013,4(4):687-690.
[5] Lee H B.An efficient hashing mechanism of the DHP algo⁃
rithm for mining association rules[J].The KIPS Transac⁃
tions: PartD,2006,13(5):651-660.
[6] Ivashko E,Golovin A.Partition algorithm for association
rules mining in BOINC- based enterprise desktop grid[C].
International Conference on Parallel Computing Technolo⁃
gies,2015:268-272.
[7] Liu Z,Sun T,Sang G.An algorithm of association rules min⁃
ing in large databases based on sampling[J].International
Journal of Database Theory and Application,2013,6(6):95-
104.
[8] Jiang Y,Zhao M,Hu C,et al.A parallel FP-growth algorithm
on world ocean atlas data with multi-core CPU[J].The Jour⁃
nal of Supercomputing,2019,75(2):732-745.
[9] 刘艺,张海涛,刘奇燕,等. 基于分解数据库的 FP-growth
算法关联规则研究[J]. 计算机与数字工程,2018,46(7):
1306-1310.
[10] 黄梓莘,陈波.基于混凝土坝接缝变形监测数据的时空
关联规则挖掘方法[J]. 水电能源科学,2022,40(3):109-
113.
|
