zoukankan      html  css  js  c++  java
  • PCCs系数

    package ai;

    public class pccs {

    public static void main(String[] args) {
    double same[][]=new double[2][4];
    same[0]=new double[]{1,2,3,4,6,6,7,7,8,8,9};
    same[1]=new double[]{-1,-2,-3,-4,-6,-6,-7,-7,-8,-8,-9};//{1,2,3,4,6,6,7,7,8,0,9};
    double ship=sameShip(same);
    System.out.println(ship);
    }

    public static double []sum(double same[][]){
    double samesSum[]={0,0};
    double sumA=0;
    double sumB=0;
    for(double entity:same[0]){
    sumA+=entity;
    }
    for(double entity:same[1]){
    sumB+=entity;
    }
    samesSum[0]=sumA;
    samesSum[1]=sumB;
    return samesSum;
    }
    public static double []squareSum(double same[][]){
    double samesSum[]={0,0};
    double sumA=0;
    double sumB=0;
    for(double entity:same[0]){
    sumA+=(entity*entity);
    }
    for(double entity:same[1]){
    sumB+=(entity*entity);
    }
    samesSum[0]=sumA;
    samesSum[1]=sumB;
    return samesSum;
    }
    public static double joinSum(double same[][]){
    double joinSum=0;
    for(int i=0;i<same[0].length;i++){
    joinSum+=same[0][i]*same[1][i];
    }
    return joinSum;
    }
    public static double sameShip(double same[][]){
    int num_ratings=same[0].length;
    double product_sum= joinSum(same);
    double sumTwo[]=sum(same);
    double squareSumEntity[]=squareSum(same);
    double user1_squared_sum=squareSumEntity[0];
    double user2_squared_sum=squareSumEntity[1];
    double Sxy=product_sum-(sumTwo[0]*sumTwo[1]/num_ratings);
    double Sxx = user1_squared_sum - (sumTwo[0]*sumTwo[0]) / num_ratings;
    double Syy = user2_squared_sum - (sumTwo[1]*sumTwo[1]) / num_ratings;
    if (Sxx * Syy == 0)
    return 0;

    return Sxy / (Math.sqrt(Sxx * Syy));
    }
    }

  • 相关阅读:
    js 冒泡排序 与非冒泡排序
    js Base64加密与解密
    复杂的时间调度器
    js计算阶乘与斐波切纳数列
    js按需加载兼容性写法
    关于JavaScript的宏任务与微任务
    caller与callee的区别
    如何实现一个parseInt
    nodejs 保存 payload 发送过来的文件
    angularjs:[1] ui-router 权限控制
  • 原文地址:https://www.cnblogs.com/developer-ios/p/9689658.html
Copyright © 2011-2022 走看看