All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Self Organizing Maps with Delay Actualization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86095466" target="_blank" >RIV/61989100:27240/15:86095466 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/15:86095466

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-319-24369-6_13" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-24369-6_13</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-24369-6_13" target="_blank" >10.1007/978-3-319-24369-6_13</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Self Organizing Maps with Delay Actualization

  • Original language description

    The paper deals with the Self Organizing Maps (SOM). The SOM is a standard tool for clustering and visualization of high-dimensional data. The learning phase of SOM is time-consuming especially for large datasets. There are two main bottleneck in the learning phase of SOM: finding of a winner of competitive learning process and updating of neurons&apos; weights. The paper is focused on the second problem. There are two extremal update strategies. Using the first strategy, all necessary updates are done immediately after processing one input vector. The other extremal choice is used in Batch SOM - updates are processed at the end of whole epoch. In this paper we study update strategies between these two extremal strategies. Learning of the SOM with delay updates are proposed in the paper. Proposed strategies are also experimentally evaluated.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Lecture notes in computer science. Volume 9339

  • ISBN

    978-3-319-24368-9

  • ISSN

    0302-9743

  • e-ISSN

    neuvedeno

  • Number of pages

    13

  • Pages from-to

    154-165

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Varšava

  • Event date

    Sep 24, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000366016000013