计算机应用 ›› 2005, Vol. 25 ›› Issue (05): 1009-1011.DOI: 10.3724/SP.J.1087.2005.1009

• 数据挖掘 • 上一篇    下一篇

基于模拟退火遗传算法的关联规则挖掘

武兆慧,张桂娟,刘希玉   

  1. 山东师范大学信息管理学院
  • 发布日期:2005-05-01 出版日期:2005-05-01
  • 基金资助:

    国家自然科学基金资助项目 (6037405 );;山东省自然科学基金资助项目(Z2004G02);;山东省中青年科学家奖励基金资助项目(03BS003)

Association rule mining based on simulated annealing genetic algorithm

WU Zhao-hui, ZHANG Gui-juan, LIU Xi-yu   

  1. School of Information and Management, Shandong Normal University
  • Online:2005-05-01 Published:2005-05-01

摘要: 将模拟退火遗传算法加以改进,应用于关联规则挖掘,提出一种新的基于改进的模拟退火遗传算法的关联规则挖掘算法,并在该算法中,采用自适应方式动态选取交叉和变异概率,有效地抑制了早熟收敛现象,实验结果显示该方法能高效地解决关联规则挖掘问题。

关键词: 关联规则, 遗传算法, 模拟退火算法, 模拟退火遗传算法

Abstract: Simulated annealing genetic algorithm was improved and used in association rule mining. A new association rule mining algorithm based on improved simulated annealing genetic algorithm was presented. This algorithm used adaptive crossover probability and mutation probability, and restrained premature convergence effectively. Experiment results demonstrate that this method can solve association rule mining effectively.

Key words: association rule, genetic algorithm, simulated annealing algorithm, simulated annealing genetic algorithm

中图分类号: