现代电子技术2016，Vol.39Issue(7)：115-119,5.DOI:10.16652/j.issn.1004-373x.2016.07.028
基于粗糙集的海量数据挖掘算法研究
Research on big data mining algorithm based on rough set
摘要
Abstract
Since the traditional data mining algorithm has the limitation in the aspect of data magnitude,on the basis of rough set theory,the class distribution list structure is used to improve the traditional data discretization algorithm based on attri⁃bute importance,attribute reduction algorithm and heuristic⁃based value reduction algorithm. The two⁃step discrete algorithm based on dynamic clustering is discussed. When the algorithm adapts to the big data processing,the parallel computing method is used to improve the execution efficiency of the algorithm. The test results of the algorithm show that the improved algorithm can effectively process the big data size. The parallel computing can solve the efficiency problem causing by big data size pro⁃cessing.关键词
数据挖掘/粗糙集/大数据处理/并行计算Key words
data mining/rough set/big data processing/parallel computing分类
信息技术与安全科学引用本文复制引用
牛咏梅..基于粗糙集的海量数据挖掘算法研究[J].现代电子技术,2016,39(7):115-119,5.
