基于可拓理论的Apriori数据挖掘算法分析  

Analysis of Classic Data Mining and Extentics Theory Based on Data Mining

作　　者：马丽丽[1] 

机构地区：[1]西安工程大学计算机科学学院,西安710048

出　　处：《计算机与数字工程》2010年第3期9-11,20,共4页Computer & Digital Engineering

基　　金：西安工程大学校管课题基金项目(编号:2008XG06)资助

摘　　要：介绍了数据挖掘以及可拓学理论,阐述了两者之间的关系。对经典的数据挖掘Apriori算法和基于可拓理论的Apriori算法进行算法实现和对比。结合实际应用对这两种算法进行测试。测试结果表明基于可拓理论的Apriori算法能够避免冗余规则的产生,挖掘出的结果集简洁而且完备。Data mining and extentics theory were introduced in this paper,and we descript the relationship of them.Then we represent the classic Apriori algorithm and extentics theory based algorithm,and we apply this two algorithms in an example,and test the results for contrast.Test results show that the algorithm based on extentics theory has the ability to avoid redundant rules and the mined rules are more simple and complete.

关 键 词：数据挖掘 可拓学 APRIORI算法 冗余规则 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]