1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
/*********************************************************************
MLDemos: A User-Friendly visualization toolkit for machine learning
Copyright (C) 2010 Basilio Noris
Contact: mldemos@b4silio.com
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public License,
version 3 as published by the Free Software Foundation.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*********************************************************************/
#ifndef _CLASSIFIER_TREES_H_
#define _CLASSIFIER_TREES_H_
#include <vector>
#include "classifier.h"
#include "basicOpenCV.h"
#include <QPixmap>
#include <QPainter>
class ClassifierTrees : public Classifier
{
private:
bool bBalanceClasses;
int minSampleCount;
bool bComputeImportance;
int maxDepth;
int maxTrees;
float accuracyTolerance;
CvRTrees *tree;
int negativeClass;
int maxClass;
public:
std::vector<fvec> samples;
ivec labels;
QPixmap treePixmap;
QPainter *treePainter;
int treeDepth;
int treeCount;
public:
ClassifierTrees();
~ClassifierTrees();
void Train(std::vector< fvec > samples, ivec labels);
float Test(const fvec &sample) const ;
fvec TestMulti(const fvec &sample) const ;
const char *GetInfoString() const ;
fvec GetImportance() const ;
void PrintTree(CvForestTree *tree, int count) const;
void PrintNode(const CvDTreeNode *node, int rootX=0, bool bLeft=true) const;
int GetTreeDepth(const CvDTreeNode *node) const ;
void SetParams(bool bBalanceClasses,
int minSampleCount, int maxDepth, int maxTrees,
float accuracyTolerance);
};
#endif // _CLASSIFIER_BOOST_H_
|
