作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (02): 56-58. doi: 10.3969/j.issn.1000-3428.2007.02.019

• 软件技术与数据库 • 上一篇    下一篇

一种用于挖掘正负关联规则的可量化标准

赵 亮1,萧德云1,刘震涛2   

  1. (1. 清华大学自动化系,北京 100084;2. 清华大学台湾研究所,北京 100084)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-01-20 发布日期:2007-01-20

Quantitative Criterion for Mining Both Positive and Negative Association Rules

ZHAO Liang1, XIAO Deyun1, LIU Zhentao2   

  1. (1. Department of Automation, Tsinghua University, Beijing 100084; 2. Institute of Taiwan Studies, Tsinghua University, Beijing 100084)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-01-20 Published:2007-01-20

摘要: 传统的关联规则数据挖掘的支持度-置信度框架存在着弊端。一方面,它不能发现同时满足支持度和置信度而其前提和结论却相互独立的规则;另一方面,也不能区分正负关联规则。该文提出了一种评价关联规则的可量化的标准,进一步提出一种同时挖掘正负关联规则的框架,用此框架来分析调研问卷。

关键词: 负关联规则, 相关性, 数据挖掘, 问卷

Abstract: The conventional framework for mining association rules is the support-confidence framework which has some limitations. For one thing, it can not prune such useless rules as satisfy both minimum support and minimum confidence with their antecedents and consequents independent. For another thing, it can neither separate the negative association rules from the positive ones. The purposes of this paper are to find a quantitative criterion for mining both positive and negative association rules, and further put forward a novel framework whose efficiency is tested in analyzing a questionnaire.

Key words: Negative association rules, Correlation, Data mining, Questionnaire