当前位置:网站首页>Mahout-Pearson correlation的实现
Mahout-Pearson correlation的实现
2022-07-07 20:57:00 【全栈程序员站长】
大家好,又见面了,我是全栈君。
计算公式:
并通过以下代码对Mahout in Action的结果进行了验证:
代码例如以下: ` package com.example.mahout;
public class TestColl {
public static void main(String[] args) {
// TODO Auto-generated method stub
//int a[]={68,71,62,75,58,60,67,68,71,69,68,67,63,62,60,63,65,67,63,61};
//double b[] ={4.1,4.6,3.8,4.4,3.2,3.1,3.8,4.1,4.3,3.7,3.5,3.2,3.7,3.3,3.4,4.0,4.1,3.8,3.4,3.6};
double a[]={5,3.0,2.5};
double b[]={4,3,2.0};
int i,j;
double sum_a=0,sum_b=0,sum_XY=0,sum_X=0,sum_Y=0,sum_X2=0,sum_Y2=0;
double mean_a,var_a,mean_b,var_b;
for(i=0;i<a.length;i++){
sum_a+=a[i];
sum_b+=b[i];
sum_XY+=a[i]*b[i];
sum_X2+=a[i]*a[i];
sum_Y2+=b[i]*b[i];
}
mean_a = sum_a/a.length;
mean_b = sum_b/b.length;
System.out.println("sum_a:"+sum_a);
System.out.println("sum_b:"+sum_b);
System.out.println("mean_a:"+mean_a);
System.out.println("mean_b:"+mean_b);
sum_X=sum_a;
sum_Y = sum_b;
sum_a=sum_b=0;
for(i=0;i<a.length;i++){
sum_a+=(a[i]-mean_a)*(a[i]-mean_a);
sum_b+=(b[i]-mean_b)*(b[i]-mean_b);
}
var_a=sum_a/(a.length-1);
var_b=sum_b/(a.length-1);
System.out.println("var_a:"+var_a);
System.out.println("var_b:"+var_b);
System.out.println("sum_XY:"+sum_XY);
System.out.println("sum_X:"+sum_X);
System.out.println("sum_X2:"+sum_X2);
System.out.println("sum_Y2:"+sum_Y2);
double r_up = a.length*sum_XY-sum_X*sum_Y;
double r_down = Math.sqrt((a.length*sum_X2-sum_X*sum_X)*(a.length*sum_Y2-sum_Y*sum_Y));
double r=r_up/r_down;
System.out.println("r_up:"+r_up);
System.out.println("r_down:"+r_down);
System.out.println("r:"+r);
}} `
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/116278.html原文链接:https://javaforall.cn
边栏推荐
- 凌云出海记 | 易点天下&华为云:推动中国电商企业品牌全球化
- 智能软件分析平台Embold
- [function recursion] do you know all five classic examples of simple recursion?
- Static analysis of software defects codesonar 5.2 release
- Deep learning model compression and acceleration technology (VII): mixed mode
- 刚开户的能买什么股票呢?炒股账户安全吗
- 华为CE交换机下载文件FTP步骤
- Onespin | solve the problems of hardware Trojan horse and security trust in IC Design
- Differences and connections between MinGW, mingw-w64, tdm-gcc and other tool chains "suggestions collection"
- 写一下跳表
猜你喜欢
![嵌入式系统真正安全了吗?[ OneSpin如何为开发团队全面解决IC完整性问题 ]](/img/af/61b384b1b6ba46aa1a6011f8a30085.png)
嵌入式系统真正安全了吗?[ OneSpin如何为开发团队全面解决IC完整性问题 ]

神兵利器——敏感文件发现工具

Tensorflow2.x下如何运行1.x的代码

I Basic concepts

恶魔奶爸 B3 少量泛读,完成两万词汇量+

解决使用uni-app MediaError MediaError ErrorCode -5

使用枚举实现英文转盲文

上海交大最新《标签高效深度分割》研究进展综述,全面阐述无监督、粗监督、不完全监督和噪声监督的深度分割方法

程序猿赚的那点钱算个P啊!

ERROR: 1064 (42000): You have an error in your SQL syntax; check the manual that corresponds to your
随机推荐
智能软件分析平台Embold
[function recursion] do you know all five classic examples of simple recursion?
CodeSonar如何帮助无人机查找软件缺陷?
Airiot helps the urban pipe gallery project, and smart IOT guards the lifeline of the city
使用高斯Redis实现二级索引
恶魔奶爸 B3 少量泛读,完成两万词汇量+
Phoenix JDBC
【奖励公示】第22期 2022年6月奖励名单公示:社区明星评选 | 新人奖 | 博客同步 | 推荐奖
C language helps you understand pointers from multiple perspectives (1. Character pointers 2. Array pointers and pointer arrays, array parameter passing and pointer parameter passing 3. Function point
Useful win11 tips
【函数递归】简单递归的5个经典例子,你都会吗?
AADL Inspector 故障树安全分析模块
Object-C programming tips timer "suggestions collection"
easyui 日期控件清空值
最新版本的CodeSonar改进了功能安全性,支持MISRA,C ++解析和可视化
CodeSonar通过创新型静态分析增强软件可靠性
Alibaba cloud award winning experience: how to mount NAS file system through ECS
Referrer和Referrer-Policy简介
反诈困境,国有大行如何破局?
openGl超级宝典学习笔记 (1)第一个三角形「建议收藏」