Question
Consider a Kohonen self-organizing net (given below) with two cluster units and five input units. The weight vectors for the cluster units are given by
w1 = { 3.0,5.0,7.0,9.0,0.1 }
w2 = { 0.1,9.0,7.0,5.0,3.0 }
Use the square of the Euclidean distance to find the winning cluster unit for the input pattern (x)
x = [ 0.0 5.0 0.1 5.0 0.0 ]
Using learning rate of 0.25, find the new weights for the winning unit.
Answer :
Word Count : 459
To solve the problem, we'll follow these steps: 1. Calculate the squared Euclidean distance between the input vector \( \mathbf{x} \) and each cluster weight vector \( \mathbf{w}_1 \) and \( \mathbf{w}_2 \). The squared Euclidean distance between two vectors \( \mathbf{x} = [x_1, x_2, ..., x_n] \) and \( \mathbf{w} = [w_1, w_2, ..., w_n] \) is given by: \[ D^2(\mathbf{x}, \mathbf{w}) = \sum_{i=1}^{n} (x_i - w_i)^2 \] 2. Find the winning cluster unit by determining which weight vector has the smallest squared Euclidean distance to the input vector \( \mathbf{x} \). 3. Update the weights for the winning unit using the learning rule: \[ \mathbf{w}_{\text{new}} = \mathbf{w}_{\text{old}} + \eta (\mathbf{x} - \mathbf{w}_{\text{old}}) ________ ________ ______ ____ ________ _________ _____ _____ ______.
_______ __________ ________ _______ ____ _______ ___ _____.
___ ____ ____ ___ __________.
__________ ____ _________ ______ ______ ___ ____.
_____ ______ __________ ____ ______ __________ _________ ______.
__________ _____ _______ ______ ___ ________ ______ _____ _____ ________.
__________ ____ ______ ____ _________ _____ __________ _____.
_____ ____ ______ ______ _______ __________ _____ _______ ____.
________ ____ ___ ____ _______ ______ __________.
____ ________ ________ _______ _______ _________ __________ _________ ___ _____.
_____ _______ _________ _________ ___ ______ ______ ___ _____.
___ ______ _____ _____ ____ _____ ______ ___ __________.
__________ ___ ___ ____ ________ _________ _____ ___ ______ _________ _______.
_____ ___ ___ _________ _________ _____.
________ ____ _________ ___ ______ ______ _____ ____ ____.
________ _________ _____ ___ ______ ____ ____ _____.
___ _________ ____ ________ ____ ____ ___ ______ ______ __________ ___.
___ _________ _________ ____ ___ _________ _________ _____ ____ _____ ____.
___ _______ _________ ________ _________ _____.
_______ _____ ________ ________ __________ _____ ________ _____.
__________ ____ ________ _________ _______ __________ _______ _______ _______.
______ ________ ________ ___ _____ ____ _____.
_____ __________ ____ ____ __________ ____ __________ ____ _______.
_____ _____ _______ __________ __________ ____ _____ __________ ______ _____ _________.
______ _____ ____ ____ __________ _____.
___ ________ _____ ________ ______ __________ ____ ____.
___ ______ _________ ____ _____ ____ ________.
_____ ____ _____ ________ ______.
___ ____ _______ _______ _________ _____ _________ ______ _______ ________ _________ _______.
______ ____ _____ ___ ____ __________ _________ _______.
_______ _______ _________ ___ _____ _________ _______ _____ ____.
__________ ________ ___ _______ __________.
________ _____ _____ ________ ____ _____ _________.
_________ _____ _________ _________ __________ _____.
_________ __________ ________ __________ _________ ______ ________ _______.
_______ ________ _____ _______ ______ __________ _____ _______ _______ _______ ______ ________.
_____ __________ ____ _____ ___ ______.
___ ______ ___ _______ _________ ____.
_____ _____ ______ __________ _________ __________ _________ ______ ______ _____ _______ _________.
_____ ______ ____ ____ _____.
_____ __________ ________ ________ ______ ______ ______ ______ ______ ________ ______ ________.
________ _____ ______ ________ _________ _________.
Get Full Answer on WhatsApp
To solve the problem, we'll follow these steps: 1. Calculate the squared Euclidean distance between the input vector \( \mathbf{x} \) and each cluster weight vector \( \mathbf{w}_1 \) and \( \mathbf{w}_2 \). The squared Euclidean distance between two vectors \( \mathbf{x} = [x_1, x_2, ..., x_n] \) and \( \mathbf{w} = [w_1, w_2, ..., w_n] \) is given by: \[ D^2(\mathbf{x}, \mathbf{w}) = \sum_{i=1}^{n} (x_i - w_i)^2 \] 2. Find the winning cluster unit by determining which weight vector has the smallest squared Euclidean distance to the input vector \( \mathbf{x} \). 3. Update the weights for the winning unit using the learning rule: \[ \mathbf{w}_{\text{new}} = \mathbf{w}_{\text{old}} + \eta (\mathbf{x} - \mathbf{w}_{\text{old}}) ________ ________ ______ ____ ________ _________ _____ _____ ______.
_______ __________ ________ _______ ____ _______ ___ _____.
___ ____ ____ ___ __________.
__________ ____ _________ ______ ______ ___ ____.
_____ ______ __________ ____ ______ __________ _________ ______.
__________ _____ _______ ______ ___ ________ ______ _____ _____ ________.
__________ ____ ______ ____ _________ _____ __________ _____.
_____ ____ ______ ______ _______ __________ _____ _______ ____.
________ ____ ___ ____ _______ ______ __________.
____ ________ ________ _______ _______ _________ __________ _________ ___ _____.
_____ _______ _________ _________ ___ ______ ______ ___ _____.
___ ______ _____ _____ ____ _____ ______ ___ __________.
__________ ___ ___ ____ ________ _________ _____ ___ ______ _________ _______.
_____ ___ ___ _________ _________ _____.
________ ____ _________ ___ ______ ______ _____ ____ ____.
________ _________ _____ ___ ______ ____ ____ _____.
___ _________ ____ ________ ____ ____ ___ ______ ______ __________ ___.
___ _________ _________ ____ ___ _________ _________ _____ ____ _____ ____.
___ _______ _________ ________ _________ _____.
_______ _____ ________ ________ __________ _____ ________ _____.
__________ ____ ________ _________ _______ __________ _______ _______ _______.
______ ________ ________ ___ _____ ____ _____.
_____ __________ ____ ____ __________ ____ __________ ____ _______.
_____ _____ _______ __________ __________ ____ _____ __________ ______ _____ _________.
______ _____ ____ ____ __________ _____.
___ ________ _____ ________ ______ __________ ____ ____.
___ ______ _________ ____ _____ ____ ________.
_____ ____ _____ ________ ______.
___ ____ _______ _______ _________ _____ _________ ______ _______ ________ _________ _______.
______ ____ _____ ___ ____ __________ _________ _______.
_______ _______ _________ ___ _____ _________ _______ _____ ____.
__________ ________ ___ _______ __________.
________ _____ _____ ________ ____ _____ _________.
_________ _____ _________ _________ __________ _____.
_________ __________ ________ __________ _________ ______ ________ _______.
_______ ________ _____ _______ ______ __________ _____ _______ _______ _______ ______ ________.
_____ __________ ____ _____ ___ ______.
___ ______ ___ _______ _________ ____.
_____ _____ ______ __________ _________ __________ _________ ______ ______ _____ _______ _________.
_____ ______ ____ ____ _____.
_____ __________ ________ ________ ______ ______ ______ ______ ______ ________ ______ ________.
________ _____ ______ ________ _________ _________.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★