infomeasure.h

vc的源代码程序的基于最小特征向量的元素的集合方法的程序源代码

#ifndef InfoMeasure_H
#define InfoMeasure_H

// use shannon's formula
#include <math.h>

	float plogp(float P);


	// *CntV: is a Class Counter Vector. CntV[i] stores the number
	// of Class i's
	// Cnt: is the sum(CntV[0..M]), where M is the total
	// number of classes (ie. the numerically maximal class label
	//
	// Return value:
	//   It returns the entropy value
	//   Sum(plogp((float)CntV[k]/Cnt)), where k from 0..M, M
	//   is the total number of classes

	float entropy (int MaxClass, int *CntV, int Cnt);


	// *leftCntV and *rightCntV: are 2 Class Counter Vector.
	// ith component will store the number of Class i's.
	// 
	// leftCnt and rightCnt: are the sum of the components
	// respectively.
	//
	// total: = leftCnt + rightCnt
	//
	// Return value:
	//   It returns the EXPECTED entropy value

	float infoMeasure(int MaxClass, int *leftCntV, int *rightCntV,
		int leftCnt, int rightCnt, int total);

#endif