«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

25

期数:

2015年01期

页码:

137-142

栏目:

智能、算法、系统工程

出版日期:

2015-01-10

文章信息/Info

Title:

 Knowledge Reduction Algorithms of Incomplete Information System in Massive Datasets

文章编号:

1673-629X（2015)01-0137-06

作者:

 王添; 姜麟; 米允龙

 昆明理工大学 理学院

Author(s):

 WANG Tian; JIANG Lin; MI Yun-long

关键词:

 ; 海量数据; 云计算; 粗糙集; 不完备信息系统; 约简; MapReduce

Keywords:

 ; massive data; cloud computing; rough set; incomplete information system; reduction MapReduce

分类号:

TP18

文献标志码:

A

摘要:

 面向大规模的数据进行知识约简是近年来粗糙集理论研究的热点。传统不完备信息系统的知识约简是假设在初始时将所有需要处理的数据一次性地装入内存中，这明显不适合处理海量数据，更不适合处理含有缺失信息的海量数据。为此，深入剖析了带有缺失信息的数据特征，把缺失属性的值用该属性所有可能的取值表示，并结合知识约简算法中的可并行性，从属性(集)的可辨识性和不可辨识性出发，并在MapReduce框架下设计了可用来处理不完备信息系统的知识约简算法。实验结果表明，该算法是有效可行的，能够对不完备信息系统中的海量数据进行知识约简。

Abstract:

 Knowledge reduction for massive datasets has attracted many research interests in rough set theory. Traditional knowledge re-duction algorithms of incomplete information system assume that all the datasets can be loaded into the main memory,which are obvious-ly infeasible for large-scale datasets,especially for massive datasets with missing information. To this end,deeply analyze the characteris-tics of massive datasets with missing information,and allow the missing attribute value to take all possible values. Then,by combining the parallel computations used in classical knowledge reduction algorithms with the discernibility ( indiscernibility) of the attributes,a knowl-edge reduction algorithm is designed for incomplete information systems under MapReduce framework. The experimental results demon-strate that this algorithm is effective and feasible,which can efficiently process massive datasets for knowledge reduction in incomplete in-formation systems.

常用功能

更新日期/Last Update: 2015-04-17