DocumentCode :
402876
Title :
Algorithm of documents clustering based on minimum spanning tree
Author :
Zheng, Xiao-Shen ; He, Pi-Lian ; Tian, Mei ; Yuan, Fu-yong
Author_Institution :
Dept. of Comput. Sci. & Technol., Tianjin Univ., China
Volume :
1
fYear :
2003
fDate :
2-5 Nov. 2003
Firstpage :
199
Abstract :
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.
Keywords :
document handling; information services; pattern clustering; trees (mathematics); documents clustering; graph theory; minimum spanning tree; vector space model; Clustering algorithms; Clustering methods; Computer science; Databases; Electronic mail; Graph theory; Helium; Partitioning algorithms; Space technology; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN :
0-7803-8131-9
Type :
conf
DOI :
10.1109/ICMLC.2003.1264470
Filename :
1264470
Link To Document :
بازگشت