检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:晏杰[1]
机构地区:[1]武夷学院数学与计算机学院,福建武夷山354300
出 处:《吉林师范大学学报(自然科学版)》2014年第4期51-53,共3页Journal of Jilin Normal University:Natural Science Edition
摘 要:本文重点研究了关联规则经典算法Apriori算法的基本思想,并通过实例说明发现频繁项集的方法,提出了Apriori算法的不足,并结合spss clementine软件将关联挖掘应用于某超市的销售数据,从大类及二级类商品之间两个方面进行挖掘,针对挖掘结果进行了分析,同时提出建议,为超市提供辅助决策信息.The basic idea of the Apriori algorithm which was a classical algorithm of association rules was studied,and how to find the frequent itemsets method was illustrated through an example. The defects of Apriori algorithm was also put forward,and the association mining was used in sales data of a supermarket combining with the spss clementine software,mining from two aspects between categories and two categories of goods. The mining results were analysed,and the relevant recommendations were also given,to provide supporting information for the supermarket.
关 键 词:关联规则 APRIORI 算法 CLEMENTINE
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31