b0VIM 7.2/XGcravencapuchin.biostat.wisc.edu~craven/public_html/cs760/hw/hw4.htmlutf-8 U3210#"! UtpJ)Kad;J}| } | P K t n m l h g U 6 cH43/.ZJso

The number of the test-set examples that were correctly classified.

  • predicted class, (ii) the actual class, (iii) and the posterior probability of the predicted class (rounded to 12 digits after the decimal point).theindicating (i)
  • One line for each instance in the test-set (in the same order as this file)
  • The structure of the Bayes net by listing one line per variable in which you indicate (i) the name of the variable, (ii) the names of its parents in the Bayes net (for naive Bayes, this will simply be the 'class' variable for each other variable) separated by whitespace.
  • To root the maximal weight spanning tree, pick the first variable in the input file as the root.
  • Use Prim's algorithm to find a maximal spanning tree (but choose maximal weight edges instead of minimal weight ones). Initialize this process by choosing the first variable in the input file for Vnew. If there are ties in selecting maximum weight edges, use the following preference criteria: (1) prefer edges emanating from variables listed earlier in the input file, (2) if there are multiple minimal weight edges emanating from the first such variable, prefer edges going to variables listed earlier in the input file.
  • Laplace estimates (pseudocounts of 1) are used when estimating all probabilities.
  • All of the variables are discrete valued. Your program should be able to handle an arbitrary number of variables with possibly different numbers of values for each variable.
  • Your code is intended for binary classification problems.