-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprediction.h
145 lines (122 loc) · 3.46 KB
/
prediction.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <utility>
#include "stdio.h"
#include<iostream>
#include "implicit_als_model.h"
#include "numeric_table.h"
#pragma once
namespace als
{
template<typename FPType>
class Prediction
{
public:
Prediction(ModelPtr<FPType> model,TablePtr<FPType> oldTable ):_model(model),_oldTable(oldTable)
{
compute();
}
FPType getRating(const size_t nUser, const size_t nItem) const
{
return (*_table)[nUser*(_table->getNumberOfColumns())+nItem];
}
std::pair<FPType,FPType> getBestItem() const
{
FPType _sumRating=0;
size_t _rows=_table->getNumberOfRows();
size_t _cols=_table->getNumberOfColumns();
std::pair<FPType,FPType> _bestItem(0,0);//number item and rating
for(size_t i=0;i<_cols;i++)
{
for(size_t j=0;j<_rows;j++)
{
_sumRating+=(*_table)[j*_cols+i];
}
if(_sumRating>_bestItem.second)
{
_bestItem.second=_sumRating;
_bestItem.first=i;
}
_sumRating=0;
}
_bestItem.second=_bestItem.second/_rows;
return _bestItem;
}
std::pair<FPType,FPType> getBestItem(size_t const _user) const
{
std::pair<FPType,FPType> _bestItem (0,0);
size_t _cols=_table->getNumberOfColumns();
for(size_t i=0;i<_cols;i++)
{
if((*_oldTable)[_user*_cols+i]==0)
{
if ((*_table)[_user*_cols+i]>_bestItem.second)
{
_bestItem.second=(*_table)[_user*_cols+i];
_bestItem.first=i;
}
}
}
return _bestItem;
}
FPType maxItem()
{
size_t _rows=_table->getNumberOfRows();
size_t _cols=_table->getNumberOfColumns();
FPType maxItem=0;
for(size_t i=0;i<_cols;i++)
{
for(size_t j=0;j<_rows;j++)
{
if((*_table)[j*_cols+i]>maxItem)
{
maxItem=(*_table)[j*_cols+i];
}
}
}
return maxItem;
}
FPType minItem()
{
size_t _rows=_table->getNumberOfRows();
size_t _cols=_table->getNumberOfColumns();
FPType minItem=0;
for(size_t i=0;i<_cols;i++)
{
for(size_t j=0;j<_rows;j++)
{
if((*_table)[j*_cols+i]<minItem)
{
minItem=(*_table)[j*_cols+i];
}
}
}
return minItem;
}
FPType avg()
{
size_t _rows=_table->getNumberOfRows();
size_t _cols=_table->getNumberOfColumns();
FPType sum=0;
for(size_t i=0;i<_cols;i++)
{
for(size_t j=0;j<_rows;j++)
{
sum+=(*_table)[j*_cols+i];
}
}
return sum/(_cols*_rows);
}
private:
ModelPtr<FPType> _model;
TablePtr<FPType> _usersFactors;
TablePtr<FPType> _itemsFactors;
TablePtr<FPType> _oldTable;
TablePtr<FPType> _table;
void compute()
{
TablePtr<FPType> usersFactors=_model->getUsersFactors();
_usersFactors=utils::getTransposeMatrix(usersFactors);
_itemsFactors=_model->getItemsFactors();
_table=utils::matrixMultiplication(_usersFactors,_itemsFactors);
}
};
}