节点文献

HUIM-IPSO:一个改进的粒子群优化高效用项集挖掘算法

High Utility Itemset Mining Algorithm Based on Improved Particle Swarm Optimization

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王常武尹松林刘文远魏小梅郑红军杨继萍

【Author】 WANG Chang-w u;YIN Song-lin;LIU Wen-yuan;WEI Xiao-mei;ZHENG Hong-jun;YANG Ji-ping;School of Information Science and Engineering,Yanshan University;School of Robotics,Beijing Union University;

【机构】 燕山大学信息科学与工程学院北京联合大学机器人学院

【摘要】 高效用项集挖掘是数据挖掘中发现数据之间关系的技术之一.例如在商业服务领域效用值代表了某些商品组合的利润.高效用项集挖掘能够挖掘出数据中效用值比较大的项集—高效用项集,因此高效用项集挖掘近年来受到了更多的关注与研究.针对高效用项集在数据集中的不均匀分布,提出一个改进的粒子群优化高效用项集挖掘算法.算法改进了粒子群优化流程中种群优化值的生成方式,通过轮盘赌选择法在当前代种群的高效用项集中以一定概率选择下一代种群的初始优化值.这个改进增加了种群的多样性,使得算法能够挖掘出更多的高效用项集.实验结果验证了算法的可行性和有效性.

【Abstract】 High utility itemset mining is one of the techniques for discovering the relationship between data in data mining.Utility value represents the profit of certain commodity combinations in the field of business services.The high utility itemset mining can mine the itemsets with large utility value in the data.Therefore,high utility itemset mining has received more attention and research in recent years.Because the distribution of high utility itemsets are not uniform in the dataset,this paper proposes a high utility itemset mining algorithm based on improved particle swarm optimization.The algorithm changes the generation method of the population optimization value in the particle swarm optimization process.The roulette selection method is used to select the initial optimization value of the next generation population with a certain probability in the high high itemsets of the current generation population.This change increases the diversity of the population,allowing the algorithm to mine more high utility itemsets.Finally,the experimental results verify the feasibility and effectiveness of the algorithm.

  • 【文献出处】 小型微型计算机系统 ,Journal of Chinese Computer Systems , 编辑部邮箱 ,2020年05期
  • 【分类号】TP311.13
  • 【被引频次】4
  • 【下载频次】148
节点文献中: 

本文链接的文献网络图示:

本文的引文网络