zoukankan
html css js c++ java
1-确定变量间是否有关系—显著性检验
t检验/Z检验
单样本T检验
检验样本均值是否高于某一水平
双样本T检验
用于检验两组样本间均值是否有差异
配对样本T检验
检验同一个变量前后是否有差异
卡方检验
检验两个变量间是否独立
卡方值越大,说明x和y有关系成立的可能性越小
方差分析(F检验)
用于两个及两个以上样本均数差别的显著性检验
相关性分析
检验两个变量间是否有线性相关关系
查看全文
相关阅读:
[LeetCode] 1640. Check Array Formation Through Concatenation
[LeetCode] 754. Reach a Number
[LeetCode] 1457. Pseudo-Palindromic Paths in a Binary Tree
[LeetCode] 1352. Product of the Last K Numbers
[LeetCode] 261. Graph Valid Tree
[LeetCode] 323. Number of Connected Components in an Undirected Graph
[LeetCode] 1605. Find Valid Matrix Given Row and Column Sums
[LeetCode] 1253. Reconstruct a 2-Row Binary Matrix
[LeetCode] 455. Assign Cookies
[LeetCode] 1358. Number of Substrings Containing All Three Characters
原文地址:https://www.cnblogs.com/lotuslaw/p/15527537.html
最新文章
链表的理解
jar包
数据表-java类的映射
集合应用-斗地主
【STL】reverse()函数
Leetcode 969. Pancake Sorting
Leetcode 122. Best Time to Buy and Sell Stock II
Leetcode 169. Majority Element
数组中重复的数字
Leetcode 565. Array Nesting
热门文章
Leetcode 888. Fair Candy Swap
二维数组中的查找
Leetcode 667. Beautiful Arrangement II
Leetcode 495. Teemo Attacking
[LeetCode] 526. Beautiful Arrangement
[LeetCode] 1710. Maximum Units on a Truck
[LeetCode] 1679. Max Number of K-Sum Pairs
[LeetCode] 1526. Minimum Number of Increments on Subarrays to Form a Target Array
[LeetCode] 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
[LeetCode] 654. Maximum Binary Tree
Copyright © 2011-2022 走看看