Suppose that we have the following three reference patterns and their targets.
i. Draw the network diagram for a linear associator network that could be trained on these patterns.
ii. Use the Hebb rule to find the weights of the network.
iii. Find and sketch the decision boundary for the network with the Hebb rule weights. Does the boundary separate the patterns? Demonstrate.
iv. Use the pseudo-inverse rule to find the weights of the network. Describe the difference between this boundary and the Hebb rule boundary.