计算机工程 ›› 2018, Vol. 44 ›› Issue (10): 168-174.doi: 10.19678/j.issn.1000-3428.0047966

• 人工智能及识别技术 • 上一篇    下一篇

基于修正BPSO的通用模式指标上界估算方法

王菊1,刘付显1,靳春杰2   

  1. 1.空军工程大学 防空反导学院,西安 710051; 2.93527部队,河北 张家口 075000
  • 收稿日期:2017-07-14 出版日期:2018-10-15 发布日期:2018-10-15
  • 作者简介:王菊(1991—),女,博士研究生,主研方向为数据挖掘;刘付显,博士生导师;靳春杰,助理工程师。

Estimation Method for Upper Bound of General Pattern Index Based on Modified BPSO

WANG Ju1,LIU Fuxian1,JIN Chunjie2   

  1. 1.Air and Missile Defense College,Air Force Engineering University,Xi’an 710051,China; 2.93527 Troop,Zhangjiakou,Hebei 075000,China
  • Received:2017-07-14 Online:2018-10-15 Published:2018-10-15

摘要: 针对约束频繁模式挖掘中模式指标的界值估算问题,提出一种基于修正二进制粒子群优化(BPSO)算法的通用模式指标上界估算方法。根据带有权值的不确定型事务数据库的特点,建立通用的模式指标上界估算框架,并提出在该框架下基于修正BPSO的模式指标上界值求解方法。对比UHUI-Apriori算法分别结合事务加权效用值、本文方法估算所得上界值和实际上界值后的候选项集数量、运行时间和内存占用情况,结果表明,该方法可以较快计算模式效用的上界值,且能够节省运行时间和内存空间。

关键词: 不确定型数据库, 模式指标, 界值估算, 粒子群优化算法, 约束频繁模式挖掘

Abstract: A general pattern index upper bound estimation method based on modified Binary Particle Swarm Optimization (BPSO) algorithm is proposed to estimate the boundary value estimation problem in constrained frequent pattern mining.According to the characteristics of the uncertain transaction database with weights,a general pattern index upper bound estimation framework is established,and the method of solving the upper bound value of the pattern index based on the modified BPSO is proposed.The number of candidate itemses,runtime and memory usage of the UHUI-Apriori with Transaction Weighted Utilization(TWU),the proposed method estimates upper bound and the actual upper bound are compared,and the results show that the proposed method can quickly calculate the upper bound value of the mode utility and save the running time and memory space.

Key words: uncertain database, pattern index, bound value estimation, Particle Swarm Optimization(PSO) algorithm, constrained frequent pattern mining

中图分类号: