| 挖掘数据库中的负频繁模式 |
| |
| 引用本文： | 袁本刚,陈莉,金燕.挖掘数据库中的负频繁模式[J].计算机工程与应用,2010,46(8):117-119. |
| |
| 作者姓名： | 袁本刚 陈莉 金燕 |
| |
| 作者单位： | 1. 西北大学,信息科学与技术学院,西安,710127
2. 陕西师范大学,新闻与传播学院,西安,710062 |
| |
| 基金项目： | 陕西省自然科学基金 Grant No.98X11;;陕西省教育厅重点科研计划项目Grant No.00JK015~~ |
| |
| 摘 要： | 传统的关联规则挖掘研究事务中所包含的项与项之间的关联性，而负关联规则挖掘不仅要考虑事务中包含的项，还要考虑事务中不包含的项。给出了完全负关联规则的定义，提出一种基于树的算法Free-PNP，通过此算法挖掘数据库中的负频繁模式，继而得到所要挖掘的完全负关联规则。通过实验验证了算法的有效性。
|
| 关 键 词： | 负关联规则 负频繁模式 频繁模式树 |
| 收稿时间： | 2008-9-19 |
| 修稿时间： | 2008-11-28
|
Mining of negative frequent patterns in databases |
| |
| YUAN Ben-gang,CHEN Li,JIN Yan.Mining of negative frequent patterns in databases[J].Computer Engineering and Applications,2010,46(8):117-119. |
| |
| Authors: | YUAN Ben-gang CHEN Li JIN Yan |
| |
| Affiliation: | YUAN Ben-gang1,CHEN Li1,JIN Yan21.School of Information Science , Technology,Northwest University,Xi'an 710127,China 2.Knowledge Media Institute,Shaanxi Normal University,Xi'an 710062,China |
| |
| Abstract: | Typical association rules mining studies on associations between items found in transactions in databases.Negative association rules mining considers absent items in databases as well as existing items.A concept of complete negative association rules is proposed.A tree-based algorithm named Free-PNP is presented by which negative frequent patterns can be found from databases and complete negative association can be obtained.Experiments demonstrate its effectiveness and efficiency. |
| |
| Keywords: | negative association rules negative frequent patterns FP-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
