A novel distributed machine learning method for classification: parallel covering algorithm

  • Authors:
  • Yanping Zhang;Yuehua Wang;Shu Zhao

  • Affiliations:
  • Computer Science and Technology Institute, Key Laboratory of Intelligent Computing and, Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui Province, P.R. China;Computer Science and Technology Institute, Key Laboratory of Intelligent Computing and, Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui Province, P.R. China;Computer Science and Technology Institute, Key Laboratory of Intelligent Computing and, Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui Province, P.R. China

  • Venue:
  • RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel distributed machine learning method: Parallel Covering Algorithm, which is inspired by the module feature of CA (Covering Algorithm). Classic method of CA is presented, and we analyze its independent part. Then we develop the Parallel CA by utilizing its modularity as well as data-set decomposition. Detailed implementation of the parallel computing process is described. In the experiment, three data sets are used to evaluate the Parallel CA, and the comparison with classic CA is also shown in the paper. Speedup and efficiency are two criterions to evaluate the performance of the algorithm. Both the analysis and the comparison indicate that the Parallel CA is more effective than CA. We also empirically compare the results obtained by Parallel SVM on a large data set, and it shows that our proposed algorithm is effective.