learn.cpp

一个聚类算法用K-mean处理后迭代

#include <vector>
#include <deque>
#include "head.h"
#include <iostream>
using namespace std;

concept learn( int num_class, int num_k,
			deque<lable_instance>::iterator begin, deque<lable_instance>::iterator end) 
{
		
		vector< vector<instance> > class_vector(num_class);
		
		split( begin, end, class_vector);
		
		concept cc(num_class);
		int i,j, k;
		cluster tmp;

		cout<<class_vector.size()<<endl;
		cout<<class_vector[0].size()<<endl;
		cout<<class_vector[1].size()<<endl;
		
		for(i=0; i<num_class; i++) {
			
			if ( class_vector[i].size()>num_k )
			
				k_means(num_k, class_vector[i], cc[i]);
				
			else {
				
					for(j=0; j< class_vector[i].size(); j++) {
						
						tmp.n=1;
						tmp.f1= class_vector[i][j];
						tmp.f2.assign(tmp.f1.size(),0);
						
						for(k=0; k<class_vector[i][0].size(); k++) {
							
							(tmp.f2)[k]= (tmp.f1)[k] * (tmp.f1)[k];
						}
					
						cc[i].push_back(tmp);
					}
				}
			
		}
		
		return cc;
		
		
}