Improved Canopy-Kmeans algorithm based on MapReduce
Year: 2012
Type: article
Abstract: In order to solve the problem that how to void random Canopy selection of Canopy-Kmeans algorithm,this paper introduces an improved algorithm based on the minimum and maximum principle and realizes processing massive data based on MapReduce framework.Meanwhile,the algorithm is carried out in massive Internet news aggregation.The experiments show that the strategy of Canopy selection based on the minimum and maximum principle has higher classification accuracy and noise immunity compared to random strategy.
Author: Dianhui Mao
Institution: Beijing Technology and Business University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2377713473
