说明：  本文提出来一种基于关联规则挖掘的二进制粒子群优化算法（BPSO），该算法与apriori算法不同，在从交易数据集中提取关联规则的过程中不需要给定支持度与置信度的阈值。
(In this paper, we developed a binary particle swarm optimization (BPSO) based association rule miner. Our BPSO based association rule miner generates the association rules from the transactional database by formulating a combinatorial global optimization problem, without specifying the minimum support and minimum confi dence unlike the a priori algorithm. )