Abstract
A center choice method based on sub-graph division is presented. After constructing the similarity matrix, the disconnected graphs can be established taking the text node as the vertex of the graph and then it will be analyzed. The number of the clustering center and the clustering center can be confirmed automatically on the error allowable range by this method. The noise data can be eliminated effectively in the process of finding clustering center. The experiment results of the two documents show that this method is effective. Compared with the tradition methods, F-Measure is increased by 8%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhao, Y., Karypis, G.: Criterion Functions for Document Clustering Experiments and Analysis. J. Department of Comp. Sci & Eng University of Minnesota, 01–40 (2001)
Khan, S.S., Ahmad, A.: Cluster center initialization algorithm for K-means clustering. J. Pattern Recognition Letters 25(11), 1293–1302 (2004)
Casillas, A., González de Lena, M.T., MartÃnez, R.: Document clustering into an unknown number of clusters using a Genetic Algorithm. In: A. International Conference on Text Speech and Dialogue TSD, 43–49 (2003)
Likas, A., Vlassis, N., Verbeek, J.J.: The global k-means algorithm. Pattern Recognition. J 23, 451–461 (2003)
Liu, Y., Liu, X., Liu, B.: An adapted algorithm of choosing initial values for k-means document clustering. J. High Technology Letters 16(1), 11–15 (2006)
Zhao, W., Wang, Y., Zhang, X., Li, J.: Variant of K-means algorithm for document clustering: optimization initial centers. J. Computer Applications 25(9), 2037–2040 (2005)
Liu, Y., Wang, X., Xu, Z., Guan, Y.: A Survey of Document Clustering. J. Journal of Chinese Information Processing 20(3), 55–62 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suo, H., Nie, K., Sun, X., Wang, Y. (2008). One Optimized Choosing Method of K-Means Document Clustering Center. In: Li, H., Liu, T., Ma, WY., Sakai, T., Wong, KF., Zhou, G. (eds) Information Retrieval Technology. AIRS 2008. Lecture Notes in Computer Science, vol 4993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68636-1_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-68636-1_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68633-0
Online ISBN: 978-3-540-68636-1
eBook Packages: Computer ScienceComputer Science (R0)