首页> 外文期刊>Journal of computational and theoretical nanoscience >Association Rules Mining Algorithm Using Sharing Mechanism Niche Leaping Ant Colony Based on Apriori Algorithm
【24h】

Association Rules Mining Algorithm Using Sharing Mechanism Niche Leaping Ant Colony Based on Apriori Algorithm

机译:基于APRiori算法的基于APRIORI算法的共用机制利基跨越蚁群的关联规则挖掘算法

获取原文
获取原文并翻译 | 示例
           

摘要

Based on the alarm data in the information communication network under the context of big data, the paper discusses the classic association mining algorithms of Apriori and FP-Growth with living examples, elaborates the ant colony algorithm and the niche technology, combines the Apriori algorithm thought and the Travelling Salesman Problem (TSP) of the ant colony algorithm, and proposes association rules mining algorithm using Sharing mechanism Niche Leaping Ant Colony based on Apriori algorithm (SN-APLAC algorithm). The algorithm achieves the thought of "leaping ants" by accelerating support calculation through a sparse linked list and setting the route point of non frequent item sets as "stimulation point" and retains the local optimal solution to further improve the quality of association rules mining utilizing the technique of sharing mechanism niche.
机译:基于信息通信网络中的报警数据在大数据的上下文下,讨论了APRIORI和FP-Grows的经典协会挖掘算法与生活实例,详细阐述了ALISI算法的蚂蚁殖民地算法和利基技术 蚁群算法的旅行推销员问题(TSP),并提出了基于APRIORI算法的共享机制利基剥离蚁群的关联规则挖掘算法(SN-APLAC算法)。 通过通过稀疏链接列表加速支持计算并将非频繁项目集的路由点设置为“刺激点”来实现“跳跃蚂蚁”的想法,并保留了利用的关联规则挖掘的局部优化解决方案 共享机制的技术。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号