#include <algorithm>
#include <cassert>
#include <iostream>
#include "conact_tree.h"
#include "rule_set.h"
Go to the source code of this file.
|
typedef unsigned char | byte |
|
◆ byte
typedef unsigned char byte |
◆ VDim
Enumerator |
---|
Zero | |
One | |
Indifference | |
Definition at line 20 of file hypercube.h.
◆ GenerateOdt() [1/2]
◆ GenerateOdt() [2/2]
◆ GetOdt()
Returns the optimal (or pseudo optimal) decision tree generated from the given rule set.
This function generates the optimal decision tree from the given rule set. When the number of rules is too high, a pseudo optimal tree is generated. If the tree has already been generated, it is loaded from file, unless the "force_generation" parameter is set to true. In this case the tree is always regenerated. The loaded/generated tree is then returned from the function.
- Parameters
-
[in] | rs | Rule set from which generate the decision tree. |
[in] | force_generation | Whether the tree must be generated or can be loaded from file. |
- Returns
- The optimal decision tree associated to the specified rule set.
Definition at line 198 of file hypercube.cpp.
◆ GetOdtWithFileSuffix()
BinaryDrag<conact> GetOdtWithFileSuffix |
( |
const rule_set & |
rs, |
|
|
const std::string & |
file_suffix, |
|
|
bool |
force_generation = false |
|
) |
| |
Returns the optimal (or pseudo optimal) decision tree generated from the given rule set.
This function generates the optimal decision tree from the given rule set. When the number of rules is too high, a pseudo optimal tree is generated. If the tree has already been generated, it is loaded from file, unless the "force_generation" parameter is set to true. In this case the tree is always regenerated. The loaded/generated tree is then returned from the function.
- Parameters
-
[in] | rs | Rule set from which generate the decision tree. |
[in] | file_suffix | Suffix that is appended to the file name of the decision tree file. |
[in] | force_generation | Whether the tree must be generated or can be loaded from file. |
- Returns
- The optimal decision tree associated to the specified rule set.
◆ rawread()
template<typename T >
std::istream& rawread |
( |
std::istream & |
is, |
|
|
T & |
val, |
|
|
size_t |
n |
|
) |
| |
◆ rawwrite()
template<typename T >
std::ostream& rawwrite |
( |
std::ostream & |
os, |
|
|
const T & |
val, |
|
|
size_t |
n |
|
) |
| |