首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种改进的负关联规则挖掘算法
引用本文:卢景丽,徐章艳,刘美玲,区玉明.一种改进的负关联规则挖掘算法[J].广西师范大学学报(自然科学版),2004,22(2):41-46.
作者姓名:卢景丽  徐章艳  刘美玲  区玉明
作者单位:广西师范大学,数学与计算机科学学院,广西,桂林,541004
基金项目:澳大利亚ARC基金资助项目(DP0343109)
摘    要:负关联规则A→—B(或者-A→B,-A→B)描述的是项目之间的互斥关系,其与传统的关联规则有着同样重要的作用.然而,负关联规则和传统正关联规则的挖掘有很大不同,因为负关联规则隐藏在数量巨大的非频繁项集中.因此提出一种新的挖掘horn子句类型负关联规则的算法,并且实验证明是行之有效的.

关 键 词:数据挖掘  关联规则  负关联规则  兴趣度  负项集
文章编号:1001-6600(2004)02-0041-06

AN IMPROVED ALGORITHM FOR IDENTIFYING NEGATIVE ASSOCIATION RULES
LU Jing-li,XU Zhang-yan,LIU Mei-ling,OU Yu-ming.AN IMPROVED ALGORITHM FOR IDENTIFYING NEGATIVE ASSOCIATION RULES[J].Journal of Guangxi Normal University(Natural Science Edition),2004,22(2):41-46.
Authors:LU Jing-li  XU Zhang-yan  LIU Mei-ling  OU Yu-ming
Abstract:Negative association rules (NAR) catch mutually-exclusive correlations among items.They play important roles just as traditional association rules (TAR) do.For example,in stock market surveillance based on alert-logs,NARs detect which alerts are false.There are essential differences between mining TARs and NARs because NARs are hidden in infrequent itemsets.This paper presents a new algorithm for mining horn-clause-based negative association rules.To evaluate this algorithm,the authors have illustrated the efficiency by a group of experiments.
Keywords:data mining  association rules  negative association rules  interestingness  negative itemsets
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号