Aiming at the shortcomings of Apriori algorithm in association rules, an improved Apriori algorithm based on Boolean matrix reduction is proposed.In this algorithm, the transaction database is converted into a Boolean matrix, and one row and two columns are added at the end of the matrix to record the number of the same transactions and the number of 1 in the matrix row and column.According to the number of supports, the elements of each matrix column are arranged in ascending order, so the number of scanning matrix columns is reduced in the process of compressing the matrix and the time efficiency of the algorithm is improved. In addition, in order to improve the spatial efficiency of the algorithm, the operation of deleting infrequent itemsets is added.Experimental results and performance analysis prove that the improved algorithm has better performance than the existing Apriori algorithm, and can effectively improve the computational efficiency of the algorithm.