#include <LinearSplitsTree.hh>

Inheritance diagram for LinearSplitsTree:

Classes
struct	tree_experience
struct	tree_node
Public Member Functions
tree_node *	allocateNode ()
void	buildTree (tree_node node, const std::vector< tree_experience > &instances, bool changed)
float	calcAvgErrorforSet (const std::vector< tree_experience * > &instances)
float	calcER (int dim, float val, const std::vector< tree_experience * > &instances, float error, std::vector< tree_experience * > &left, std::vector< tree_experience * > &right, float leftError, float rightError)
void	compareSplits (float er, int dim, float val, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, int nties, float leftError, float rightError, float bestER, int bestDim, float bestVal, std::vector< tree_experience * > bestLeft, std::vector< tree_experience > bestRight, float bestLeftError, float *bestRightError)
void	copyTree (tree_node newNode, tree_node origNode)
void	deallocateNode (tree_node *node)
void	deleteTree (tree_node *node)
float	fitMultiLinearModel (const std::vector< tree_experience * > &instances, float constant, std::vector< float > coeff)
float	fitSimpleLinearModel (const std::vector< tree_experience * > &instances, float constant, std::vector< float > coeff)
float	getConf (const std::vector< float > &input)
virtual LinearSplitsTree *	getCopy ()
tree_node *	getCorrectChild (tree_node *node, const std::vector< float > &input)
std::set< float >	getUniques (int dim, const std::vector< tree_experience * > &instances, float &minVal, float &maxVal)
void	implementSplit (tree_node node, const std::vector< tree_experience > &instances, float bestER, int bestDim, float bestVal, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, bool changed, float leftError, float rightError)
void	initNodes ()
void	initTree ()
void	initTreeNode (tree_node *node)
void	leafPrediction (tree_node t, const std::vector< float > &in, std::map< float, float > retval)
	LinearSplitsTree (int id, int trainMode, int trainFreq, int m, float featPct, bool simple, float min_er, Random rng)
	LinearSplitsTree (const LinearSplitsTree &)
void	makeLeaf (tree_node node, const std::vector< tree_experience > &instances)
bool	passTest (int dim, float val, const std::vector< float > &input)
void	printTree (tree_node *t, int level)
void	rebuildTree ()
float *	sortOnDim (int dim, const std::vector< tree_experience * > &instances)
void	testInstance (const std::vector< float > &input, std::map< float, float > *retval)
void	testPossibleSplits (float avgError, const std::vector< tree_experience * > &instances, float bestER, int bestDim, float bestVal, std::vector< tree_experience > bestLeft, std::vector< tree_experience > bestRight, float bestLeftError, float *bestRightError)
bool	trainInstance (classPair &instance)
bool	trainInstances (std::vector< classPair > &instances)
tree_node *	traverseTree (tree_node *node, const std::vector< float > &input)
	~LinearSplitsTree ()
Public Attributes
bool	COPYDEBUG
bool	DTDEBUG
bool	INCDEBUG
bool	LMDEBUG
int	nExperiences
bool	NODEDEBUG
float	SPLIT_MARGIN
bool	SPLITDEBUG
bool	STOCH_DEBUG
Private Attributes
tree_experience	allExp [N_LST_EXP]
tree_node	allNodes [N_LS_NODES]
std::vector< tree_experience * >	experiences
const float	featPct
std::vector< int >	freeNodes
const int	freq
bool	hadError
const int	id
tree_node *	lastNode
const int	M
int	maxnodes
const float	MIN_ER
const int	mode
int	nnodes
int	nOutput
Random	rng
tree_node *	root
const bool	SIMPLE
int	totalnodes

Detailed Description

M5 decision tree class

Definition at line 20 of file LinearSplitsTree.hh.

Constructor & Destructor Documentation

LinearSplitsTree::LinearSplitsTree	(	int	id,
		int	trainMode,
		int	trainFreq,
		int	m,
		float	featPct,
		bool	simple,
		float	min_er,
		Random	rng
	)

Definition at line 18 of file LinearSplitsTree.cc.

LinearSplitsTree::LinearSplitsTree ( const LinearSplitsTree & ls )

Definition at line 59 of file LinearSplitsTree.cc.

LinearSplitsTree::~LinearSplitsTree ( )

Definition at line 149 of file LinearSplitsTree.cc.

Member Function Documentation

LinearSplitsTree::tree_node * LinearSplitsTree::allocateNode ( )

Definition at line 1512 of file LinearSplitsTree.cc.

void LinearSplitsTree::buildTree	(	tree_node *	node,
		const std::vector< tree_experience * > &	instances,
		bool	changed
	)

Build the tree from this node down using this set of experiences.

Definition at line 603 of file LinearSplitsTree.cc.

float LinearSplitsTree::calcAvgErrorforSet ( const std::vector< tree_experience * > & instances )

Calculate std deviation for set.

Definition at line 1327 of file LinearSplitsTree.cc.

float LinearSplitsTree::calcER	(	int	dim,
		float	val,
		const std::vector< tree_experience * > &	instances,
		float	avgError,
		std::vector< tree_experience * > &	left,
		std::vector< tree_experience * > &	right,
		float *	leftError,
		float *	rightError
	)

Calculate error reduction for this possible split.

Definition at line 1274 of file LinearSplitsTree.cc.

void LinearSplitsTree::compareSplits	(	float	er,
		int	dim,
		float	val,
		const std::vector< tree_experience * > &	left,
		const std::vector< tree_experience * > &	right,
		int *	nties,
		float	leftError,
		float	rightError,
		float *	bestER,
		int *	bestDim,
		float *	bestVal,
		std::vector< tree_experience * > *	bestLeft,
		std::vector< tree_experience * > *	bestRight,
		float *	bestLeftError,
		float *	bestRightError
	)

Decide if this split is better.

Definition at line 1216 of file LinearSplitsTree.cc.

void LinearSplitsTree::copyTree	(	tree_node *	newNode,
		tree_node *	origNode
	)

Definition at line 113 of file LinearSplitsTree.cc.

void LinearSplitsTree::deallocateNode ( tree_node * node )

Definition at line 1531 of file LinearSplitsTree.cc.

void LinearSplitsTree::deleteTree ( tree_node * node )

delete current tree

Definition at line 524 of file LinearSplitsTree.cc.

float LinearSplitsTree::fitMultiLinearModel	(	const std::vector< tree_experience * > &	instances,
		float *	constant,
		std::vector< float > *	coeff
	)

Definition at line 708 of file LinearSplitsTree.cc.

float LinearSplitsTree::fitSimpleLinearModel	(	const std::vector< tree_experience * > &	instances,
		float *	constant,
		std::vector< float > *	coeff
	)

Definition at line 940 of file LinearSplitsTree.cc.

float LinearSplitsTree::getConf ( const std::vector< float > & input ) [virtual]

Implements Classifier.

Definition at line 444 of file LinearSplitsTree.cc.

LinearSplitsTree * LinearSplitsTree::getCopy ( ) [virtual]

Implements Classifier.

Definition at line 144 of file LinearSplitsTree.cc.

LinearSplitsTree::tree_node * LinearSplitsTree::getCorrectChild	(	tree_node *	node,
		const std::vector< float > &	input
	)

Get the correct child of this node based on the input

Definition at line 562 of file LinearSplitsTree.cc.

std::set< float > LinearSplitsTree::getUniques	(	int	dim,
		const std::vector< tree_experience * > &	instances,
		float &	minVal,
		float &	maxVal
	)

Returns the unique elements at this index

Definition at line 1350 of file LinearSplitsTree.cc.

void LinearSplitsTree::implementSplit	(	tree_node *	node,
		const std::vector< tree_experience * > &	instances,
		float	bestER,
		int	bestDim,
		float	bestVal,
		const std::vector< tree_experience * > &	left,
		const std::vector< tree_experience * > &	right,
		bool	changed,
		float	leftError,
		float	rightError
	)

Definition at line 1061 of file LinearSplitsTree.cc.

void LinearSplitsTree::initNodes ( )

Definition at line 1500 of file LinearSplitsTree.cc.

void LinearSplitsTree::initTree ( )

Definition at line 473 of file LinearSplitsTree.cc.

void LinearSplitsTree::initTreeNode ( tree_node * node )

Definition at line 489 of file LinearSplitsTree.cc.

void LinearSplitsTree::leafPrediction	(	tree_node *	t,
		const std::vector< float > &	in,
		std::map< float, float > *	retval
	)

Definition at line 1476 of file LinearSplitsTree.cc.

void LinearSplitsTree::makeLeaf	(	tree_node *	node,
		const std::vector< tree_experience * > &	instances
	)

Definition at line 677 of file LinearSplitsTree.cc.

bool LinearSplitsTree::passTest	(	int	dim,
		float	val,
		const std::vector< float > &	input
	)

Decide if this passes the test

Definition at line 589 of file LinearSplitsTree.cc.

void LinearSplitsTree::printTree	(	tree_node *	t,
		int	level
	)

Print the tree for debug purposes.

Definition at line 1439 of file LinearSplitsTree.cc.

void LinearSplitsTree::rebuildTree ( )

Definition at line 411 of file LinearSplitsTree.cc.

float * LinearSplitsTree::sortOnDim	(	int	dim,
		const std::vector< tree_experience * > &	instances
	)

Returns a list of the attributes in this dimension sorted from lowest to highest.

Definition at line 1383 of file LinearSplitsTree.cc.

void LinearSplitsTree::testInstance	(	const std::vector< float > &	input,
		std::map< float, float > *	retval
	)		`[virtual]`

Implements Classifier.

Definition at line 424 of file LinearSplitsTree.cc.

void LinearSplitsTree::testPossibleSplits	(	float	avgError,
		const std::vector< tree_experience * > &	instances,
		float *	bestER,
		int *	bestDim,
		float *	bestVal,
		std::vector< tree_experience * > *	bestLeft,
		std::vector< tree_experience * > *	bestRight,
		float *	bestLeftError,
		float *	bestRightError
	)