计算机应用研究2017，Vol.34Issue(10)：2924-2928,5.DOI:10.3969/j.issn.1001-3695.2017.10.010
数据流中结构二叉树挖掘算法研究
Study on algorithm for mining structural binary tree in data stream
摘要
Abstract
Aiming at the problem that the traditional algorithms of data stream cannot mine the relationship between the frequent items,and the mining time and space complexity is high,while the accuracy is not high,this paper proposed an algorithm for mining structural binary tree in data stream (AMST).The algorithm used the advantage of binary tree,transformed the data stream into a structured binary tree,and then mined the binary tree with the data stream matrix.The algorithm greatly improved the efficiency of mining because it only scaned the database once in the whole process.In addition,the algorithm also found out frequent subtrees with hierarchical relations.Experiment results show that the algorithm has stable performance and better advantage in time and space complexity,and can mine the data stream rapidly and accurately.关键词
数据流/频繁项集/结构二叉树/数据流矩阵Key words
data stream/frequent items/structural binary tree/data stream matrix分类
信息技术与安全科学引用本文复制引用
唐向红,元宁,易向华,陆见光..数据流中结构二叉树挖掘算法研究[J].计算机应用研究,2017,34(10):2924-2928,5.基金项目
贵州省重大科技专项资助项目(黔科合重大专项字(2013)6019,黔科合重大专项字[2012]6018) （黔科合重大专项字(2013）
贵州省基础研究重大项目(黔科合JZ字(2014)2001) （黔科合JZ字(2014）
