Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (35): 148-150.DOI: 10.3778/j.issn.1002-8331.2009.35.045
• 数据库、信号与信息处理 • Previous Articles Next Articles
RUAN Guang-ce1,Ah-HwweYu2
Received:
Revised:
Online:
Published:
Contact:
阮光册1,Ah-HwweYu2
通讯作者:
Abstract: According to Web association rules mining algorithms,an important problem is neglected that users are interested in the rules or not,a new quantum annealing genetic mining method based on interesting degree is presented.This algorithm uses genetic selection,quantum crossover and annealing mutation to restrain premature convergence effectively.Experimental results demonstrate that this method can solve Web association rule mining effectively.
摘要: 针对当前Web关联规则挖掘算法中,忽略了用户对规则是否感兴趣这一重要因素,文中提出一种新的基于兴趣度的量子退火遗传挖掘算法,并在该算法中,采用遗传选择,量子交叉,退火变异操作,有效地避免了早熟收敛现象。实验结果表明,该方法能高效地解决关联规则挖掘问题。
CLC Number:
TP18
RUAN Guang-ce1,Ah-HwweYu2. Heuristic Web mining algorithm based on interesting degree strategy[J]. Computer Engineering and Applications, 2009, 45(35): 148-150.
阮光册1,Ah-HwweYu2. 基于兴趣度策略的启发式Web挖掘算法[J]. 计算机工程与应用, 2009, 45(35): 148-150.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.35.045
http://cea.ceaj.org/EN/Y2009/V45/I35/148