计算机应用与软件2017，Vol.34Issue(12)：53-57,132,6.DOI:10.3969/j.issn.1000-386x.2017.12.010
基于二叉树编码的关联规则动态挖掘算法
A DYNAMIC MINING ALGORITHM OF ASSOCIATION RULES BASED ON BINARY TREE CODING
摘要
Abstract
To solve the problem of mining association rules for the database which has a small quantity of item sets and a large quantity of transactions,this paper proposes a dynamical algorithm based on binary tree coding.We can mine association rules through the following steps.First,setting up a binary tree suiting with item set of a database.Second,defining an array for counting which is corresponding with the item set.Then scanning and counting the transaction records.Finally,analyzing and calculating the association rules.The algorithm takes full advantages of the characteristics of binary tree coding so that it can reduce I/O workload.It is easy to add or delete records at any time.Also it is easy to divide and merge data.The algorithm shows good application prospect.关键词
关联规则/动态挖掘/二叉树编码Key words
Association rules/Dynamic mining/Binary tree coding分类
信息技术与安全科学引用本文复制引用
王峰山,王晓娟..基于二叉树编码的关联规则动态挖掘算法[J].计算机应用与软件,2017,34(12):53-57,132,6.基金项目
全军军事类研究生资助课题(2015JY527). （2015JY527）
