//
// ClassifySet given a samples predict their class by running each sample in
// forest, adn return their class prediction with confusion matrix.
// `samples` is the sample that will be predicted, `sampleIds` is the index of
// samples.
// If `sampleIds` is not nil, then sample index will be checked in each tree,
// if the sample is used for training, their vote is not counted.
//
// Algorithm,
//
// (0) Get value space (possible class values in dataset)
// (1) For each row in test-set,
// (1.1) collect votes in all trees,
// (1.2) select majority class vote, and
// (1.3) compute and save the actual class probabilities.
// (2) Compute confusion matrix from predictions.
// (3) Compute stat from confusion matrix.
// (4) Write the stat to file only if sampleIds is empty, which mean its run
// not from OOB set.
//
func (forest *Runtime) ClassifySet(samples tabula.ClasetInterface,
sampleIds []int,
) (
predicts []string, cm *classifier.CM, probs []float64,
) {
stat := classifier.Stat{}
stat.Start()
if len(sampleIds) <= 0 {
fmt.Println(tag, "Classify set:", samples)
fmt.Println(tag, "Classify set sample (one row):",
samples.GetRow(0))
}
// (0)
vs := samples.GetClassValueSpace()
actuals := samples.GetClassAsStrings()
sampleIdx := -1
// (1)
rows := samples.GetRows()
for x, row := range *rows {
// (1.1)
if len(sampleIds) > 0 {
sampleIdx = sampleIds[x]
}
votes := forest.Votes(row, sampleIdx)
// (1.2)
classProbs := tekstus.WordsProbabilitiesOf(votes, vs, false)
_, idx, ok := numerus.Floats64FindMax(classProbs)
if ok {
predicts = append(predicts, vs[idx])
}
// (1.3)
probs = append(probs, classProbs[0])
}
// (2)
cm = forest.ComputeCM(sampleIds, vs, actuals, predicts)
// (3)
forest.ComputeStatFromCM(&stat, cm)
stat.End()
if len(sampleIds) <= 0 {
fmt.Println(tag, "CM:", cm)
fmt.Println(tag, "Classifying stat:", stat)
_ = stat.Write(forest.StatFile)
}
return predicts, cm, probs
}
//
// ClassifySetByWeight will classify each instance in samples by weight
// with respect to its single performance.
//
// Algorithm,
// (1) For each instance in samples,
// (1.1) for each stage,
// (1.1.1) collect votes for instance in current stage.
// (1.1.2) Compute probabilities of each classes in votes.
//
// prob_class = count_of_class / total_votes
//
// (1.1.3) Compute total of probabilites times of stage weight.
//
// stage_prob = prob_class * stage_weight
//
// (1.2) Divide each class stage probabilites with
//
// stage_prob = stage_prob /
// (sum_of_all_weights * number_of_tree_in_forest)
//
// (1.3) Select class label with highest probabilites.
// (1.4) Save stage probabilities for positive class.
// (2) Compute confusion matrix.
//
func (crf *Runtime) ClassifySetByWeight(samples tabula.ClasetInterface,
sampleIds []int,
) (
predicts []string, cm *classifier.CM, probs []float64,
) {
stat := classifier.Stat{}
stat.Start()
vs := samples.GetClassValueSpace()
stageProbs := make([]float64, len(vs))
stageSumProbs := make([]float64, len(vs))
sumWeights := numerus.Floats64Sum(crf.weights)
// (1)
rows := samples.GetDataAsRows()
for _, row := range *rows {
for y := range stageSumProbs {
stageSumProbs[y] = 0
}
// (1.1)
for y, forest := range crf.forests {
// (1.1.1)
votes := forest.Votes(row, -1)
// (1.1.2)
probs := tekstus.WordsProbabilitiesOf(votes, vs, false)
// (1.1.3)
for z := range probs {
stageSumProbs[z] += probs[z]
stageProbs[z] += probs[z] * crf.weights[y]
}
}
// (1.2)
stageWeight := sumWeights * float64(crf.NTree)
for x := range stageProbs {
stageProbs[x] = stageProbs[x] / stageWeight
}
// (1.3)
_, maxi, ok := numerus.Floats64FindMax(stageProbs)
if ok {
predicts = append(predicts, vs[maxi])
}
probs = append(probs, stageSumProbs[0]/
float64(len(crf.forests)))
}
// (2)
actuals := samples.GetClassAsStrings()
cm = crf.ComputeCM(sampleIds, vs, actuals, predicts)
crf.ComputeStatFromCM(&stat, cm)
stat.End()
_ = stat.Write(crf.StatFile)
return predicts, cm, probs
}