O(log2M) self-organizing map algorithm without learning of neighborhood vectors

Hiroki Kusumoto, Yoshiyasu Takefuji

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


In this letter, a new self-organizing map (SOM) algorithm with computational cost O(log2M) is proposed where M2 is the size of a feature map. The first SOM algorithm with O(M2) was originally proposed by Kohonen. The proposed algorithm is composed of the subdividing method and the binary search method. The proposed algorithm does not need the neighborhood functions so that it eliminates the computational cost in learning of neighborhood vectors and the labor of adjusting the parameters of neighborhood functions. The effectiveness of the proposed algorithm was examined by an analysis of codon frequencies of Escherichia coli (E. coli) K12 genes. These drastic computational reduction and accessible application that requires no adjusting of the neighborhood function will be able to contribute to many scientific areas.

Original languageEnglish
Pages (from-to)1656-1661
Number of pages6
JournalIEEE Transactions on Neural Networks
Issue number6
Publication statusPublished - 2006 Nov
Externally publishedYes


  • Binary search
  • Codon frequency
  • Computational reduction
  • Escherichia coli (E. coli)
  • Neighborhood function
  • Self-organizing map (SOM)
  • Subdividing method

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'O(log2M) self-organizing map algorithm without learning of neighborhood vectors'. Together they form a unique fingerprint.

Cite this