计算机应用 ›› 2010, Vol. 30 ›› Issue (10): 2624-2627.

• 数据库与数据挖掘 • 上一篇    下一篇

改进的关联分类算法在交叉营销中的应用

王丹丹,徐慧   

  1. 南通大学
  • 收稿日期:2010-04-12 修回日期:2010-06-23 发布日期:2010-09-21 出版日期:2010-10-01
  • 通讯作者: 王丹丹
  • 基金资助:
    南通市应用研究资助项目;南通市应用研究资助项目;南通市应用研究资助项目;南通大学自然科学基金资助项目;江苏省高校“青蓝工程”资助项目

Application of improved associative classification algorithm in cross marketing

Wang Dan-Dan,Hui Xu   

  • Received:2010-04-12 Revised:2010-06-23 Online:2010-09-21 Published:2010-10-01
  • Contact: Wang Dan-Dan

摘要: 提出一种基于频繁闭项集和不精确推理机制的关联分类算法CHC用于分析企业交叉营销过程,指导商业决策。改进了基于H-Struct动态链接结构的频繁闭项集挖掘算法H-C,将类别属性插入H-Struct头表以减小搜索空间,设定局部相对最小支持度阈值和全局最大支持度阈值过滤无用项集,通过最大挖掘长度阈值提高规则的可用性。扩充了EMYCIN系统中的不精确推理算法,使之可以同时处理后件为负项的关联规则。算法克服了传统分类算法只能得到类别标号的不足,通过求得的类别从属可信度,方便企业对多项营销方案做综合评价。与传统关联分类算法的对比实验证明,改进之后的分类算法在运行速度和分类精度上是高效的。

关键词: 交叉营销, 分类, 关联规则, 频繁闭项集

Abstract: In order to guide commercial decisions for cross marketing, a new classification algorithm named CHC based on frequent closed itemsets and imprecise reasoning was proposed. The H-C algorithm for mining frequent closed itemsets based on hyperlinked data structure, H-Struct, was improved. The header table of H-Struct was adjusted by inserting the class label to prune the search space; the local relative support and maximum support were used to exclude meaningless patterns; the maximum length of patterns mined was applied to improve the usability of rules. The reasoning algorithm of EMYCIN was extended to handle the rules whose right is negative. The algorithm improved above traditional classification algorithm's limitations in deriving only class label. Furthermore, this algorithm obtained a value referring to the confidence of the classification result to facilitate and simplify the process of evaluating multiple cross marketing plans. The experimental results show that the enhanced algorithm is efficient in run time and classification precision.

Key words: cross marketing, classification, association rule, frequent closed itemsets

中图分类号: