In: Computer Science
1. What is the purpose of Rete algorithm? Describe how it works.
2. What is a linearly separable classification problem? Give one example that is not linearly separable.
1. This is one of the algorithms which is used for searching the
pattern. Hence this is a pattern searching algorithm which compares
large collection of facts or patterns with the given large
collection.
This basically matched the patterns against the facts in pattern
matching production system, In this algorithm, there is more space
utilized as there are any numbers of facts which were needed in
order to find the pattern. Facts are asserted and taken into the
memory and each is added at the top of the node and then they are
passed on to the children.
2. If we are given with a classification problem which can divide the given objects into two sets of classes with one plane or single decision plane. A simple problem of XOR is not a linearly separable problem. Thus XOR is one of the examples, which is not linearly separable.
That was a nice
question to answer
Friend, If you have any doubts in understanding do let me know in
the comment section. I will be happy to help you further.
Please like if you think effort deserves a like.
Thanks