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

Hiroki Kusumoto, Yoshiyasu Takefuji

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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
Volume17
Issue number6
DOIs
Publication statusPublished - 2006 Nov

Fingerprint

Self organizing maps
Self-organizing Map
Learning algorithms
Computational Cost
Binary search
Search Methods
Escherichia coli
Escherichia Coli
Costs
Eliminate
Genes
Learning
Personnel
Gene

Keywords

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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this

O(log2M) self-organizing map algorithm without learning of neighborhood vectors. / Kusumoto, Hiroki; Takefuji, Yoshiyasu.

In: IEEE Transactions on Neural Networks, Vol. 17, No. 6, 11.2006, p. 1656-1661.

Research output: Contribution to journalArticle

@article{b29959ba008c4dd1a4de77e98e9efb51,
title = "O(log2M) self-organizing map algorithm without learning of neighborhood vectors",
abstract = "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.",
keywords = "Binary search, Codon frequency, Computational reduction, Escherichia coli (E. coli), Neighborhood function, Self-organizing map (SOM), Subdividing method",
author = "Hiroki Kusumoto and Yoshiyasu Takefuji",
year = "2006",
month = "11",
doi = "10.1109/TNN.2006.882370",
language = "English",
volume = "17",
pages = "1656--1661",
journal = "IEEE Transactions on Neural Networks and Learning Systems",
issn = "2162-237X",
publisher = "IEEE Computational Intelligence Society",
number = "6",

}

TY - JOUR

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

AU - Kusumoto, Hiroki

AU - Takefuji, Yoshiyasu

PY - 2006/11

Y1 - 2006/11

N2 - 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.

AB - 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.

KW - Binary search

KW - Codon frequency

KW - Computational reduction

KW - Escherichia coli (E. coli)

KW - Neighborhood function

KW - Self-organizing map (SOM)

KW - Subdividing method

UR - http://www.scopus.com/inward/record.url?scp=34548611806&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548611806&partnerID=8YFLogxK

U2 - 10.1109/TNN.2006.882370

DO - 10.1109/TNN.2006.882370

M3 - Article

VL - 17

SP - 1656

EP - 1661

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

SN - 2162-237X

IS - 6

ER -