Abstract
Document clustering is necessary for information retrieval, Web data mining, and Web data management. To support very high dimensionality and the sparsity of document feature, the model-based clustering has been proved to be an intuitive choice for document clustering. However, the current model-based algorithms are prone to generating the skewed clusters, which influence the quality of clustering seriously. In this paper, the reasons of skew generating are examined and determined as the inappropriate initial model, and the interaction between the decentralization of estimation samples and the over-generalized cluster model. An effective clustering skew prevention method (ESPClust) is proposed to focus on the last reason. To break this interaction, for each cluster, ESPClust automatically selects a part of documents that most relevant to its corresponding class as the estimation samples to re-estimate the cluster model. Based on the ESPClust, two algorithms with respect to the quality and efficiency are provided for different kinds of applications. Compared with balanced model-based algorithms, the ESPClust method has less restrictions and more applicability. The experiments show that the ESPClust can avoid the clustering skew in a great degree and its Macro-F1 measure outperforms the previous methods’ measure.
Supported by the National Natural Science Foundation of China under Grant No.60173051 and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institution of the Ministry of Education, China
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
Strehl, A., Ghosh, J., Mooney, R.: Impact of Similarity Measures on Web Page Clustering. In: Proc. 17th National Conf. of Artificial Intelligence for Web Search (2000)
Zhong, S.: Probabilistic Model-Based Clustering of Complex Data. PhD thesis, The University of Texas at Austin (2003)
Zhong, S., Ghosh, J.: A Unified Framework for Model-based Clustering. Machine Learning Research (2003)
Kamvar, S., Klein, D., Manning, C.: Interpreting and Extending Classical Agglomerative Clustering Algorithms Using A Model-based Approach. In: Proc. 19th Int. Conf. Machine Learning (2002)
Banfield, J.D., Raftery, A.E.: Model-based Gaussian and non-Gaussian Clustering. Biometrics (1993)
Fraley, C.: Algorithms for Model-based Gaussian Hierarchical Clustering. SIAM Journal on Scientific Computing (1999)
Vaithyanathan, S., Dom, B.: Model-based Hierarchical Clustering. In: Proc. 16th Conf. Uncertainty in Artificial Intelligence (2000)
Ramoni, M., Sebastiani, P., Cohen, P.: Bayesian Clustering by Dynamics. In: Machine Learning (2002)
Cadez, I.V., Ganey, S., Smyth, P.: A General Probabilistic Framework for Clustering In-dividuals and Objects. In: Proc. 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (2000)
Dhillon, I.S., Modha, D.S.: Concept Decompositions for Large Sparse Text Data Using Clustering. In: Machine Learning (2001)
Banerjee, A., Ghosh, J.: Frequency Sensitive Competitive Learning for Clustering on High-Dimensional Hyperspheres. In: Proc. IEEE Int. Joint Conf. Neural Networks (2002)
Meila, M., Heckerman, D.: An Experimental Comparison of Model-Based Clustering Methods. In: Machine Learning (2001)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A review. ACM Computing Surveys (1999)
Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained k-means Clustering. Technical Report MSR-TR-2000-65, Microsoft Research, Redmond, WA (2000)
Banerjee, A., Ghosh, J.: On Scaling Up Balanced Clustering Algorithms. In: Proc. 2nd SIAM Int. Conf. Data Mining (2002)
Zhong, S., Ghosh, J.: Model-based Clustering with Soft Balancing. In: Proc. of ICDM 2003 (2003)
Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing (1998)
McLachlan, G., Peel, D.: Finite Mixture Models. John Wiley & Sons, Chichester (2000)
Shaft, U., Ramakrishnan, R.: When is nearest neighbors indexable? In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 158–172. Springer, Heidelberg (2004)
Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, p. 420. Springer, Heidelberg (2001)
http://kdd.ics.uci.edu/databases/20newsgroups/20newsgroups.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Yu, G., Wang, D., Bao, Y. (2005). ESPClust: An Effective Skew Prevention Method for Model-Based Document Clustering. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2005. Lecture Notes in Computer Science, vol 3406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30586-6_82
Download citation
DOI: https://doi.org/10.1007/978-3-540-30586-6_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24523-0
Online ISBN: 978-3-540-30586-6
eBook Packages: Computer ScienceComputer Science (R0)