北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2002, Vol. 25 ›› Issue (4): 56-60.

• 学术论文 • 上一篇    下一篇

基于数量的关联规则挖掘

段云峰1, 宋俊德1, 李剑威2, 舒华英2   

  1. 1.北京邮电大学电子工程学院, 北京 100876;
    2.北京邮电大学经济管理学院, 北京 100876
  • 收稿日期:2001-07-10 出版日期:2002-11-10
  • 作者简介: 段云峰(1970—),男,博士研究生。
  • 基金资助:
     

The Association Rule Mining Based on Item Numbers

DUAN Yun-feng1, SONG Jun-de1, LI Jian-wei2, SHU Hua-ying2   

  1. 1.Electronic Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2.Economic Management School, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2001-07-10 Online:2002-11-10
  • Supported by:
     

摘要: 通过对现有问题的分析,提出了新的基于数量的关联规则挖掘的概念,分忻了有关的数量-支持度,并提出了一种改进算法,然后通过一个例子与传统的Apriori算法进行了对比分析。

关键词: 数据挖掘, 数量-关联规则, 平均数量值, 数量支持度

Abstract: With an analysis of the problems in association rulemining, a new concept with number of items is proposed. Based on the number-support, the Apriori algorithm is improved, and the result is compared with the newalgorithm.

Key words: data mining, association rule mining, support, confidence

中图分类号: