aboutsummaryrefslogtreecommitdiff
path: root/lib/mining/classifier/crf/crf.go
diff options
context:
space:
mode:
Diffstat (limited to 'lib/mining/classifier/crf/crf.go')
-rw-r--r--lib/mining/classifier/crf/crf.go8
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/mining/classifier/crf/crf.go b/lib/mining/classifier/crf/crf.go
index ceb9b605..91a470cf 100644
--- a/lib/mining/classifier/crf/crf.go
+++ b/lib/mining/classifier/crf/crf.go
@@ -1,6 +1,6 @@
-// Copyright 2016 Mhd Sulhan <ms@kilabit.info>. All rights reserved.
-// Use of this source code is governed by a BSD-style
-// license that can be found in the LICENSE file.
+// SPDX-FileCopyrightText: 2016 M. Shulhan <ms@kilabit.info>
+//
+// SPDX-License-Identifier: BSD-3-Clause
// Package crf implement the cascaded random forest algorithm, proposed by
// Baumann et.al in their paper:
@@ -150,7 +150,7 @@ func (crf *Runtime) Build(samples tabula.ClasetInterface) (e error) {
fmt.Println(tag, "Sample (one row):", samples.GetRow(0))
fmt.Println(tag, "Config:", crf)
- for x := 0; x < crf.NStage; x++ {
+ for range crf.NStage {
forest, e := crf.createForest(samples)
if e != nil {
return e