Back to Search Start Over

A Conscientious Rival Penalized Competitive Learning Text Clustering Algorithm.

A Conscientious Rival Penalized Competitive Learning Text Clustering Algorithm.

Authors :
Wang, Jun
Yi, Zhang
Zurada, Jacek M.
Lu, Bao-Liang
Yin, Hujun
Gao, Mao-ting
Wang, Zheng-ou
Source :
Advances in Neural Networks - ISNN 2006; 2006, p1256-1260, 5p
Publication Year :
2006

Abstract

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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540344391
Database :
Supplemental Index
Journal :
Advances in Neural Networks - ISNN 2006
Publication Type :
Book
Accession number :
32883801
Full Text :
https://doi.org/10.1007/11759966_186