Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2007, Vol. 33 ›› Issue (04): 34-36. doi: 10.3969/j.issn.1000-3428.2007.04.012

• Software Technology and Database • Previous Articles     Next Articles

Parallel Mining Association Rules Without Generating Candidate

CHEN Yiying1,2, WU Qiang1, LI Wenbin2,3   

  1. (1. School of Resource and Safety Engineering ,China University of Mining & Technology(Beijing), Beijing 100083;
    2. School of Information Engineering, Shijiazhuang University of Economics, Shijiazhuang 050031;
    3. School of Computer Science, Beijing University of Technology, Beijing 100022)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-02-20 Published:2007-02-20

不生成候选项目集的并行挖掘关联规则

陈嶷瑛1,2,武 强1,李文斌2.3   

  1. (1. 中国矿业大学(北京)资源与安全工程学院,北京 100083;2. 石家庄经济学院信息工程学院,石家庄 050031;
    3. 北京工业大学计算机学院,北京 100022)

Abstract: This paper puts forward a parallel algorithm named Ptree-DM to mine association rules from distributed transaction databases without generating candidate item sets. The remarkable characteristic of Ptree-DM is that it needs a few synchronization times and generates a little network flux. It provides an example to show how Ptree-DM works, and discusses the efficiency of Ptree-DM.

Key words: Parallel algorithm, Association rules, Candidate item set

摘要: 为了减少并行挖掘关联规则过程中产生的网络流量及同步次数,提高挖掘效率,在Tree-DM算法的基础上,提出了不生成候选项目集的并行关联规则挖掘算法Ptree-DM。给出了Ptree-DM算法的执行示例,并对该算法的效率进行了分析和讨论。

关键词: 并行算法, 关联规则, 候选项目集