首页> 外文期刊>Journal of Theoretical and Applied Information Technology >DISCOVERY OF MAXIMAL FREQUENT ITEMSET USING PRIME ALGORITHM
【24h】

DISCOVERY OF MAXIMAL FREQUENT ITEMSET USING PRIME ALGORITHM

机译:使用Prime算法发现最大频繁项目集

获取原文
       

摘要

Data mining is the technique of discovering the new patterns in large data sets with reference to various methods at the intersection of statistics, machine learning and database systems. Computer science and statistics are the interdisciplinary subfield of data mining. The overall goal of data mining is to extort information from a data set and renew or reframe the information into a structure. Association rule is a research area in the field of data searching for frequent and using the criteria support to find frequently the items appear in the data and confidence to identify the most important relationships. In focus of this paper is to find maximal frequent itemset using a new algorithm called maximal Frequent Itemset using Prime algorithm. Most of the association rule algorithms are used to find the minimal frequent item set, and then with the help minimal frequent item set derive the maximal frequent item set. But it consumes lot of time. So to overcome this problem a new approach Maximal Frequent Itemset using Prime algorithm is proposed to find the maximal frequent item set directly. The proposed method is efficient in finding the maximal frequent item set.
机译:数据挖掘是在统计,机器学习和数据库系统交叉口的各种方法中发现大数据集中的新模式的技术。计算机科学与统计数据是数据挖掘的跨学科子领域。数据挖掘的总体目标是从数据集中汇集信息并更新或将信息重新延长到结构中。关联规则是在数据领域的研究区域,用于频繁,使用标准支持来查找频繁的项目出现在数据和置信度上来识别最重要的关系。在本文的焦点中,使用Prime算法使用称为最大频繁项目集的新算法来查找最大频繁的项目集。大多数关联规则算法用于找到最小的频繁项目集,然后使用帮助最小频繁项目集导出最大频繁项目集。但它消耗了很多时间。因此,为了克服这个问题,建议使用Prime算法最大频繁项目集的新方法,以找到直接设置的最大频繁项目。所提出的方法在找到最大频繁项目集中是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号