Chi square test

-

import numpy as np
from scipy.stats import chi2_contingency

r=int(input("Enter number of rows: "))
c=int(input("Enter number of columns: "))
observed=[]
print("Enter observed values:")
for i in range(r):
    row=list(map(float,input().split()))
    observed.append(row)
observed=np.array(observed)
chi2,p,dof,expected=chi2_contingency(observed)
print("\nChi-Square Value:",chi2)
print("Degrees of Freedom:",dof)
print("Expected Frequencies:\n",expected)
print("P-Value:",p)
alpha=0.05
if p<alpha:
    print("\nConclusion: Reject the Null Hypothesis (Variables are dependent)")
else:
    print("\nConclusion: Fail to Reject the Null Hypothesis (Variables are independent)")

Output:


Enter number of rows: 2
Enter number of columns: 2
Enter observed values:
50 30
20 40
Chi-Square Value: 10.529166666666667
Degrees of Freedom: 1
Expected Frequencies:
 [[40. 40.]
 [30. 30.]]
P-Value: 0.0011750518530845063

Conclusion: Reject the Null Hypothesis (Variables are dependent)

Comments

Post a Comment

Popular posts from this blog

Dijkstra's Algorithm Matrix

-
  #include <stdio.h> #include <stdlib.h> #include <limits.h> #define MAX 100 #define INF INT_MAX int adj[MAX][MAX]; int dist[MAX]; int pred[MAX]; int visited[MAX]; void create_graph(int n, int gtype); void dijkstra(int n, int source); void print_shortest_path(int source, int destination); int main() {     int n, gtype, source;     printf("Enter 1 for undirected graph and -1 for directed graph: ");     scanf("%d", &gtype);     printf("Enter the number of vertices: ");     scanf("%d", &n);     create_graph(n, gtype);     printf("Enter the source vertex: ");     scanf("%d", &source);     dijkstra(n, source);     for (int i = 0; i < n; i++) {         if (i != source) {             printf("Shortest path from vertex %d to vertex %d: ", source, i);             print_shortest_path...
Read more

k means JDK java

-
import java.util.*; public class KMeansDynamic {     public static void main(String[] args) {         Scanner sc = new Scanner(System.in);         System.out.print("Enter number of data points: ");         int n = sc.nextInt();         System.out.print("Enter number of features: ");         int f = sc.nextInt();         double[][] data = new double[n][f];         for (int i = 0; i < n; i++) {             System.out.print("Enter features for data point " + (i + 1) + " separated by space: ");             for (int j = 0; j < f; j++) {                 data[i][j] = sc.nextDouble();             }         }         System.out.print("Enter number of clusters (k): ");   ...
Read more