首页 | 官方网站   微博 | 高级检索  
     

加权关联规则挖掘算法的研究
引用本文:陆建江.加权关联规则挖掘算法的研究[J].计算机研究与发展,2002,39(10):1281-1286.
作者姓名:陆建江
作者单位:解放军理工大学通信工程学院,南京,210007
基金项目:国家自然科学基金重点项目资助(69931040)
摘    要:讨论了加权关联规则的挖掘算法,对布尔型属性,在挖掘算法MINWAL(O)和MINWAL(W)的基础上给出一种改进的加权关联规则挖掘算法,此算法能有效地考虑布尔型属必的重要性和规则中所含属性的个数,对数量型属性,应用竞争聚集算法将数量型属性划分成若干个模糊集,产系统地提出加权模糊关联规则的挖掘算法,此算法能有效地考虑数量型属性的重要性和规则中所含属性的个数,并适用于大型数据库。

关 键 词:数据挖掘  关联规则  模糊集  支持率  可信度  竞争聚集算法  数据库

RESEARCH ON ALGORITHMS OF MINING ASSOCIATION RULES WITH WEIGHTED ITEMS
LU Jian-Jiang.RESEARCH ON ALGORITHMS OF MINING ASSOCIATION RULES WITH WEIGHTED ITEMS[J].Journal of Computer Research and Development,2002,39(10):1281-1286.
Authors:LU Jian-Jiang
Abstract:Algorithms for mining the weighted association rules are discussed in this paper. As far as Boolean attributes are concerned, an improved algorithm for mining the weighted association rules is provided based on the mining algorithms of MINWAL(O) and MINWAL(W). This algorithm can effectively consider the importance of Boolean attributes and the amount of attributes in the rule. As for quantitative attributes, they are divided into several fuzzy sets by the competitive agglomeration algorithm, and then the algorithm for mining weighted fuzzy association rules is provided. This algorithm can effectively consider the importance of quantitative attributes and the amount of attributes in the rule, and can be fit for large database.
Keywords:data mining  association rules  fuzzy sets  support  confidence  competitive agglomeration algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号