Handwritten Data Clustering Using Agents Competition in Networks

  • Authors:
  • Thiago Silva;Liang Zhao;Thiago H. Cupertino

  • Affiliations:
  • Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP), São Carlos, Brazil 13560-970;Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP), São Carlos, Brazil 13560-970;Department of Computer Sciences, Institute of Mathematics and Computer Science (ICMC), University of São Paulo (USP), São Carlos, Brazil 13560-970

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study a new type of competitive learning scheme realized on large-scale networks. The model consists of several agents walking within the network and competing with each other to occupy as many nodes as possible, while attempting to reject intruder agents. In the end of the process, each agent dominates a community (a strongly connected subnetwork). Here, the model is described by a stochastic dynamical system. In this paper, a mathematical analysis for uncovering the system's properties is presented. In addition, the model is applied to solve handwritten digits and letters clustering problems. An interesting feature is that the model is able to group the same digits or letters even with considerable distortions into the same cluster. Computer simulations reveal that the proposed technique presents high precision of cluster detections, as well as low computational complexity.