计算机科学 ›› 2011, Vol. 38 ›› Issue (9): 155-157.

• 数据库与数据挖掘 • 上一篇    下一篇

一种自适应闭值的简洁性约束频繁项目集挖掘算法

任永功,吕联,孙宇奇   

  1. (辽宁师范大学计算机与信息技术学院 大连 116029)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金(60603047),教育部留学回国人员科研启动基金,辽宁省科技计划(2008216014),辽宁省教育厅高等学校科研基金(L2070229),大连市优秀青年科技人才基金(2008J23JH026)资助

Frequent Itemsets Mining Algorithm of Succinct Constraint with Adaptive Thresholds

REN Yong-gong, LU Zhen, SUN Yu-qi   

  • Online:2018-11-16 Published:2018-11-16

摘要: 基于约束关联挖掘,近几年在国际上受到较大关注。从许多约束的关联挖掘算法中发现,传统的约束阂值大多是通过专家给定或经过反复试验得出的,缺乏用户反馈与客观依据的支持。为了解决此问题,提出一种面向用户需求的阂值构造方法,该方法引用正态分布理论获得自适应约束阂值,并应用简洁性约束对FGC算法进行改进;同时提出一种快速、直观、有效的频繁项目集挖掘算法。实验证明,该算法在增强系统可用性的同时降低了算法运行时间。

关键词: 频繁模式树,频繁项目集,简洁性约束,自适应阂值

Abstract: In recent years, associate mining based on constraint is more and more focused. From the algorithm of existing associate mining, it is easy to observe that the traditional thresholds are given mostly by expert or found after repealed test User's feedback and the support of objective evidence was lacked. According to this problem,the construetional method of thresholds catered to user requirement was proposed. To obtain the self-adaptation constraints thresholds, the theory of normal distribution is cited in this method. FGC algorithm is ameliorated by using succinct constraint. A speedy, effective and intuitive frequent items mining algorithm was proposed. Experiments show that the proposed methods can increase the system's availability and reduce the runtime of algorithm.

Key words: FP-Tree,Frequent item-sets,Succinct constraints,Adaptive threshold

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!