`%0 Conference Proceedings`

`%4 sid.inpe.br/sibgrapi/2011/06.23.17.47`

`%2 sid.inpe.br/sibgrapi/2011/06.23.17.47.44`

`%A Silva, Thiago Christiano,`

`%A Cupertino, Thiago Henrique,`

`%A Zhao, Liang,`

`%@affiliation Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP)`

`%@affiliation Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP)`

`%@affiliation Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP)`

`%T Stochastic Competitive Learning Applied to Handwritten Digit and Letter Clustering`

`%B Conference on Graphics, Patterns and Images, 24 (SIBGRAPI)`

`%D 2011`

`%E Lewiner, Thomas,`

`%E Torres, Ricardo,`

`%S Proceedings`

`%8 Aug. 28 - 31, 2011`

`%J Los Alamitos`

`%I IEEE Computer Society`

`%C Maceió`

`%K stochastic competitive learning, handwritten pattern clustering.`

`%X Competitive learning is an important mechanism for data clustering and pattern recognition. In this paper, we present a rigorous definition of a new type of competitive learning scheme realized on large scale networks. In this model, several particles walk in the network and compete with each other to occupy as many nodes as possible, while attempting to reject intruder particles. As a result, each particle will dominate a cluster of the network. Moreover, we propose an efficient method for determining the right number of clusters by using the information generated by the competition process itself, avoiding the calculation of an external evaluating index. In this work, we apply the model to handwritten data clustering. Computer simulations reveal that the proposed technique obtains satisfactory cluster detection accuracy.`

`%@language en`

`%3 SIBGRAPI2011_ParticleCompetition.pdf`