unsupervised learning - Unsupervised Learning Networks Dr K Ganesan Director TIFAC-CORE in Automotive Infotronics Senior Professor in School of

unsupervised learning - Unsupervised Learning Networks Dr K...

This preview shows page 1 - 7 out of 153 pages.

Unsupervised Learning Networks Dr. K. Ganesan Director – TIFAC-CORE in Automotive Infotronics & Senior Professor in School of Information Technology and Engineering VIT University, Vellore – 632 014 [email protected]
Image of page 1
Introduction The second major learning paradigm is unsupervised learning. Here there exists no feedback from the system (environment) to indicate the desired outputs of a network. The network by itself should discover any relationships of interest, such as features, patterns, contours, correlations or categories, classification in the input data and thereby translate the discovered relationships into outputs. Such networks are also called self-organizing networks.
Image of page 2
Here the learning is based only upon the input data and is independent of the desired output data and also no error is calculated to train a network. This type of learning is called unsupervised learning and the input data are called unlabeled data . Here the net may respond to several output categories on training . But only one of the several neurons has to respond. The mechanism by which only one unit is chosen to respond is called competition . The frequently used competition among group of neurons is called Winner-Takes-all . Here only one neuron in the competing group will have a non-zero output signal when the competition is completed .
Image of page 3
Clustering net In a clustering net, there are as many input units as input vector components. Since each output unit represents a cluster, the number of output units will limit the number of clusters that can be formed. The weight vector for an output unit in a clustering net is called exemplar or code- book vector for the input patterns, which the net has placed on that cluster.
Image of page 4
Methods for determining the winner There are 2 methods used for the determination of the winner unit. Method 1 This method uses the squared Euclidean distance between the input vector and the weight vector, and chooses the unit whose weight vector has the smallest Euclidean distance from the input vector . Method 2 This method uses the dot product of the input vector and the weight vector . The dot product of an input vector with a given weight vector is the net input to the corresponding cluster unit. The largest dot product corresponds to the smallest angle between the input and weight vectors if they are both of unit length.
Image of page 5
Example A supervised learning can judge how similar a new input pattern is to typical patterns already seen, and the network gradually learns what similarity is. The network may construct a set of axes along which to measure similarity to previous patterns, i.e i t performs principal component analysis, clustering, adaptive vector quantization and feature mapping.
Image of page 6
Image of page 7

You've reached the end of your free preview.

Want to read all 153 pages?

  • Winter '16
  • ganeshan
  • Wj, input vector, Self-organizing map, Kohonen, Maxnet

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture