Is there a way to compute how 'closely' a data vector matches another? For example:
A = [1 2 3 4 5];B = [1 2 3 4 5];C = [6 7 8 9 10];
Can I use vector A to compare the closeness against vector B, and then vector C? For (A,B), the closeness should be 100%, where as for (A,C) it should be 0%…
Best Answer