By Topic

Algorithm of documents clustering based on minimum spanning tree

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

4 Author(s)
Xiao-Shen Zheng ; Dept. of Comput. Sci. & Technol., Tianjin Univ., China ; Pi-Lian He ; Mei Tian ; Fu-Yong Yuan

This paper puts forward a method of document clustering based on minimum spanning tree (MST) in vector space model (VSM). This algorithm adopts classical VSM and combines with the method of MST in graph theory. The quality and performance of document clustering are higher than other traditional clustering methods.

Published in:

Machine Learning and Cybernetics, 2003 International Conference on  (Volume:1 )

Date of Conference:

2-5 Nov. 2003