gstabsearch.h

一个由Mike Gashler完成的机器学习方面的includes neural net, naive bayesian classifier, decision tree, KNN, a genet

#ifndef __GSTABSEARCH_H__
#define __GSTABSEARCH_H__

#include "GSearch.h"

// Each iteration performs a binary (divde-and-conquer) search.
// Because the high-level divisions are typically less correlated
// with the final result than the low-level divisions, it searches
// through the space of possible "stabs" by toggling choices in
// the order from high level to low level.
class GStabSearch : public GRealVectorSearch
{
protected:
	int m_nDimensions;
	unsigned int m_nMask[4];
	double m_dMin, m_dRange;
	double* m_pMins;
	double* m_pRanges;
	double* m_pVector;
	double m_dTolerance;
	int m_nCurrentDim;
	int m_nMaskPos;
	int m_nStabs;

public:
	GStabSearch(GRealVectorCritic* pCritic, double dMin, double dRange);
	virtual ~GStabSearch();

	virtual void Iterate();
	void SetTolerance(double d) { m_dTolerance = d; }
	int GetStabCount() { return m_nStabs; }

#ifndef NO_TEST_CODE
	static void Test();
#endif // !NO_TEST_CODE
protected:
	void Reset();
};

#endif // __GSTABSEARCH_H__