摘要
传统的正关联规则主要考虑事务中所列举的项目,负关联规则不仅要考虑事务中所包含的项目,还要考虑事务中所不包含的项目,它包含了非常有价值的信息。本文对负关联规则的相关定义、支持度及置信度的计算方法进行了分析讨论,并讨论了对负关联规则挖掘中出现的矛盾规则问题及利用规则相关性解决矛盾规则问题,最后给出了其挖掘算法及其实现。
The traditional positive association rules mainly concern the listing project of the affairs. The negative association rules is not only including the project of the listing affairs, but also including the affairs which are not listed. It also contains valuable information. The article discusses definition of the negative association rules, computational method of support and confidence level. It also talks about the problems of the negative association rules. Finally, it gets the solutions of algorithm for mining with its application.
出处
《科学技术与工程》
2008年第22期6127-6129,6134,共4页
Science Technology and Engineering
关键词
数据挖掘
负关联规则
频繁项集
data mining frequent item sets negative association rules
