adplus-dvertising
frame-decoration

Question

In feature maps, when weights are updated for winning unit and its neighbour, which type learning it is known as?

a.

karnaugt learning

b.

boltzman learning

c.

kohonen’s learning

d.

none of the mentioned

Posted under Neural Networks

Answer: (c).kohonen’s learning

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In feature maps, when weights are updated for winning unit and its neighbour, which type learning it is known as?

Similar Questions

Discover Related MCQs

Q. How are weights updated in feature maps?

Q. What is the objective of feature maps?

Q. How is feature mapping network distinct from competitive learning network?

Q. In pattern clustering, does physical location of a unit relative to other unit has any significance?

Q. What kind of learning is involved in pattern clustering task?

Q. In competitive learning, node with highest activation is the winner, is it true?

Q. Generally how many kinds of pattern storage network exist?

Q. What kind of feedbacks are given in competitive layer?

Q. What is the other name of feedback layer in competitive neural networks?

Q. What is ojas rule?

Q. By normalizing the weight at every stage can we prevent divergence?

Q. How can divergence be prevented?

Q. What is the nature of weights in plain hebbian learning?

Q. The weight change in plain hebbian learning is?

Q. An instar can respond to a set of input vectors even if its not trained to capture the behaviour of the set?

Q. The update in weight vector in basic competitive learning can be represented by?

Q. How is weight vector adjusted in basic competitive learning?

Q. What is an instar?

Q. If a competitive network can perform feature mapping then what is that network can be called?

Q. What conditions are must for competitive network to perform feature mapping?