Skip to main navigation Skip to search Skip to main content

An online cellular probabilistic self-organizing map for static and dynamic data sets

  • Tommy W.S. Chow
  • , Sitao Wu

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

Abstract

In this paper, a new online cellular probabilistic self-organizing map (CPSOM) is presented. The proposed online CPSOM is derived from the batch mode soft topological vector quantization (STVQ). It requires less storage than the STVQ such that it is able to deal with much larger data sets. It converges faster than the STVQ with the same effect when the map size is relatively small, and forms more ordered topology than the STVQ when the map size is relatively large. Most of all, by tuning a parameter in the CPSOM as a forgetting factor, the CPSOM can be used not only in static data sets, but also in dynamic data sets, where the input data come in endlessly and dynamically. The online CPSOM provides more information about the assignment probability for each neuron, which proved to be very useful for unsupervised clustering of the CPSOM.
Original languageEnglish
Pages (from-to)732-747
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume51
Issue number4
DOIs
Publication statusPublished - Apr 2004

Research Keywords

  • Expectation-maximization (EM) algorithm
  • Online cellular probabilistic self-organizing map (CPSOM)
  • Soft topological vector quantization (STVQ)
  • SOM

Fingerprint

Dive into the research topics of 'An online cellular probabilistic self-organizing map for static and dynamic data sets'. Together they form a unique fingerprint.

Cite this