| 注册
首页|期刊导航|南京邮电大学学报(自然科学版)|基于相关兴趣度的关联规则挖掘算法研究

基于相关兴趣度的关联规则挖掘算法研究

章永祺 王诚

南京邮电大学学报(自然科学版)2017,Vol.37Issue(5):87-93,7.
南京邮电大学学报(自然科学版)2017,Vol.37Issue(5):87-93,7.DOI:10.14132/j.cnki.1673-5439.2017.05.015

基于相关兴趣度的关联规则挖掘算法研究

Association rule mining algorithm based on related interest measure

章永祺 1王诚1

作者信息

  • 1. 南京邮电大学通信与信息工程学院,江苏南京210003
  • 折叠

摘要

Abstract

Aimed at the demerits of association rule mining technology based on the degree of support and confidence,and based on both association and correlation rule algorithm association & correlation mining (AC_Mining),this paper introduces a related-confidence to measure the correlation among items,and proposes a new mining algorithm,called the I&ItemMine_AC (I&Item:item set and item;AC:association & correlation).Experiments prove that the mining algorithm eliminates suspicious patterns or association rules existed in the traditional association rule mining.Meanwhile,it also improves the demerits of general association rules and the unbalance before and after item sets mine,thus,improving the quality of generated association rules,and its relevant measure is very effective in pruning.

关键词

关联规则/相关兴趣度/相关兴趣度/AC_Mining算法/I&ItemMine_AC算法

Key words

association rules/related interest measure/Related-confidence/AC _ Mining algorithm/I&ItemMine_AC algorithm

分类

信息技术与安全科学

引用本文复制引用

章永祺,王诚..基于相关兴趣度的关联规则挖掘算法研究[J].南京邮电大学学报(自然科学版),2017,37(5):87-93,7.

南京邮电大学学报(自然科学版)

OA北大核心CSTPCD

1673-5439

访问量0
|
下载量0
段落导航相关论文