基于多最小支持度的加权关联规则挖掘算法  

Algorithm of weighted association rules mining with multiple minimum supports

作　　者：邹力鹍[1] 张其善[1] 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100083

出　　处：《北京航空航天大学学报》2007年第5期590-593,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：航空基金资助项目(2006ZC51032);863资助项目(2006AA701424)

摘　　要：针对交易数据库中数据项重要性不同的现象,提出了新的加权关联规则模型,并基于该模型设计了一个基于多最小支持度的加权关联规则挖掘新算法,允许用户设定多个最小支持度,为数据项设置不同的权重,从而解决数据项的重要性各不相同且出现频率不均匀的问题,发现更多有趣的规则.理论证明了相关性质,并实验验证了算法的有效性.A new model of weighted association rule was presented in order to solve the problem that data item have not the same importance in datasets. Based on this model, a new algorithm of mining weighted association rules with multiple minimum supports was proposed. The algorithm allows the user to specify varied minimum supports and items weights to reflect the importance and frequency of each data item in datasets . The algorithm aims to deal with problem that items have different importance and varied frequency in transaction database and find more interesting rules which involve both frequent and rare items. The correlative properties of model and algorithm were given and the theories were proved. Finally, the algorithm was tested on the experimental data. Experiment results show that the new algorithm is effective for large databases.

关 键 词：数据挖掘 加权关联规则 多支持度 

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