Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (14): 155-157.DOI: 10.3778/j.issn.1002-8331.2009.14.047

• 数据库、信号与信息处理 • Previous Articles     Next Articles

Mining association rules in graph with character weights

HAN Deng-ke1,QU Wen-bin1,2,LI Wen-bin1,ZHAO Yang1   

  1. 1.Modern Education & Technology Center Institute,Shijiazhuang University of Economics,Shijiazhuang 050031,China
    2.School of Computer,China University of Geology,Beijing 100083,China
  • Received:2008-03-19 Revised:2008-06-04 Online:2009-05-11 Published:2009-05-11
  • Contact: HAN Deng-ke

在字符权图中挖掘关联规则

韩登科1,曲文斌1,2,李文斌1,赵 洋1   

  1. 1.石家庄经济学院 现代教育技术中心,石家庄 050031
    2.中国地质大学 计算机系,北京 100083
  • 通讯作者: 韩登科

Abstract: In order to mine association rules efficiently,and find the transaction items including Frequent Item Sets(FIS) when mining FIS,a new algorithm based on graph with character weights is given.Firstly,this paper proposes the graph with character weights,finds and approves some properties of such a kind of graph.Then,a novel method that mines FIS and the transaction items in which FIS appears is designed.This algorithm is validated by analyzing its time and space complexity.

摘要: 为了提高关联规则挖掘效率,在挖掘频繁项目集的同时,挖掘出包含频繁项目集的事务集,提出了基于字符权图的关联规则挖掘算法。首先,提出了字符权图的概念,发现和证明了它的一些性质。基于此,提出了挖掘频繁项目集及包含频繁项目集的事务集的算法。时间和空间复杂性的分析表明,该算法是合理和高效的。