首页> 外文会议>International Conference on Computer, Communication, Control and Information Technology >Fuzzy Frequent Pattern Mining from Gene Expression Data using Dynamic Multi-Swarm Particle Swarm Optimization
【24h】

Fuzzy Frequent Pattern Mining from Gene Expression Data using Dynamic Multi-Swarm Particle Swarm Optimization

机译:使用动态多群粒子群优化基因表达数据的模糊频繁模式挖掘

获取原文

摘要

Frequent pattern mining is a basic problem as well as an important task in data mining and knowledge discovery. But however, frequent patterns in large scale datasets is an extremely time consuming task. So, in order to reduce the time the fuzzy concept was introduced in order to discretize the dataset in the range of 0 to 1. The Particle Swarm Optimizing (PSO) algorithm was basically developed from the social behavior of various animals likes bird flocking and fish schooling etc. In the existing versions of the local PSO algorithm with different neighborhood structures and the multi swarm PSOs, the swarms are predefined or dynamically adjusted according to the distance. Due to this the freedom of sub-swarms is limited. But in dynamic multi-swarm particle swarm optimizer (DMS-PSO) the neighborhood structure is dynamic and randomized. In this paper, a fuzzy data set has been used and various frequent pattern mining techniques like Apriori, Vertical data format and Frequent Pattern (FP) growth were implemented. Out of various frequent pattern mining techniques it was clear that FP growth method yields the better results on a fuzzy dataset. The frequent patterns obtained were considered as the set of initial population or particles. For the selection criteria, we have considered the mean squared residue (MSR) score rather using the threshold value. It has been observed that DMS-PSO based fuzzy FP growth technique finds the best individual frequent patterns as compared to the traditional PSO based fuzzy FP growth and also the runtime of the first was much better than the latter.
机译:频繁的模式挖掘是一个基本问题以及数据挖掘和知识发现中的重要任务。但是,大规模数据集中的频繁模式是一个非常耗时的任务。因此,为了减少引入模糊概念的时间,以便将数据集离散到0到1的范围内。粒子群优化(PSO)算法基本上从各种动物的社会行为中发展,喜欢鸟类植绒和鱼类学校教育等在具有不同邻域结构的本地PSO算法的现有版本中和多群PSO的情况下,群体的预定义或根据距离动态调整。由于这,子群的自由有限。但是在动态多群粒子群优化程序(DMS-PSO)中,邻域结构是动态和随机的。在本文中,已经使用了模糊数据集,并实施了诸如APRIORI,垂直数据格式和频繁模式(FP)增长的各种频繁的模式挖掘技术。出于各种频繁的模式挖掘技术,显然FP生长方法在模糊数据集中产生更好的结果。所得频繁的模式被认为是初始群体或颗粒的一组。对于选择标准,我们已经考虑了使用阈值的平均平方残差(MSR)得分。已经观察到基于DMS-PSO的模糊FP增长技术发现与传统的PSO的模糊FP生长相比,最佳的频繁模式以及第一个的运行时间比后者要好得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号