wiki链接: Cosine Similarity
这里给出公式:
给你两个相同大小的向量 A B,求出他们的余弦相似度
返回 2.0000
如果余弦相似不合法 (比如 A = [0] B = [0]).
样例
给出 A = [1, 2, 3]
, B = [2, 3 ,4]
.
返回 0.9926.
给出 A = [0]
, B = [0]
.
返回 2.0000
/**
* @param A: An integer array.
* @param B: An integer array.
* @return: Cosine similarity.
*/
public double cosineSimilarity(int[] A, int[] B) {
// write your code here
if (A.length == 0 || B.length == 0 || A.length != B.length){
return 2.0000;
}
int a = 0;
int b = 0;
int c = 0;
for (int i = 0; i < A.length; i++){
a += A[i] * A[i];
b += B[i] * B[i];
c += A[i] * B[i];
}
if (a == 0 || b == 0){
return 2.0000;
}
return c/( Math.sqrt(a) * Math.sqrt(b));
}
}