Journal of Computer Applications ›› 2024, Vol. 44 ›› Issue (2): 477-484.DOI: 10.11772/j.issn.1001-9081.2023030268
Special Issue: 数据科学与技术
• Data science and technology • Previous Articles Next Articles
Keshuai YANG1, Youxi WU1(), Meng GENG1, Jingyu LIU1, Yan LI2
Received:
2023-03-13
Revised:
2023-05-17
Accepted:
2023-05-29
Online:
2023-06-16
Published:
2024-02-10
Contact:
Youxi WU
About author:
YANG Keshuai, born in 1998, M. S. candidate. His research interests include data mining.Supported by:
通讯作者:
武优西
作者简介:
杨克帅(1998—),男,河南濮阳人,硕士研究生,CCF会员,主要研究方向:数据挖掘基金资助:
CLC Number:
Keshuai YANG, Youxi WU, Meng GENG, Jingyu LIU, Yan LI. Top-k high average utility sequential pattern mining algorithm under one-off condition[J]. Journal of Computer Applications, 2024, 44(2): 477-484.
杨克帅, 武优西, 耿萌, 刘靖宇, 李艳. 一次性条件下top-k高平均效用序列模式挖掘算法[J]. 《计算机应用》唯一官方网站, 2024, 44(2): 477-484.
Add to citation manager EndNote|Ris|BibTeX
URL: https://www.joca.cn/EN/10.11772/j.issn.1001-9081.2023030268
序列号 | 序列 |
---|---|
(1,ab)(2,a)(3,abc)(4,ab)(5,ad)(6,cd) | |
(1,bd)(2,ab)(3,acd)(4,abc)(5,ac)(6,ac) |
Tab. 1 Sequence database D
序列号 | 序列 |
---|---|
(1,ab)(2,a)(3,abc)(4,ab)(5,ad)(6,cd) | |
(1,bd)(2,ab)(3,acd)(4,abc)(5,ac)(6,ac) |
数据集 | 类型 | 序列数 | 项目数 | 项集数 | 总长度 |
---|---|---|---|---|---|
SDB1 | 项集序列 | 5 026 | 6 | 55 524 | 140 182 |
SDB2 | 项集序列 | 1 248 | 276 | 8 134 | 73 206 |
SDB3 | 项集序列 | 1 096 | 5 390 | 6 111 | 54 999 |
SDB4 | 项集序列 | 69 | 2 520 | 178 | 1 403 |
SDB5 | 单项序列 | 668 | 231 | 35 100 | 35 100 |
SDB6 | 单项序列 | 1 663 | 6 417 | 57 852 | 57 852 |
Tab. 3 Experimental datasets
数据集 | 类型 | 序列数 | 项目数 | 项集数 | 总长度 |
---|---|---|---|---|---|
SDB1 | 项集序列 | 5 026 | 6 | 55 524 | 140 182 |
SDB2 | 项集序列 | 1 248 | 276 | 8 134 | 73 206 |
SDB3 | 项集序列 | 1 096 | 5 390 | 6 111 | 54 999 |
SDB4 | 项集序列 | 69 | 2 520 | 178 | 1 403 |
SDB5 | 单项序列 | 668 | 231 | 35 100 | 35 100 |
SDB6 | 单项序列 | 1 663 | 6 417 | 57 852 | 57 852 |
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
TOUP-nus | 1 206 | 114 990 | 2 268 510 | 480 672 | 70 438 | 1 263 717 |
TOUP-dfs | 600 | 53 045 | 63 818 | 2 135 126 | 69 631 | 57 427 |
HAOP-ms | 1 650 | 14 583 | 17 124 | 9 727 | 9 791 | 10 205 |
HANP-oms | 1 673 | 14 764 | 17 124 | 9 727 | 10 095 | 10 343 |
PMBC-ms | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
TOUP | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
Tab. 4 Comparison of number of candidate patterns generated by different algorithms on six datasets
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
TOUP-nus | 1 206 | 114 990 | 2 268 510 | 480 672 | 70 438 | 1 263 717 |
TOUP-dfs | 600 | 53 045 | 63 818 | 2 135 126 | 69 631 | 57 427 |
HAOP-ms | 1 650 | 14 583 | 17 124 | 9 727 | 9 791 | 10 205 |
HANP-oms | 1 673 | 14 764 | 17 124 | 9 727 | 10 095 | 10 343 |
PMBC-ms | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
TOUP | 369 | 4 244 | 8 152 | 4 152 | 7 320 | 10 109 |
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 224 | 339 | 14 | 804 | 1 825 |
TOUP-nus | 84 | 123 | 1 188 | 82 | 478 | 757 |
TOUP-dfs | 107 | 446 | 866 | 456 | 91 | 1 594 |
HAOP-ms | 591 | 995 | 699 | 138 | 1 343 | 2 174 |
HANP-oms | 628 | 1 022 | 710 | 14 | 1 383 | 2 213 |
PMBC-ms | 98 | 190 | 346 | 14 | 568 | 1 826 |
TOUP | 71 | 151 | 294 | 13 | 37 | 417 |
Tab. 5 Comparison of running time amongdifferent algorithms on six datasets
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 224 | 339 | 14 | 804 | 1 825 |
TOUP-nus | 84 | 123 | 1 188 | 82 | 478 | 757 |
TOUP-dfs | 107 | 446 | 866 | 456 | 91 | 1 594 |
HAOP-ms | 591 | 995 | 699 | 138 | 1 343 | 2 174 |
HANP-oms | 628 | 1 022 | 710 | 14 | 1 383 | 2 213 |
PMBC-ms | 98 | 190 | 346 | 14 | 568 | 1 826 |
TOUP | 71 | 151 | 294 | 13 | 37 | 417 |
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 52 | 47 | 46 | 40 | 48 | 55 |
TOUP-nus | 54 | 50 | 50 | 41 | 47 | 54 |
TOUP-dfs | 54 | 50 | 49 | 40 | 47 | 52 |
HAOP-ms | 52 | 50 | 50 | 45 | 49 | 56 |
HANP-oms | 52 | 50 | 50 | 47 | 49 | 56 |
PMBC-ms | 52 | 47 | 49 | 44 | 48 | 55 |
TOUP | 52 | 47 | 46 | 40 | 47 | 52 |
Tab. 6 Comparison of memory consumption amongdifferent algorithms on six datasets
算法 | SDB1 | SDB2 | SDB3 | SDB4 | SDB5 | SDB6 |
---|---|---|---|---|---|---|
TOUP-rf | 52 | 47 | 46 | 40 | 48 | 55 |
TOUP-nus | 54 | 50 | 50 | 41 | 47 | 54 |
TOUP-dfs | 54 | 50 | 49 | 40 | 47 | 52 |
HAOP-ms | 52 | 50 | 50 | 45 | 49 | 56 |
HANP-oms | 52 | 50 | 50 | 47 | 49 | 56 |
PMBC-ms | 52 | 47 | 49 | 44 | 48 | 55 |
TOUP | 52 | 47 | 46 | 40 | 47 | 52 |
算法 | SDB1_1 | SDB1_2 | SDB1_3 | SDB1_4 | SDB1_5 | SDB1_6 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 267 | 386 | 508 | 636 | 761 |
TOUP-nus | 84 | 217 | 325 | 410 | 530 | 620 |
TOUP-dfs | 107 | 237 | 373 | 522 | 673 | 777 |
HAOP-ms | 591 | 1 184 | 1 808 | 2 579 | 3 167 | 3 689 |
HANP-oms | 628 | 1 189 | 1 811 | 2 587 | 3 171 | 3 723 |
PMBC-ms | 98 | 199 | 302 | 409 | 510 | 611 |
TOUP | 71 | 161 | 242 | 323 | 401 | 484 |
Tab. 7 Comparison of running time amongdifferent algorithms on SDB1_1-SDB1_6 datasets
算法 | SDB1_1 | SDB1_2 | SDB1_3 | SDB1_4 | SDB1_5 | SDB1_6 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 267 | 386 | 508 | 636 | 761 |
TOUP-nus | 84 | 217 | 325 | 410 | 530 | 620 |
TOUP-dfs | 107 | 237 | 373 | 522 | 673 | 777 |
HAOP-ms | 591 | 1 184 | 1 808 | 2 579 | 3 167 | 3 689 |
HANP-oms | 628 | 1 189 | 1 811 | 2 587 | 3 171 | 3 723 |
PMBC-ms | 98 | 199 | 302 | 409 | 510 | 611 |
TOUP | 71 | 161 | 242 | 323 | 401 | 484 |
算法 | SDB1_1 | SDB1_2 | SDB1_3 | SDB1_4 | SDB1_5 | SDB1_6 |
---|---|---|---|---|---|---|
TOUP-rf | 52 | 64 | 77 | 89 | 103 | 116 |
TOUP-nus | 54 | 68 | 84 | 102 | 121 | 136 |
TOUP-dfs | 54 | 67 | 83 | 97 | 115 | 132 |
HAOP-ms | 52 | 65 | 77 | 90 | 103 | 116 |
HANP-oms | 52 | 65 | 78 | 90 | 103 | 116 |
PMBC-ms | 52 | 64 | 77 | 90 | 103 | 116 |
TOUP | 52 | 64 | 77 | 90 | 103 | 116 |
Tab. 8 Comparison of memory consumption amongdifferent algorithms on SDB1_1-SDB1_6 datasets
算法 | SDB1_1 | SDB1_2 | SDB1_3 | SDB1_4 | SDB1_5 | SDB1_6 |
---|---|---|---|---|---|---|
TOUP-rf | 52 | 64 | 77 | 89 | 103 | 116 |
TOUP-nus | 54 | 68 | 84 | 102 | 121 | 136 |
TOUP-dfs | 54 | 67 | 83 | 97 | 115 | 132 |
HAOP-ms | 52 | 65 | 77 | 90 | 103 | 116 |
HANP-oms | 52 | 65 | 78 | 90 | 103 | 116 |
PMBC-ms | 52 | 64 | 77 | 90 | 103 | 116 |
TOUP | 52 | 64 | 77 | 90 | 103 | 116 |
算法 | k=10 | k=12 | k=14 | k=16 | k=18 | k=20 |
---|---|---|---|---|---|---|
TOUP-rf | 369 | 391 | 485 | 758 | 942 | 956 |
TOUP-nus | 1 206 | 1 806 | 2 464 | 3 738 | 5 160 | 6 606 |
TOUP-dfs | 600 | 627 | 771 | 942 | 1 173 | 1 190 |
HAOP-ms | 1 650 | 2 130 | 4 381 | 5 294 | 6 754 | 7 287 |
HANP-oms | 1 673 | 2 186 | 4 512 | 5 515 | 6 892 | 7 621 |
PMBC-ms | 369 | 391 | 485 | 758 | 942 | 956 |
TOUP | 369 | 391 | 485 | 758 | 942 | 956 |
Tab. 9 Comparison of number of generated candidate patterns with different parameter k
算法 | k=10 | k=12 | k=14 | k=16 | k=18 | k=20 |
---|---|---|---|---|---|---|
TOUP-rf | 369 | 391 | 485 | 758 | 942 | 956 |
TOUP-nus | 1 206 | 1 806 | 2 464 | 3 738 | 5 160 | 6 606 |
TOUP-dfs | 600 | 627 | 771 | 942 | 1 173 | 1 190 |
HAOP-ms | 1 650 | 2 130 | 4 381 | 5 294 | 6 754 | 7 287 |
HANP-oms | 1 673 | 2 186 | 4 512 | 5 515 | 6 892 | 7 621 |
PMBC-ms | 369 | 391 | 485 | 758 | 942 | 956 |
TOUP | 369 | 391 | 485 | 758 | 942 | 956 |
算法 | k=10 | k=12 | k=14 | k=16 | k=18 | k=20 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 146 | 169 | 255 | 318 | 321 |
TOUP-nus | 84 | 105 | 141 | 175 | 217 | 264 |
TOUP-dfs | 107 | 163 | 214 | 310 | 408 | 514 |
HAOP-ms | 591 | 716 | 1 465 | 1 794 | 2 211 | 2 343 |
HANP-oms | 628 | 775 | 1 549 | 1 893 | 2 353 | 2 521 |
PMBC-ms | 98 | 101 | 131 | 200 | 247 | 255 |
TOUP | 71 | 79 | 93 | 141 | 174 | 176 |
Tab. 10 Comparison of running time with different parameter k
算法 | k=10 | k=12 | k=14 | k=16 | k=18 | k=20 |
---|---|---|---|---|---|---|
TOUP-rf | 123 | 146 | 169 | 255 | 318 | 321 |
TOUP-nus | 84 | 105 | 141 | 175 | 217 | 264 |
TOUP-dfs | 107 | 163 | 214 | 310 | 408 | 514 |
HAOP-ms | 591 | 716 | 1 465 | 1 794 | 2 211 | 2 343 |
HANP-oms | 628 | 775 | 1 549 | 1 893 | 2 353 | 2 521 |
PMBC-ms | 98 | 101 | 131 | 200 | 247 | 255 |
TOUP | 71 | 79 | 93 | 141 | 174 | 176 |
1 | OKOLICA J S, PETERSON G L, MILLS R F, et al. Sequence pattern mining with variables[J]. IEEE Transactions on Knowledge and Data Engineering, 2020, 32(1): 177-187. 10.1109/tkde.2018.2881675 |
2 | GHOSH S, LI J, CAO L, et al. Septic shock prediction for ICU patients via coupled HMM walking on sequential contrast patterns[J]. Journal of Biomedical Informatics, 2017, 66: 19-31. 10.1016/j.jbi.2016.12.010 |
3 | LE B, M-T TRAN, VO B. Mining frequent closed inter-sequence patterns efficiently using dynamic bit vectors[J]. Applied Intelligence, 2015, 43: 74-84. 10.1007/s10489-014-0630-1 |
4 | CHEN X, XIAO R, DU X, et al. Constructing a novel Spark-based distributed maximum frequent sequence pattern mining for IoT log[C]// Proceedings of the 8th International Conference on Communication and Network Security. New York: ACM, 2018: 112-116. 10.1145/3290480.3290497 |
5 | 韩萌, 丁剑. 数据流频繁模式挖掘综述[J]. 计算机应用, 2019, 39(3): 719-727. 10.11772/j.issn.1001-9081.2018081712 |
HAN M, DING J. Survey of frequent pattern mining over data streams[J]. Journal of Computer Applications, 2019, 39(3): 719-727. 10.11772/j.issn.1001-9081.2018081712 | |
6 | WU Y, FAN J, LI Y, et al. NetDAP: (Δ, γ)-approximate pattern matching with length constraints[J]. Applied Intelligence, 2020, 50: 4094-4116. 10.1007/s10489-020-01778-1 |
7 | WU Y, TONG Y, ZHU X, et al. NOSEP: nonoverlapping sequence pattern mining with gap constraints[J]. IEEE Transactions on Cybernetics, 2018, 48(10): 2809-2822. 10.1109/tcyb.2017.2750691 |
8 | WANG Y WU Y, LI Y, et al. Self adaptive nonoverlapping sequential pattern mining[J]. Applied Intelligence, 2022, 52: 6646-6661. 10.1007/s10489-021-02763-y |
9 | WU Y, LUO L, LI Y, et al. NTP-Miner: nonoverlapping three-way sequential pattern mining[J]. ACM Transaction on Knowledge Discovery from Data, 2022, 16(3): No. 51. 10.1145/3480245 |
10 | 武优西, 刘茜, 闫文杰, 等. 无重叠条件严格模式匹配的高效求解算法[J]. 软件学报, 2021, 32(11): 3331-3350. 10.13328/j.cnki.jos.006054 |
WU Y X, LIU Q, YAN W J, et al. Efficient algorithm for solving strict pattern matching under nonoverlapping condition[J]. Journal of Software, 2021, 32(11): 3331-3350. 10.13328/j.cnki.jos.006054 | |
11 | FOURNIER-VIGER P, GAN W, WU Y, et al. Pattern mining: Current challenges and opportunities [C]// Proceedings of the 2022 International Conference on Database Systems for Advanced Applications. Cham: Springer, 2022: 34-49. 10.1007/978-3-031-11217-1_3 |
12 | WU Y, WANG X, LI Y, et al. OWSP-Miner: self-adaptive one-off weak-gap strong pattern mining[J]. ACM Transactions on Management Information Systems, 2022, 13(3): No. 25. 10.1145/3476247 |
13 | XU T, XU J, DONG X. Mining high utility sequential patterns using multiple minimum utility[J]. International Journal of Pattern Recognition and Artificial Intelligence, 2018, 32(10): 1859017. 10.1142/s0218001418590176 |
14 | GAN W, LIN J C-W, FOURNIER-VIGER P, et al. A survey of utility-oriented pattern mining[J]. IEEE Transactions on Knowledge and Data Engineering, 2021, 33(4): 1306-1327. 10.1109/tkde.2019.2942594 |
15 | 单芝慧, 韩萌, 韩强. 动态数据上的高效用模式挖掘综述[J]. 计算机应用, 2022, 42(1): 94-108. 10.11772/j.issn.1001-9081.2021071290 |
SHAN Z H, HAN M, HAN Q. Survey of high utility pattern mining on dynamic data[J]. Journal of Computer Applications, 2022, 42(1): 94-108. 10.11772/j.issn.1001-9081.2021071290 | |
16 | SRIVASTAVA G, LIN J C-W, ZHANG X, et al. Large-scale high-utility sequential pattern analytics in Internet of Things[J]. IEEE Internet of Things Journal, 2021, 8(16): 12669-12678. 10.1109/jiot.2020.3026826 |
17 | SEGURA-DELGADO A, ANGUITA-RUIZ A, ALCALÁ R, et al. Mining high average-utility sequential rules to identify high-utility gene expression sequences in longitudinal human studies[J]. Expert Systems with Applications, 2022, 193: 116411. 10.1016/j.eswa.2021.116411 |
18 | WU Y, LEI R, LI Y, et al. HAOP-Miner: self-adaptive high-average utility one-off sequential pattern mining[J]. Expert Systems with Applications, 2021, 184: 115449. 10.1016/j.eswa.2021.115449 |
19 | WU Y, WANG Y, LI Y, et al. Top-k self-adaptive contrast sequential pattern mining[J]. IEEE Transactions on Cybernetics, 2022, 52(11):11819-11833. 10.1109/tcyb.2021.3082114 |
20 | ZHANG C, DU Z, GAN W, et al. TKUS: mining top-k high utility sequential patterns[J]. Information Sciences, 2021, 570: 342-359. 10.1016/j.ins.2021.04.035 |
21 | DONG X, QIU P, LÜ J, et al. Mining top-k useful negative sequential patterns via learning[J]. IEEE Transactions on Neural Networks and Learning Systems, 2019, 30(9): 2764-2778. 10.1109/tnnls.2018.2886199 |
22 | LE T, VO B, V-N HUYNH, et al. Mining top-k frequent patterns from uncertain databases[J]. Applied Intelligence, 2020, 50: 1487-1497. 10.1007/s10489-019-01622-1 |
23 | LI C, YANG Q, WANG J. Efficient mining of gap-constrained subsequences and its various applications[J]. ACM Transactions on Knowledge Discovery from Data, 2012, 6(1): No. 2. 10.1145/2133360.2133362 |
24 | XIE F, WU X, ZHU X. Efficient sequential pattern mining with wildcards for keyphrase extraction[J]. Knowledge-Based Systems, 2017, 115: 27-39. 10.1016/j.knosys.2016.10.011 |
25 | LI Y, ZHANG S, GUO L, et al. NetNMSP: nonoverlapping maximal sequential pattern mining[J]. Applied Intelligence, 2022, 52: 9861-9884. 10.1007/s10489-021-02912-3 |
26 | 王珠林, 武优西, 王月华, 等. 具有周期间隙约束的负序列模式挖掘[J]. 计算机科学, 2023, 50(3): 147-154. 10.11896/jsjkx.211200248 |
WANG Z L, WU Y X, WANG Y H, et al. Mining negative sequential patterns with periodic gap constraints[J]. Computer Science, 2023, 50(3): 147-154. 10.11896/jsjkx.211200248 | |
27 | LIN J C-W, DJENOURI Y, SRIVASTAVA G, et al. Scalable mining of high-utility sequential patterns with three-tier MapReduce model[J]. ACM Transactions on Knowledge Discovery from Data, 2022, 16(3): 1-26. 10.1145/3487046 |
28 | GAN W S, LIN J C W, ZHANG J X, et al. Fast utility mining on sequence data[J]. IEEE Transactions on Cybernetics, 2021, 51(2): No. 60. 10.1109/tcyb.2020.2970176 |
29 | WU Y, GENG M, LI Y, et al. HANP-Miner: High average utility nonoverlapping sequential pattern mining[J]. Knowledge-Based Systems, 2021, 229: 107361. 10.1016/j.knosys.2021.107361 |
30 | KIM H, YUN U, BAEK Y, et al. Efficient list based mining of high average utility patterns with maximum average pruning strategies[J]. Information Sciences, 2021, 543: 85-105. 10.1016/j.ins.2020.07.043 |
31 | EZEIFE C I, ARAVINDAN V, CHATURVEDI R. Mining integrated sequential patterns from multiple databases[J]. International Journal of Data Warehousing and Mining, 2020, 16(1): 1-21. 10.4018/ijdwm.2020010101 |
32 | T-T PHAM, NGUYEN A DO T, et al. An efficient method for mining top-k closed sequential patterns[J]. IEEE Access, 2020, 8: 118156-118163. 10.1109/access.2020.3004528 |
33 | WU X, ZHU X, HE Y, et al. PMBC: Pattern mining from biological sequences with wildcard constraints[J]. Computers in Biology and Medicine, 2013, 43(5): 481-492. 10.1016/j.compbiomed.2013.02.006 |
[1] | Huanhuan LI, Tianqiang HUANG, Xuemei DING, Haifeng LUO, Liqing HUANG. Public traffic demand prediction based on multi-scale spatial-temporal graph convolutional network [J]. Journal of Computer Applications, 2024, 44(7): 2065-2072. |
[2] | Yao DONG, Yixue FU, Yongfeng DONG, Jin SHI, Chen CHEN. Survey of incomplete multi-view clustering [J]. Journal of Computer Applications, 2024, 44(6): 1673-1682. |
[3] | Haodong ZHENG, Hua MA, Yingchao XIE, Wensheng TANG. Knowledge tracing model based on graph neural network blending with forgetting factors and memory gate [J]. Journal of Computer Applications, 2023, 43(9): 2747-2752. |
[4] | Hua JIANG, Xing LI, Huijiao WANG, Jinghai WEI. Cross-level high utility itemsets mining algorithm based on data index structure [J]. Journal of Computer Applications, 2023, 43(7): 2200-2208. |
[5] | Shuo HUANG, Yanhui LI, Jianqiu CAO. PrivSPM: frequent sequential pattern mining algorithm under local differential privacy [J]. Journal of Computer Applications, 2023, 43(7): 2057-2064. |
[6] | Chaoshuai QI, Wensi HE, Yi JIAO, Yinghong MA, Wei CAI, Suping REN. Survey on anomaly detection algorithms for unmanned aerial vehicle flight data [J]. Journal of Computer Applications, 2023, 43(6): 1833-1841. |
[7] | Yuanjiang LI, Jinsheng QUAN, Yangyi TAN, Tian YANG. Attribute reduction for high-dimensional data based on bi-view of similarity and difference [J]. Journal of Computer Applications, 2023, 43(5): 1467-1472. |
[8] | Xiaomeng SHAO, Meng ZHANG. Temporal convolutional knowledge tracing model with attention mechanism [J]. Journal of Computer Applications, 2023, 43(2): 343-348. |
[9] | Yufei MENG, Youxi WU, Zhen WANG, Yan LI. Contrast order-preserving pattern mining algorithm [J]. Journal of Computer Applications, 2023, 43(12): 3740-3746. |
[10] | Wenquan LI, Yimin MAO, Xindong PENG. Agglomerative hierarchical clustering algorithm based on hesitant fuzzy set [J]. Journal of Computer Applications, 2023, 43(12): 3755-3763. |
[11] | Jun WU, Aijia OUYANG, Lin ZHANG. Statistically significant sequential patterns mining algorithm under influence degree [J]. Journal of Computer Applications, 2022, 42(9): 2713-2721. |
[12] | Shunkun YU, Hongxu YAN. Heuristic attribute value reduction model based on certainty factor [J]. Journal of Computer Applications, 2022, 42(2): 469-474. |
[13] | SUN Rui, HAN Meng, ZHANG Chunyan, SHEN Mingyao, DU Shiyu. Algorithm for mining top-k high utility itemsets with negative items [J]. Journal of Computer Applications, 2021, 41(8): 2386-2395. |
[14] | LIU Shize, QIN Yanjun, WANG Chenxing, SU Lin, KE Qixue, LUO Haiyong, SUN Yi, WANG Baohui. Traffic flow prediction algorithm based on deep residual long short-term memory network [J]. Journal of Computer Applications, 2021, 41(6): 1566-1572. |
[15] | LI Xujuan, PI Jianyong, HUANG Feixiang, JIA Haipeng. Self-generated deep neural network based 4D trajectory prediction [J]. Journal of Computer Applications, 2021, 41(5): 1492-1499. |
Viewed | ||||||
Full text |
|
|||||
Abstract |
|
|||||