A Conscientious Rival Penalized Competitive Learning Text Clustering Algorithm

  • Mao-ting Gao
  • Zheng-ou Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3971)


Text features are usually expressed as a huge dimensional vector in text mining, LSA can reduce dimensionality of text features effectively, and emerges the semantic relations between texts and terms. This paper presents a Conscientious Rival Penalized Competitive Learning (CRPCL) text clustering algorithm, which uses LSA to reduce the dimensionality and improves RPCL to set a conscientious threshold to restrict a winner that won too many times and to make every neural unit win the competition at near ideal probability. The experiments demonstrate good performance of this method.


Weight Vector Text Feature Radial Basis Function Neural Network Latent Semantic Analysis Ideal Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Steinbach, M., Karypis, G., Kumar, V.: A Comparison of Document Clustering Techniques. In: KDD-2000 Workshop on Text Mining, Boston MA USA, pp. 109–110 (2000)Google Scholar
  2. 2.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, USA (2001)Google Scholar
  3. 3.
    Xu, L., Krzyzak, A., Oja, E.: Rival Penalized Competitive Learning for Clustering Analysis, RBF Net, and Curve Detection. IEEE Transactions on Neural Networks 4(4), 636–649 (1993)CrossRefGoogle Scholar
  4. 4.
    Xu, L., Krzyzak, A., Oja, E.: Unsupervised and Supervised Classification by Rival Penalized Competitive Learning. In: Proc. 11th International Conference on Pattern Recognition, The Hague The Netherlands, pp. 492–496 (1992)Google Scholar
  5. 5.
    Dumais, S., Furnas, G., Landauer, T., Deerwester, S., Harshman, R.: Using Latent Semantic Analysis to Improve Access to Textual Information. In: Proceedings of Conference on Human Factors in Computing Systems CHI 1988, Washington DC USA, pp. 281–285 (1988)Google Scholar
  6. 6.
    Wang, Z., Zhu, T.: An Efficient Learning Algorithm for Improving Generalization Performance of Radial Basis Function Neural Networks. Neural Networks 13, 545–553 (2000)CrossRefGoogle Scholar
  7. 7.
    King, I., Lau, T.: Non-Hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval. In: Proc. of the First International Workshop on Machine Learning and Data Mining in Pattern Recognition, Leipzig Germany, pp. 116–130 (1999)Google Scholar
  8. 8.
    Theodoris, S., Koutroumbas, K.: Pattern Recognition, 2nd edn. Academic Press, USA (2003)Google Scholar
  9. 9.
    Liu, S., Dong, M., Zhang, H., et al.: An Approach of Multi-hierarchy Text Classification Based on Vector Space Model. Journal of Chinese Information Processing 3(16), 8–14 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mao-ting Gao
    • 1
    • 2
  • Zheng-ou Wang
    • 1
  1. 1.Institute of Systems EngineeringTianjin UniversityTianjinChina
  2. 2.Computer Science DepartmentShanghai Maritime UniversityShanghaiChina

Personalised recommendations