关联规则兴趣度问题研究  

Research on Association Rules Interestingness Question

作　　者：梅志芳[1] 王建[1] 

机构地区：[1]华南农业大学工程学院,广州510642

出　　处：《计算机工程》2010年第1期38-39,42,共3页Computer Engineering

基　　金：基金项目：华南农业大学博士启动基金资助项目（B2004003）

摘　　要：经典的关联规则都是使用基于支持度和可信度的度量标准，但经过实践应用证明存在很多问题。为此，引入兴趣度作为关联规则的新度量标准，阐述当前重点研究的客观兴趣度，对PS公式进行探讨，提出它的优点和不足，在此基础上进行相关改进，克服了可信度与支持度框架的缺陷，具有优化关联规则挖掘的作用。The classical association rules are all based on supports and the confidence measure standard, but application proves there are many questions. This paper introduces the interestingness as association rules new measure standard, elaborates present key research objective interestingness, specially carries on the thorough discussion to the PS formula, proposes its merit and the insufficiency, and makes the related improvement in this foundation. The improvement overcomes the confidence and the support frame flaw, and optimizes the function of association rules.

关 键 词：关联规则 兴趣度 PS公式 

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