中圖分類號：TP311 文獻標志碼：A DOI: 10.16157/j.issn.0258-7998.233873
中文引用格式： 王志昊，蘇明月，李東方，等. 基于約束的多維Apriori改進算法[J]. 電子技術應用，2023，49(10)：100-105.
英文引用格式： Wang Zhihao，Su Mingyue，Li Dongfang，et al. Algorithm of multi-dimensional Apriori with constraints[J]. Application of Electronic Technique，2023，49(10)：100-105.

Algorithm of multi-dimensional Apriori with constraints

Abstract： Aiming at the inefficiency of multi-dimensional association rules mining algorithm and the existence of redundant rules, an algorithm of multi-Dimensional apriori with constraints is proposed. Based on the multi-dimensional Apriori algorithm, the algorithm controls the mining process with user constraints. According to the predicate constraint, the frequent predicate set that is of interest to the user is generated, and the transaction set is deleted based on the predicate constraint. On the one hand, the algorithm greatly reduces the generation of candidate predicate sets through user constraints. On the other hand, the reduced transaction set also reduces the scanning database overhead. Finally, the efficiency of mining is improved and the redundant rules are reduced. This algorithm is used to compare experiments on FPGA code defect transaction sets. The experimental results show that compared with the multi-dimensional Apriori algorithm, this algorithm has improved the search efficiency of frequent predicate sets and the accuracy of mining results.

Key words : association rules mining；multi-dimensional association rule；Apriori；frequent predicate set；predicate constraint；data mining