计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (24): 150-152.DOI: 10.3778/j.issn.1002-8331.2009.24.044

• 数据库、信息处理 • 上一篇    下一篇

多数据库中负关联规则挖掘算法

尚世菊1,董祥军1,李 杰2   

  1. 1.山东轻工业学院 信息科学与技术学院,济南 250353
    2.广西大学 数学与信息科学学院,南宁 530004
  • 收稿日期:2008-05-08 修回日期:2008-08-05 出版日期:2009-08-21 发布日期:2009-08-21
  • 通讯作者: 尚世菊

Algorithms for mining negative association rules in multi-database

SHANG Shi-ju1,DONG Xiang-jun1,LI Jie2   

  1. 1.School of Information Science and Technology,Shandong Institute of Light Industry,Jinan 250353,China
    2.College of Mathematics and Information Science,Guangxi University,Nanning 530004,China
  • Received:2008-05-08 Revised:2008-08-05 Online:2009-08-21 Published:2009-08-21
  • Contact: SHANG Shi-ju

摘要: 现行的负关联规则挖掘主要是对于单一数据库的挖掘,但随着数据库技术的发展,多数据库挖掘越来越重要。当同时挖掘多数据库中的正负关联规则时,有可能会引起知识冲突问题,在前人对多数据库挖掘的基础上采用了一种关联规则合成模式,并利用相关性解决了知识冲突问题,最后用实验证明了该方法的正确性。

关键词: 负关联规则, 据挖掘, 数据库

Abstract: Nowadays the techniques of negative association rules mining focus on mono-database.With the rapid development of database technologies,multi-database mining is becoming more and more important.Knowledge conflicts within databases may occur when mining both the positive and negative association rules simultaneously.This paper proposes the model of synthesizing association rules and synthesis correlation to resolve conflicts on base of previous work on multi-database mining.The experimental results demonstrate that the algorithm is correct and effective.

Key words: negative association rules, ata mining, ulti-database

中图分类号: