...
首页> 外文期刊>Network and Complex Systems >Mining Interesting Positive and Negative Association Rule Based on Improved Genetic Algorithm (MIPNAR_GA)
【24h】

Mining Interesting Positive and Negative Association Rule Based on Improved Genetic Algorithm (MIPNAR_GA)

机译:基于改进遗传算法(MIPNAR_GA)的正负关联兴趣规则挖掘

获取原文
           

摘要

Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the mining of positive and negative rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. A number of algorithms are wonder performance but produce large number of negative association rule and also suffered from multi-scan problem. The idea of this paper is to eliminate these problems and reduce large number of negative rules. Hence we proposed an improved approach to mine interesting positive and negative rules based on genetic and MLMS algorithm. In this method we used a multi-level multiple support of data table as 0 and 1. The divided process reduces the scanning time of database. The proposed algorithm is a combination of MLMS and genetic algorithm. This paper proposed a new algorithm (MIPNAR_GA) for mining interesting positive and negative rule from frequent and infrequent pattern sets. The algorithm is accomplished in to three phases: a).Extract frequent and infrequent pattern sets by using apriori method b).Efficiently generate positive and negative rule. c).Prune redundant rule by applying interesting measures. The process of rule optimization is performed by genetic algorithm and for evaluation of algorithm conducted the real world dataset such as heart disease data and some standard data used from UCI machine learning repository.
机译:关联规则挖掘是一种非常有效的技术,可用于找到相关数据之间的牢固关系。数据的相关性意味着完整的提取过程。为了挖掘肯定和否定规则,使用了各种算法,例如Apriori算法和基于树的算法。许多算法具有令人惊奇的性能,但是会产生大量的负关联规则,并且还会遭受多重扫描问题。本文的想法是消除这些问题并减少大量的负面规则。因此,我们提出了一种基于遗传和MLMS算法的有趣的正负规则挖掘方法。在这种方法中,我们使用了对数据表的多级多重支持(分别为0和1)。分割过程减少了数据库的扫描时间。所提出的算法是MLMS和遗传算法的结合。本文提出了一种新算法(MIPNAR_GA),用于从频繁和不频繁的模式集中挖掘有趣的正负规则。该算法分三个阶段完成:a)使用先验方法提取频繁和不频繁的模式集b)有效地生成正负规则。 c)。通过应用有趣的措施修剪冗余规则。规则优化的过程由遗传算法执行,并且为了评估算法,对现实世界的数据集进行了评估,例如心脏病数据和UCI机器学习存储库中使用的一些标准数据。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号