一种双向关联规则提取算法  

A Extraction Algorithm of Two-way Association Rules

作　　者：袁彩虹[1] 张连堂[1] 

机构地区：[1]河南大学计算机与信息工程学院,河南开封475004

出　　处：《电脑知识与技术（过刊）》2009年第2X期1204-1206,共3页Computer Knowledge and Technology

摘　　要：针对互为"前件"和"后件"的单向关联规则中发现的有趣现象,提出双向关联规则的概念,对"置信度"进行了重新的定义和分类,并在分析的基础上,提出一种双向关联规则的挖掘算法。Against the interesting phenomenon found in the one-way association rules in which one's ‘before the rule' is other's 'after the rule', it put forward the concept of two-way association rules and "confidence" to be carried out a re-definition and classification. And based on analysis, a two-way algorithm for mining association rules is put forword.

关 键 词：双向关联规则 左置信度 右置信度 强双向关联规则 强弱双向关联规则 频繁项集 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]