DiffPic operator=(const DiffPic ©) {
if(this != ©) {
delete pic_one_;
pic_one_ = new Matrix<Pixel<double> >(copy.get_pic_one());
delete pic_two_;
pic_two_ = new Matrix<Pixel<double> >(copy.get_pic_two());
delete diff_pic_;
diff_pic_ = new Matrix<Pixel<double> >(copy.get_diff_pic());
rmse_ = get_rmse();
}
return *this;
}
int main(int argc, char ** argv){
//first, read the data in files into an array in order to process it more efficiently.
record_item_struct * item_data = (record_item_struct *) _mm_malloc(sizeof(record_item_struct)*RECORD_COUNT,64);
memset(item_data, 0, sizeof(record_item_struct)*RECORD_COUNT);
get_item_data(item_data, argv[1]);
float * item_block_data_i = (float*)_mm_malloc(sizeof(float)*ITEM_BLOCK*USER_COUNT,64);
float * item_block_data_j = (float*)_mm_malloc(sizeof(float)*ITEM_BLOCK*USER_COUNT,64);
if (item_block_data_i==NULL || item_block_data_j == NULL)
{
printf(" malloc of base_data failed\n");
exit(1);
}
double * item_average_matrix = (double*)_mm_malloc(sizeof(double)*ITEM_COUNT,64);
memset(item_average_matrix,0,sizeof(double)*ITEM_COUNT);
k_similarity_struct * item_index_matrix = (k_similarity_struct *) _mm_malloc (sizeof(k_similarity_struct)*K_SORT*ITEM_COUNT,64);
memset (item_index_matrix,-1,sizeof(k_similarity_struct));
int item_start_index_i=0;
int item_start_index_j=0;
// int i,j;
for (int i=0; i <= ITEM_ROUND; i++)
{
printf("round %d ================== with ITEM_BLOCK %d\n",i,ITEM_BLOCK);
//block_data
printf("get item_block_data begins\n");
item_start_index_i = get_item_block_data(i, item_block_data_i,item_start_index_i, item_data);
printf("get_item_block_data ends\n");
//average matrix
printf("get_item_average_matrix begins\n");
get_item_average_matrix(item_block_data_i, item_average_matrix,i*ITEM_BLOCK);
printf("get_item_average_matrix ends\n");
item_start_index_j = 0;
for(int j=0; j<= i;j++)
{
if( i==j)
{
//the index of item after sorting the similarity matrix
printf("get k_similarity_begins\n");
get_pearson_similarity(item_block_data_i,item_block_data_i,item_average_matrix,item_index_matrix,i*ITEM_BLOCK,i*ITEM_BLOCK,0);
printf("get k_similarity_ends\n");
continue;
}
//block_data
printf("get item_block_data begins\n");
item_start_index_j = get_item_block_data(j, item_block_data_j, item_start_index_j, item_data);
printf("get_item_block_data ends\n");
//the index of item after sorting the similarity matrix
printf("get k_similarity_begins\n");
get_pearson_similarity(item_block_data_i,item_block_data_j,item_average_matrix,item_index_matrix,i*ITEM_BLOCK,j*ITEM_BLOCK,1);
printf("get k_similarity_ends\n");
}
}
_mm_free(item_block_data_i);
_mm_free(item_block_data_j);
int *test_data;
float *test_rating;
test_data = (int*)_mm_malloc (sizeof(int)*2*TEST_COUNT,64);
test_rating= (float*)_mm_malloc(sizeof(float)*TEST_COUNT,64);
printf("get_test_data begins\n");
get_test_data(test_data,test_rating);
printf("get_test_data ends\n");
long user_file_start_index = 0;
float * user_block_data = (float*)_mm_malloc(sizeof(float)*USER_BLOCK*ITEM_COUNT,64);
if (user_block_data==NULL)
{
printf(" malloc of base_data failed\n");
exit(1);
}
int test_start_index = 0;
double * item_predict_rating = (double*)_mm_malloc (sizeof(double)*TEST_COUNT,64);
for(int i=0;i<=USER_ROUND;i++)
{
user_file_start_index = get_user_block_data(i,user_block_data, user_file_start_index);
printf("get_predict_rating begins\n");
test_start_index=get_predict_rating(item_predict_rating, user_block_data, item_index_matrix, test_data,item_average_matrix,i*USER_BLOCK, test_start_index);
printf("get_predict_rating ends\n");
if ( test_start_index == TEST_COUNT)
break;
}
_mm_free (user_block_data);
double rmse;
printf("get_rmse begins\n");
rmse = get_rmse(test_rating,item_predict_rating);
printf("ge_rmse ends\n");
printf("rmse= %f\n", rmse);
return 0;
}
// copy constructor
DiffPic(const DiffPic ©) {
pic_one_ = new Matrix<Pixel<double> >(copy.get_pic_one());
pic_two_ = new Matrix<Pixel<double> >(copy.get_pic_two());
diff_pic_ = new Matrix<Pixel<double> >(copy.get_diff_pic());
rmse_ = get_rmse();
}
