Parallel Feature Selection Using Positive Approximation Based on MapReduce
Over the last few decades,feature selection has been a hot research area in pattern recognition and machine learning,and many famous feature selection algorithms have been proposed.Among them,feature selection using positive approximation(FSPA)is an accelerator for traditional rough set based feature selection algorithms,which can significantly reduce the running time.However,FSPA still cannot handle large scale and high dimension dataset due to the memory constraints.In this paper,we propose a parallel implementation of FSPA using MapReduce framework,which is a programming model for processing large scale datasets.The experimental results demonstrate that the proposed algorithm can process large scale and high dimension dataset efficiently on commodity computers.
Qing He Xiaohu Cheng Fuzhen Zhuang Zhongzhi Shi
The Key Laboratory of Intelligent Information Processing,Institute of Computing Technology,Chinese A The Key Laboratory of Intelligent Information Processing,Institute of Computing Technology,Chinese A
国际会议
厦门
英文
405-410
2014-08-19(万方平台首次上网日期,不代表论文的发表时间)