Scribd Logo
Upload

Welcome to Scribd!

  • Kohonen Self-Organizing Feature Maps - Tutorialspoint

    Uploaded by

    prabhuraaj101
    93 views3 pages
    Kohonen self-organizing feature maps (SOM) are a type of neural network that can reduce the dimensions of input data while preserving the topological properties of the input space. SOMs use a neighborhood function to map multi-dimensional input onto a low-dimensional grid in a way that preserves relationships. The algorithm initializes weights and learning rates, then iterates through input vectors to find the best matching unit and update its weights and those of surrounding units until weights stabilize.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Kohonen self-organizing feature maps (SOM) are a type of neural network that can reduce the dimensions of input data while preserving the topological properties of the input space. SOMs use a neighborhood function to map multi-dimensional input onto a low-dimensional grid in a way that preserves relationships. The algorithm initializes weights and learning rates, then iterates through input vectors to find the best matching unit and update its weights and those of surrounding units until weights stabilize.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    93 views3 pages

    Kohonen Self-Organizing Feature Maps - Tutorialspoint

    Uploaded by

    prabhuraaj101
    Kohonen self-organizing feature maps (SOM) are a type of neural network that can reduce the dimensions of input data while preserving the topological properties of the input space. SOMs use a neighborhood function to map multi-dimensional input onto a low-dimensional grid in a way that preserves relationships. The algorithm initializes weights and learning rates, then iterates through input vectors to find the best matching unit and update its weights and those of surrounding units until weights stabilize.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    5/17/2020 Kohonen Self-Organizing Feature Maps - Tutorialspoint

    Kohonen Self-Organizing Feature Maps

    Suppose we have some pattern of arbitrary dimensions, however, we need them in one dimension or
    two dimensions. Then the process of feature mapping would be very useful to convert the wide pattern
    space into a typical feature space. Now, the question arises why do we require self-organizing feature
    map? The reason is, along with the capability to convert the arbitrary dimensions into 1-D or 2-D, it
    must also have the ability to preserve the neighbor topology.

    Neighbor Topologies in Kohonen SOM


    There can be various topologies, however the following two topologies are used the most −

    Rectangular Grid Topology

    This topology has 24 nodes in the distance-2 grid, 16 nodes in the distance-1 grid, and 8 nodes in the
    distance-0 grid, which means the difference between each rectangular grid is 8 nodes. The winning
    unit is indicated by #.

    Hexagonal Grid Topology

    This topology has 18 nodes in the distance-2 grid, 12 nodes in the distance-1 grid, and 6 nodes in the
    distance-0 grid, which means the difference between each rectangular grid is 6 nodes. The winning
    unit is indicated by #.

    https://www.tutorialspoint.com/artificial_neural_network/artificial_neural_network_kohonen_selforganizing_feature_maps.htm 1/3
    5/17/2020 Kohonen Self-Organizing Feature Maps - Tutorialspoint

    Architecture

    The architecture of KSOM is similar to that of the competitive network. With the help of neighborhood
    schemes, discussed earlier, the training can take place over the extended region of the network.

    Algorithm for training

    Step 1 − Initialize the weights, the learning rate α and the neighborhood topological scheme.

    Step 2 − Continue step 3-9, when the stopping condition is not true.

    Step 3 − Continue step 4-6 for every input vector x.


    Step 4 − Calculate Square of Euclidean Distance for j = 1 to m

    n
    n m
    m

    2
    2
    D
    D((j
    j)) =
    = ∑
    ∑∑∑(
    (xxii −
    − w
    wiijj )
    )

    i
    i==1
    1 j
    j==1
    1

    https://www.tutorialspoint.com/artificial_neural_network/artificial_neural_network_kohonen_selforganizing_feature_maps.htm 2/3
    5/17/2020 Kohonen Self-Organizing Feature Maps - Tutorialspoint

    Step 5 − Obtain the winning unit J where D j


    j is minimum.

    Step 6 − Calculate the new weight of the winning unit by the following relation −

    w
    wiijj (
    (nne
    eww)
    ) =
    = w
    wiijj (
    (oolld
    d)) +
    + α
    α[[x
    xii −
    − w
    wiijj (
    (oolld
    d))]]

    Step 7 − Update the learning rate α by the following relation −

    α
    α((t
    t +
    + 1
    1)) =
    = 0.5
    0.5ααt
    t

    Step 8 − Reduce the radius of topological scheme.

    Step 9 − Check for the stopping condition for the network.

    https://www.tutorialspoint.com/artificial_neural_network/artificial_neural_network_kohonen_selforganizing_feature_maps.htm 3/3

    You might also like