By Topic

Research and application of MapReduce-based MST text clustering algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kehua Yang ; Hunan Univ., Changsha, China ; Guoxiong He ; Guohui He

In view of today's unprecedented diverse and discrete mass text data processing, this paper presents a distributed MST (minimum spanning tree) algorithm based on MapReduce programming model. And with this MST algorithm, a distributed MST text clustering algorithm is designed and implemented. In this paper, this clustering algorithm is analyzed in three aspects: text feature vector extraction, graph construction and MST construction. And some data was used to experimentally compare this algorithm with ordinary MST clustering algorithm and MapReduce-based K-means clustering algorithm.

Published in:

Information Science and Technology (ICIST), 2012 International Conference on

Date of Conference:

23-25 March 2012