现代电子技术2016，Vol.39Issue(17)：116-119,123,5.DOI:10.16652/j.issn.1004-373x.2016.17.029
基于粗糙集的海量数据挖掘算法研究
Research on massive data mining algorithm based on rough set
摘要
Abstract
Since traditional data mining algorithms have the limitation of data magnitude,and on the basis of rough set theory,the class distribution list structure is used to improve the traditional data discretization algorithm based on attribute im⁃portance,attribute reduction algorithm and heuristic⁃based value reduction algorithm. A two⁃step discrete algorithm based on dy⁃namic clustering is discussed. When the algorithm is suited for the big data processing,the parallel computing method is used to improve the execution efficiency of the algorithm. The test results of this algorithm show that the improved algorithm can process the massive data effectively,and the parallel computing can solve the efficiency problem caused by massive data processing.关键词
数据挖掘/粗糙集/大数据处理/并行计算Key words
data mining/rough set/big data processing/parallel computing分类
信息技术与安全科学引用本文复制引用
张贵红,李中华..基于粗糙集的海量数据挖掘算法研究[J].现代电子技术,2016,39(17):116-119,123,5.基金项目
2015年四川省教育厅项目基于主题爬虫技术的网络舆情监督及热点发现研究（15ZB0258）；2015年四川省教育厅旅游研究中心项目数据挖掘算法在智慧服务中的应用 （）
