数据挖掘中关联规则的研究与论证  

Research and demonstration on association rules based bata mining

作　　者：王杰[1] 张静[1] 张继生[1] 曾子维[1] 

机构地区：[1]鞍山科技大学计算机科学与工程学院,辽宁鞍山114044

出　　处：《鞍山科技大学学报》2005年第2期123-126,共4页Journal of Anshan University of Science and Technology

摘　　要：数据挖掘由一些大型零售机构面临的"决策支持"问题所激发。对数据挖掘中的关联规则的概念和作用进行了探讨,对关联规则中寻找大项集的部分用程序流程的方式加以说明,对自连接操作的提高效率问题加以论证。通过例子说明了数据挖掘关联规则中最大项目集的子集必为最大项目集。Data mining is motivated by the decision support problem faced by most large retail organizations.The concept and function of association rules were discussed.A application program to seek the large item set in association rules was presented.And the efficiency improving of linked-self operation was analyzed.The largest item set to be a item set was illuatrated as a exaple.

关 键 词：数据挖掘 关联规则 最小支持度 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]