基于多变异粒子群优化算法的模糊关联规则挖掘  

Mining Fuzzy Association Rules Based on Multi-mutation Particle Swarm Optimization Algorithm

作　　者：王飞[1] 缑锦[1] 

机构地区：[1]华侨大学计算机科学与技术学院,厦门361021

出　　处：《计算机科学》2013年第5期217-223,共7页Computer Science

基　　金：国家自然科学基金项目(61103170);厦门市科技计划项目(3502Z20113022)资助

摘　　要：针对事务数据库中连续型数值较难划分及粒子群优化算法易陷入局部最优的问题,提出一种用多变异粒子群优化算法进行模糊关联规则提取的框架,即先对连续型数值进行模糊区间划分,再通过多变异粒子群优化算法对划分结果进行模糊关联规则挖掘。分别对模糊划分方法和多变异粒子群优化算法的相关参数及框架等进行说明。在多组实验中进行比较分析,结果表明了该方法的准确性和有效性。To deal with the problem that continuous value in the transaction database are difficult to divide and particle swarm optimization algorithm is easy to be troubled with local optimal, this paper proposed a framework about multi- mutation particle swarm optimization algorithm for extracting fuzzy association rules. Firstly, the continuous values are divided into the fuzzy interval. Then using multi-mutation particle swarm optimization algorithm to mine the fuzzy asso- ciation rules from the division results. This paper described the fuzzy division method and multi-mutation particle swarm optimization algorithm＇s parameters, framework and others. And it proved the accuracy and efficiency of this method by comparative analysis in several experiments.

关 键 词：数据挖掘 粒子群优化 变异算子 多变异算子 关联规则 模糊规则 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]