摘要
项目的引入使得挖掘出的频繁项集成倍增加,同时生成的关联规则数量更加庞大,引入兴趣度来约束从频繁项集中提取关联规则的数量。分析现有的兴趣度模型,从中选择了一种适合于含正负项目的关联规则挖掘的兴趣度方法,并且提出了置信度的一个性质,描述了含正负项目的频繁项集挖掘关联规则的算法,并对矛盾关联规则进行了分析。实验结果表明,该算法是有效和可行的。
Negative item brings the increase of frequent items and makes association rules doubled.Interest measure is adopted to restrict the amount.By analyzing current interest measure models,the deviation-based interest measure is chosen and the confidence property is presented.An association rule mining algorithm based on interest measure with positive and negative items is described.And the analysis of conflict association rules is given.The experimental results indicate the given algorithm is efficient and feasible.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2010年第3期407-411,共5页
Journal of University of Electronic Science and Technology of China
基金
教育部留学回国人员启动基金(教外司留[2007]1108-10)
中国博士后科学基金(20070420711)
关键词
关联规则
置信度
兴趣度
负项目
association rule
confidence measure
interest measure
negative item
