{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:07:00Z","timestamp":1764133620872,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:00:00Z","timestamp":1676937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2021YFC3340501"],"award-info":[{"award-number":["2021YFC3340501"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Aimed at shortcomings, such as fewer risk rules for assisting decision-making in customs entry inspection scenarios and relying on expert experience generation, a dynamic weight assignment method based on the attributes of customs declaration data and an improved dynamic-weight Can-Tree incremental mining algorithm are proposed. In this paper, we first discretize the customs declaration data, and then form composite attributes by combining and expanding the attributes, which is conducive to generating rules with risk judgment significance. Then, weights are determined according to the characteristics and freshness of the customs declaration data, and the weighting method is applied to the Can-Tree algorithm for incremental association rule mining to automatically and efficiently generate risk rules. By comparing FP-Growth and traditional Can-Tree algorithms experimentally, the improved dynamic-weight Can-Tree incremental mining algorithm occupies less memory space and is more time efficient. The introduction of dynamic weights can visually distinguish the importance level of customs declaration data and mine more representative rules. The dynamic weights combine confidence and elevation to further improve the accuracy and positive correlation of the generated rules.<\/jats:p>","DOI":"10.3390\/info14030141","type":"journal-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T01:39:47Z","timestamp":1677029987000},"page":"141","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Weights Based Risk Rule Generation Algorithm for Incremental Data of Customs Declarations"],"prefix":"10.3390","volume":"14","author":[{"given":"Ding","family":"Han","sequence":"first","affiliation":[{"name":"Computer School, Beijing Information Science and Technology University, Beijing 100192, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8824-8574","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Information Science and Technology University, Beijing 100192, China"}]},{"given":"Zhenlong","family":"Wan","sequence":"additional","affiliation":[{"name":"National Information Center of GACC (National E-Clearance Center of GACC), Beijing 100005, China"}]},{"given":"Mengjie","family":"Liao","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Information Science and Technology University, Beijing 100192, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,2,21]]},"reference":[{"key":"ref_1","first-page":"12681","article-title":"Medical Image Prediction for Diagnosis of Breast Cancer Disease Comparing the Machine Learning Algorithms: SVM, KNN, Logistic Regression, Random Forest, and Decision Tree to Measure Accuracy","volume":"107","author":"Paidipati","year":"2022","journal-title":"Electrochem. Soc. Trans."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ding, W., Chen, Q., Dong, Y.Z., and Shao, N. (2022). Fault Diagnosis Method of Intelligent Substation Protection System Based on Gradient Boosting Decision Tree. Appl. Sci., 12.","DOI":"10.3390\/app12188989"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Li, G.Q., Wang, T., Chen, Q., Shao, P., Xiong, N.X., and Athanasios, V. (2022). A Survey on Particle Swarm Optimization for Association Rule Mining. Electronics, 11.","DOI":"10.3390\/electronics11193044"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.3390\/en15051676","article-title":"Machine Learning and Data Mining Applications in Power Systems","volume":"15","author":"Zbigniew","year":"2022","journal-title":"Energies"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1109\/69.250074","article-title":"Database mining: A performance perspective","volume":"5","author":"Agrawal","year":"1993","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining Frequent Patterns without Candidate Generation","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1942517","DOI":"10.1155\/2022\/1942517","article-title":"An Incremental Interesting Maximal Frequent Itemset Mining Based on FP-Growth Algorithm","volume":"2022","author":"Alsaeedi","year":"2022","journal-title":"Complexity"},{"key":"ref_8","unstructured":"Leung, C.K.S., Khan, Q.I., and Hoque, T. (2005, January 27\u201330). CanTree: A tree structure for efficient incremental mining of frequent patterns. Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM\u201905), Houston, TX, USA."},{"key":"ref_9","first-page":"76","article-title":"A fast construction algorithm based on CAN-tree","volume":"31","author":"Chen","year":"2014","journal-title":"Microelectron. Comput."},{"key":"ref_10","first-page":"558","article-title":"Improvement of incremental update algorithm of association rules based on Can tree","volume":"30","author":"Hu","year":"2018","journal-title":"J. Chongqing Univ. Posts Telecommun. Nat. Sci. Ed."},{"key":"ref_11","first-page":"20","article-title":"Research on incremental association mining algorithm based on AP-CAN","volume":"27","author":"Hong","year":"2021","journal-title":"J. Anqing Norm. Univ. Nat. Sci. Ed."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1049\/iet-cps.2019.0094","article-title":"Data Filter Function Incremental Mining based on Feature Selection in an Active Distribution Network","volume":"5","author":"Son","year":"2020","journal-title":"IET Cyber-Phys. Syst. Theory Appl."},{"key":"ref_13","first-page":"1","article-title":"Optimized Incremental Mining of Customer Buying Behavior using Temporal Association Rules","volume":"8","author":"Shalini","year":"2019","journal-title":"Int. J. Innov. Technol. Explor. Eng. IJITEE"},{"key":"ref_14","first-page":"68","article-title":"Temperature prediction based on dynamic weights of fusion models","volume":"45","author":"Chen","year":"2022","journal-title":"Electron. Meas. Technol."},{"key":"ref_15","first-page":"144","article-title":"EFP-tree: An efficient FP-tree for incremental mining of frequent patterns","volume":"11","author":"Davashi","year":"2019","journal-title":"Int. J. Data Min. Model. Manag."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"116220","DOI":"10.1016\/j.eswa.2021.116220","article-title":"Efficient strategies for incremental mining of frequent closed itemsets over data streams","volume":"191","author":"Liu","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_17","first-page":"2875","article-title":"Application of weighted incremental association rule mining in communication alarm prediction","volume":"38","author":"Wang","year":"2018","journal-title":"Comput. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3102","DOI":"10.1093\/bioinformatics\/btz036","article-title":"Benchmarking time-series data discretization on inference methods","volume":"35","author":"Li","year":"2019","journal-title":"Bioinformatics"},{"key":"ref_19","first-page":"313","article-title":"Research on unsupervised discretization methods for multi-volume emergency data","volume":"47","author":"Gao","year":"2021","journal-title":"Comput. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"109032","DOI":"10.1016\/j.apacoust.2022.109032","article-title":"Feature extraction methods of ship-radiated noise: From single feature of multi-scale dispersion Lempel-Ziv complexity to mixed double features","volume":"199","author":"Li","year":"2022","journal-title":"Appl. Acoust."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6024","DOI":"10.1109\/JIOT.2020.3033552","article-title":"Mobility-Aware and Interest-Predicted Caching Strategy Based on IoT Data Freshness in D2D Networks","volume":"8","author":"Zhao","year":"2021","journal-title":"IEEE Int. Things J."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"012082","DOI":"10.1088\/1742-6596\/1693\/1\/012082","article-title":"Research on Alarm Association Mechanism of Information System Based on FP-growth Algorithm","volume":"1693","author":"He","year":"2020","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ruan, G. (2012, January 12\u201314). Customs Risk Identification and Application Based on Set Pair Analysis. Proceedings of the 2012 International Conference on Cybernetics and Informatics, Baku, Azerbaijan.","DOI":"10.1007\/978-1-4614-3872-4_157"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"e10879","DOI":"10.1016\/j.heliyon.2022.e10879","article-title":"A wireless sensor network node fault diagnosis model based on belief rule base with power set","volume":"10","author":"Sun","year":"2022","journal-title":"Heliyon"},{"key":"ref_25","unstructured":"Dong, X. (2020). Web Intelligence, IOS Press."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Esther, P.L., Isa, S., Philipp, S., and Matthias, G. (2022). The value of confidence: Confidence prediction errors drive value-based learning in the absence of external feedback. PLoS Comput. Biol., 18.","DOI":"10.1371\/journal.pcbi.1010580"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/3\/141\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:38:12Z","timestamp":1760121492000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/3\/141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,21]]},"references-count":26,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["info14030141"],"URL":"https:\/\/doi.org\/10.3390\/info14030141","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2023,2,21]]}}}