混淆矩阵


#!/usr/bin/env python
# -*- coding: UTF-8 -*- 
import scipy.io as sio  
import numpy as np  


feat = sio.loadmat("/run/media/zlf/WMU1/Examples/PathologicalSection/WangYu/four_class/CrossValidation1/WithoutAugment/SVM/feat.mat")

print( feat.keys() )  
feat = feat['feat'];
a = feat.shape
print( a )


num_c0_c0 = 0;
num_c0_c1 = 0;
num_c0_c2 = 0;

num_c1_c0 = 0;
num_c1_c1 = 0;
num_c1_c2 = 0;

num_c2_c0 = 0;
num_c2_c1 = 0;
num_c2_c2 = 0;



predict = feat[:, 0:3];
print(predict)

tmp = 0

for i in range(a[0]):
    print(feat[i,3])
    if feat[i,3] == 0:
        if feat[i,0] == max(predict[i][:]):
            num_c0_c0 = num_c0_c0 + 1;
        elif feat[i,1] == max(predict[i][:]):
            num_c0_c1 = num_c0_c1 + 1;
        else:
            num_c0_c2 = num_c0_c2 + 1 
            
    if feat[i,3] == 1:
        print('B')
        if feat[i,0] == max(predict[i][:]):
            num_c1_c0 = num_c1_c0 + 1;
        elif feat[i,1] == max(predict[i][:]):
            num_c1_c1 = num_c1_c1 + 1;
        else:
            num_c1_c2 = num_c1_c2 + 1 
        
    
    if feat[i,3] == 2:
        print(feat[i,3])
        if feat[i][0] == max(predict[i][:]):
            num_c2_c0 = num_c2_c0 + 1;
        elif feat[i,1] == max(predict[i][:]):
            num_c2_c1 = num_c2_c1 + 1;
        else:
            num_c2_c2 = num_c2_c2 + 1 
        
        
print( "num_c0_c0", str(num_c0_c0) )
print( "num_c0_c1", str(num_c0_c1) )
print( "num_c0_c2", str(num_c0_c2) )

print( "num_c1_c0", str(num_c1_c0) )
print( "num_c1_c1", str(num_c1_c1) )
print( "num_c1_c2", str(num_c1_c2) )

print( "num_c2_c0", str(num_c2_c0) )
print( "num_c2_c1", str(num_c2_c1) )
print( "num_c2_c2", str(num_c2_c2) )


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值