本文已被：浏览 1456次 下载 4015次
Received:April 28, 2013 Revised:September 22, 2013
Received:April 28, 2013 Revised:September 22, 2013
中文摘要: 分析了单最小支持度关联规则挖掘的局限性，提出了基于多最小支持度的关联规则挖掘模型，重点研究了多最小支持度MS-Apriori算法的基本思想，指出了算法的优缺点并通过实例说明发现频繁项集的方法，最后指出该算法的不足及改进算法.
中文关键词: 关联规则 多最小支持度 MS-Apriori算法
Abstract:This paper analyzed the limitation of the single minimum support degree of association rule mining. We put forward the model of association rule mining based on multiple minimum support. Our work focus on the multiple minimum support MS -Apriori algorithm the basic idea and points out the advantages and disadvantages of the algorithm with practical examples. Our work found that the method of frequent itemsets, and finally points out the shortage of the algorithm and improved algorithm.
文章编号： 中图分类号： 文献标志码：
基金项目:
引用文本：
晏杰,亓文娟,郭磊,黄书城.基于多最小支持度的关联规则挖掘.计算机系统应用,2014,23(3):237-239,219
YAN Jie,QI Wen-Juan,GUO Lei,HUANG Shu-Cheng.Based on Multiple Minimum Supports of Association Rules in Data Mining.COMPUTER SYSTEMS APPLICATIONS,2014,23(3):237-239,219
晏杰,亓文娟,郭磊,黄书城.基于多最小支持度的关联规则挖掘.计算机系统应用,2014,23(3):237-239,219
YAN Jie,QI Wen-Juan,GUO Lei,HUANG Shu-Cheng.Based on Multiple Minimum Supports of Association Rules in Data Mining.COMPUTER SYSTEMS APPLICATIONS,2014,23(3):237-239,219
