about summary refs log tree commit diff
path: root/sourcecodes/bnt-master/netlab3.3/confmat.m
diff options
context:
space:
mode:
authorziejd22017-09-28 15:04:40 -0500
committerziejd22017-09-28 15:04:40 -0500
commit8070dc963753142bb86c4ed698d91fd623ed28e7 (patch)
treed0f6dd8fc46a49b819aa55c1a90faa14d8448883 /sourcecodes/bnt-master/netlab3.3/confmat.m
parent7cc31810d53176e805532b2789955f4eedbce6bb (diff)
downloadBNW-8070dc963753142bb86c4ed698d91fd623ed28e7.tar.gz
BNW using Octave instead of Matlab.
This version of BNW should perform the same as the original version. The only difference is that it uses Octave instead of Matlab when running BayesNet Toolbox during parameter learning.

I am calling this BNW_1.02. It can be accessed at:
compbio.uthsc.edu/BNW_1.02
Diffstat (limited to 'sourcecodes/bnt-master/netlab3.3/confmat.m')
-rw-r--r--sourcecodes/bnt-master/netlab3.3/confmat.m56
1 files changed, 56 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/netlab3.3/confmat.m b/sourcecodes/bnt-master/netlab3.3/confmat.m
new file mode 100644
index 00000000..e03315bb
--- /dev/null
+++ b/sourcecodes/bnt-master/netlab3.3/confmat.m
@@ -0,0 +1,56 @@
+function [C,rate]=confmat(Y,T)
+%CONFMAT Compute a confusion matrix.
+%
+%	Description
+%	[C, RATE] = CONFMAT(Y, T) computes the confusion matrix C and
+%	classification performance RATE for the predictions mat{y} compared
+%	with the targets T.  The data is assumed to be in a 1-of-N encoding,
+%	unless there is just one column, when it is assumed to be a 2 class
+%	problem with a 0-1 encoding.  Each row of Y and T corresponds to a
+%	single example.
+%
+%	In the confusion matrix, the rows represent the true classes and the
+%	columns the predicted classes.  The vector RATE has two entries: the
+%	percentage of correct classifications and the total number of correct
+%	classifications.
+%
+%	See also
+%	CONFFIG, DEMTRAIN
+%
+
+%	Copyright (c) Ian T Nabney (1996-2001)
+
+[n c]=size(Y);
+[n2 c2]=size(T);
+
+if n~=n2 | c~=c2
+  error('Outputs and targets are different sizes')
+end
+
+if c > 1
+  % Find the winning class assuming 1-of-N encoding
+  [maximum Yclass] = max(Y', [], 1);
+
+  TL=[1:c]*T';
+else
+  % Assume two classes with 0-1 encoding
+  c = 2;
+  class2 = find(T > 0.5);
+  TL = ones(n, 1);
+  TL(class2) = 2;
+  class2 = find(Y > 0.5);
+  Yclass = ones(n, 1);
+  Yclass(class2) = 2;
+end
+
+% Compute 
+correct = (Yclass==TL);
+total=sum(sum(correct));
+rate=[total*100/n total];
+
+C=zeros(c,c);
+for i=1:c
+  for j=1:c
+    C(i,j) = sum((Yclass==j).*(TL==i));
+  end
+end