localpca.h

该算法是张青复与周爱民的基于RM-MEDA算法的程序

//
//Please find details of the method from
//
//	Q. Zhang, A. Zhou and Y. Jin, "RM-MEDA: A Regularity Model Based Multiobjective Estimation of Distribution Algorithm", IEEE Trans. Evolutionary Computation, Vol. 12, no. 1, pp41-63, 2008.
//
//The source codes are free for reserach work. If you have any problem with the source codes, please contact with 
//	Qingfu Zhang, 
//		Department of Computing and Electronic Systems,
//		University of Essex,
//		Colchester, CO4 3SQ, UK
//		http://cswww.essex.ac.uk/staff/zhang
//		Email: [e-mail]
//    Aimin Zhou
//		Department of Computing and Electronic Systems,
//		University of Essex,
//		Colchester, CO4 3SQ, UK
//		http://privatewww.essex.ac.uk/~azhou/
//		Email: [e-mail] or [e-mail] 
//Programmer:		
//		Aimin Zhou
//Last Update:
//		Feb. 21, 2008
//
//LocalPCA.h : Local Principal Component Analysis (Local PCA) model
//

#ifndef	AZ_LOCALPCA_H
#define	AZ_LOCALPCA_H

#include <vector>
#include "Model.h"

//!\brief	az namespace, the top namespace
namespace az
{

//!\brief	alg namespace, contains algorithms
namespace alg
{
//!\brief Local PCA, partion data into clusters 
class LocalPCA:public Model
{
protected:
	std::vector< std::vector< std::vector<double> > >	mvPI;	//!< matrix PI to each cluster
public:
	//!\brief	train process
	//!\return	void
	void Train();
protected:
	//!\brief	calculate the distance between data m to cluster c
	//!\param	m	datat index
	//!\param	c	cluster index
	//!\return	distance
	double Distance(unsigned int m, unsigned int c);
};//class LocalPCA

} //namespace alg

} //namespace az

#endif //AZ_LOCALPCA_H