Prompt Update Algorithm Based on the Boolean Vector Inner Product and Ant Colony Algorithm for Fast Target Type Recognition

Abstract

In recent years, data mining technology has become increasingly popular, evolving into an independent discipline as research deepens. This study constructs and optimizes an association rule algorithm based on the Boolean vector (BV) inner product and ant colony optimization to enhance data mining efficiency. Frequent itemsets are extracted from the database by establishing BV and performing vector inner product operations. These frequent itemsets form the problem space for the ant colony algorithm, which generates the maximum frequent itemset. Initially, data from the total scores of players during the 2022–2024 regular season was analyzed to obtain the optimal lineup. The results obtained from the Apriori algorithm (AA) were used as a standard for comparison with the Confidence-Debiased Adversarial Fuzzy Apriori Method (CDAFAM), the AA based on deep learning (DL), and the proposed algorithm regarding their results and required time. A dataset of disease symptoms was then used to determine diseases based on symptoms, comparing accuracy and time against the original database as a standard. Finally, simulations were conducted using five batches of radar data from the observation platform to compare the time and accuracy of the four algorithms. The results indicate that both the proposed algorithm and the AA based on DL achieve approximately 10% higher accuracy compared with the traditional AA. Additionally, the proposed algorithm requires only about 25% of the time needed by the traditional AA and the AA based on DL for target recognition. Although the CDAFAM has a similar processing time to the proposed algorithm, its accuracy is lower. These findings demonstrate that the proposed algorithm significantly improves the accuracy and speed of target recognition.