-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathyelp_handler_filter.cpp
437 lines (320 loc) · 15 KB
/
yelp_handler_filter.cpp
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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
#include "util/Base.h"
#include "struct/User.h"
#include "struct/Item.h"
#include "struct/Rating.h"
#include "util/FileUtil.h"
#include "util/ThreadUtil.h"
#include <algorithm>
#include <boost/property_tree/json_parser.hpp>
#include <boost/property_tree/ptree.hpp>
#include <boost/foreach.hpp>
using namespace mf;
using boost::property_tree::ptree;
void transformIds(const string ratingFilePath, vector<Rating> &ratings,
unordered_map<string, int> &userIdMap, unordered_map<string, int> &itemIdMap, nt filter_num) {
unordered_set<string> kept_user_str_ids;
unordered_set<string> kept_item_str_ids;
bool first_run = true;
while (true) { // keep filtering until all users and items have more than 5 ratings
string line;
ifstream fin(ratingFilePath.c_str());
stringstream ss;
unordered_map<string, int> user_rating_number_map;
unordered_map<string, int> item_rating_number_map;
while (getline(fin, line)) {
if (line.length() == 0) {
continue;
}
ss.clear();
ss << line;
boost::property_tree::ptree pt;
boost::property_tree::read_json(ss, pt);
string user_id_str = pt.get<string>("user_id");
string business_id_str = pt.get<string>("business_id");
auto iter1 = user_rating_number_map.find(user_id_str);
auto iter2 = item_rating_number_map.find(business_id_str);
if (first_run) {
if (iter1 == user_rating_number_map.end()) {
user_rating_number_map[user_id_str] = 1;
kept_user_str_ids.insert(user_id_str);
} else{
user_rating_number_map[user_id_str] += 1;
}
if (iter2 == item_rating_number_map.end()) {
item_rating_number_map[item_id_str] = 1;
kept_item_str_ids.insert(item_id_str);
} else{
item_rating_number_map[item_id_str] += 1;
}
} else {
if(kept_user_str_ids.find(user_id_str) == kept_user_str_ids.end() || kept_item_str_ids.find(item_id_str) == kept_item_str_ids.end()) {
continue;
} else {
if (iter1 == user_rating_number_map.end()) {
user_rating_number_map[user_id_str] = 1;
} else{
user_rating_number_map[user_id_str] += 1;
}
if (iter2 == item_rating_number_map.end()) {
item_rating_number_map[item_id_str] = 1;
} else{
item_rating_number_map[item_id_str] += 1;
}
}
}
}
fin.close();
first_run = false;
bool changed = false;
for(auto iter=user_rating_number_map.begin();iter!=user_rating_number_map.end();iter++) {
if (iter.second < filter_num) {
kept_user_str_ids.erase(iter.first);
changed = true;
}
}
for(auto iter=item_rating_number_map.begin();iter!=item_rating_number_map.end();iter++) {
if (iter.second < filter_num) {
kept_item_str_ids.erase(iter.first);
changed = true;
}
}
if(!changed){
break;
}
}
string line;
ifstream fin(ratingFilePath.c_str());
stringstream ss;
while (getline(fin, line)) {
if (line.length() == 0) {
continue;
}
ss.clear();
ss << line;
boost::property_tree::ptree pt;
boost::property_tree::read_json(ss, pt);
string user_id_str = pt.get<string>("user_id");
string business_id_str = pt.get<string>("business_id");
string score = pt.get<string>("stars");
if(kept_user_str_ids.find(user_id_str) == kept_user_str_ids.end() || kept_item_str_ids.find(item_id_str) == kept_item_str_ids.end()) {
continue;
}
int user_id, business_id;
auto iter = userIdMap.find(user_id_str);
if (iter == userIdMap.end()) {
user_id = userIdMap.size();
userIdMap[user_id_str] = user_id;
} else {
user_id = iter->second;
}
auto iter2 = itemIdMap.find(business_id_str);
if (iter2 == itemIdMap.end()) {
business_id = itemIdMap.size();
itemIdMap[business_id_str] = business_id;
} else {
business_id = iter2->second;
}
ratings.push_back(Rating(user_id, business_id, score));
}
fin.close();
}
void split(const int num_of_thread, const string dataPath, const string outputFolder, const string metaPath, const string userIDMapPath, const string itemIDMapPath, const string outputMMCTrainPath,
const string outputMMCTestPath, const string outputCSRTrainPath,
const string outputCSRTestPath, const double percentage, unordered_map<string, int> &userIdMap, unordered_map<string, int> &itemIdMap) {
string line;
vector<User> users(userIdMap.size());
vector<Item> items(itemIdMap.size());
int ratingNum = 0;
ifstream fin(dataPath.c_str());
stringstream ss;
while (getline(fin, line)) {
if (line.length() == 0) {
continue;
}
ss.clear();
ss << line;
boost::property_tree::ptree pt;
boost::property_tree::read_json(ss, pt);
string user_id_str = pt.get<string>("user_id");
string business_id_str = pt.get<string>("business_id");
string score = pt.get<string>("stars");
int userID = userIdMap.find(user_id_str)->second;
int businessID = itemIdMap.find(business_id_str)->second;
users[userID].userID = userID;
users[userID].ratedItemIDs.push_back(businessID);
users[userID].ratings[businessID] = score;
items[businessID].itemID = businessID;
items[businessID].raterIDs.push_back(userID);
items[businessID].ratings[userID] = score;
ratingNum++;
}
fin.close();
cout << "rating number: " << ratingNum << endl;
vector<vector<Rating> > trainRatings(num_of_thread);
vector<vector<Rating> > testRatings(num_of_thread);
const int u_workload = users.size() / num_of_thread + ((users.size() % num_of_thread == 0) ? 0 : 1);
const int i_workload = items.size() / num_of_thread + ((items.size() % num_of_thread == 0) ? 0 : 1);
// If one user/item only has one rating, it will be assigned to training set during first or second round.
// first guarantee that each item at least appears in train set once
std::function<void(int)> func1 = [&](int thread_index) -> void {
const int i_start = i_workload * thread_index;
const int i_end = std::min(i_workload + i_start, (int) items.size());
const int local_workload = i_end - i_start;
int count = 0;
vector<Rating> &localTrainRatings = trainRatings[thread_index];
for (int i = i_start; i < i_end; i++) {
count++;
if(thread_index==0 && (count % 100==0)){
cout << "i: " << count << " of " << local_workload << endl;
}
Item &item = items[i];
unordered_map<int, string> &ratings = item.ratings;
vector<int> &raterIDs = item.raterIDs;
random_shuffle(raterIDs.begin(), raterIDs.end());
int itemID = item.itemID;
int userID = raterIDs[0];
string score = ratings[userID];
localTrainRatings.push_back(Rating(userID, itemID, score));
//remove from users
User &user = users[userID];
user.locker.lock();
user.ratedItemIDs.erase(std::remove(user.ratedItemIDs.begin(), user.ratedItemIDs.end(), itemID),
user.ratedItemIDs.end());
user.ratings.erase(itemID);
user.locker.unlock();
}
};
ThreadUtil::execute_threads(func1, num_of_thread);
// then guarantee that each user at least appears in train set once
std::function<void(int)> func2 = [&](int thread_index) -> void {
const int u_start = u_workload * thread_index;
const int u_end = std::min(u_workload + u_start, (int) users.size());
const int local_workload = u_end - u_start;
int count = 0;
vector<Rating> &localTrainRatings = trainRatings[thread_index];
for (int i = u_start; i < u_end; i++) {
count++;
if(thread_index==0 && (count % 100==0)){
cout << "u1: " << count << " of " << local_workload << endl;
}
User &user = users[i];
unordered_map<int, string> &ratings = user.ratings;
vector<int> &ratedIDs = user.ratedItemIDs;
random_shuffle(ratedIDs.begin(), ratedIDs.end());
int userID = user.userID;
int itemID = ratedIDs[0];
string score = ratings[itemID];
localTrainRatings.push_back(Rating(userID, itemID, score));
//remove from items
Item &item = items[itemID];
item.locker.lock();
item.raterIDs.erase(std::remove(item.raterIDs.begin(), item.raterIDs.end(), userID),
item.raterIDs.end());
item.ratings.erase(userID);
item.locker.unlock();
}
};
ThreadUtil::execute_threads(func2, num_of_thread);
int trainNum = 0;
for(auto localTrainRatings:trainRatings) {
trainNum += localTrainRatings.size();
}
double newPercentage = (ceil(ratingNum * percentage) - trainNum) / (ratingNum - trainNum + 0.0);
std::function<void(int)> func3 = [&](int thread_index) -> void {
const int u_start = u_workload * thread_index;
const int u_end = std::min(u_workload + u_start, (int) users.size());
const int local_workload = u_end - u_start;
vector<Rating> &localTrainRatings = trainRatings[thread_index];
vector<Rating> &localTestRatings = testRatings[thread_index];
int count = 0;
for (int u = u_start; u < u_end; u++) {
count++;
if(thread_index==0 && (count % 100==0)){
cout << "u2: " << count << " of " << local_workload << endl;
}
User &user = users[u];
vector<int> &ratedItemIDs = user.ratedItemIDs;
unordered_map<int, string> &ratings = user.ratings;
random_shuffle(ratedItemIDs.begin(), ratedItemIDs.end());
const int flag = ceil(ratedItemIDs.size() * newPercentage);
for (int i = 0; i < flag; i++) {
localTrainRatings.push_back(Rating(user.userID, ratedItemIDs[i], ratings[ratedItemIDs[i]]));
}
for (int i = flag; i < user.ratings.size(); i++) {
localTestRatings.push_back(Rating(user.userID, ratedItemIDs[i], ratings[ratedItemIDs[i]]));
}
}
};
ThreadUtil::execute_threads(func3, num_of_thread);
trainNum = 0;
int testNum = 0;
for(auto localTrainRatings:trainRatings) {
trainNum += localTrainRatings.size();
}
for(auto localTestRatings:testRatings) {
testNum += localTestRatings.size();
}
vector<Rating> globalTrainRatings;
globalTrainRatings.reserve(trainNum); // preallocate memory
for(auto localTrainRatings:trainRatings) {
globalTrainRatings.insert(globalTrainRatings.end(), localTrainRatings.begin(), localTrainRatings.end());
}
vector<Rating> globalTestRatings;
globalTestRatings.reserve(testNum); // preallocate memory
for(auto localTestRatings:testRatings) {
globalTestRatings.insert(globalTestRatings.end(), localTestRatings.begin(), localTestRatings.end());
}
// outputs
writeMatrix(globalTrainRatings, userIdMap.size(), itemIdMap.size(), outputFolder, outputMMCTrainPath, outputCSRTrainPath, "R_train_");
writeMatrix(globalTestRatings, userIdMap.size(), itemIdMap.size(), outputFolder, outputMMCTestPath, outputCSRTestPath, "R_test_");
writeMeta(outputFolder + metaPath, userIdMap.size(), itemIdMap.size(), trainNum, testNum, outputCSRTrainPath, outputCSRTestPath);
writeKeyMap(outputFolder + userIDMapPath, userIdMap);
writeKeyMap(outputFolder + itemIDMapPath, itemIdMap);
}
int main(int argc, char const *argv[]){
string outputFolder;
string ratingFilePath;
string metaPath;
string userIDMapPath;
string itemIDMapPath;
string outputMMCTrainPath;
string outputMMCTestPath;
string outputCSRTrainPath;
string outputCSRTestPath;
int filter_num;
int num_of_thread;
double percentage;
po::options_description desc("Allowed options");
desc.add_options()
("help", "produce help message")
("percentage", po::value<double>(&percentage)->default_value(0.8), "percentage of training ratings")
("num_of_thread", po::value<int>(&num_of_thread)->default_value(8), "number of threads")
("filter_num", po::value<int>(&filter_num)->default_value(5), "minimal number of ratings each user or item should have")
("rating_path", po::value<string>(&ratingFilePath)->default_value("../raw_data/yelp/yelp_training_set_review.json"), "path to rating file")
("o_folder", po::value<string>(&outputFolder)->default_value("../data/yelp/"), "path to output folder")
("meta_path", po::value<string>(&metaPath)->default_value("meta"), "name of meta file")
("user_id_map_path", po::value<string>(&userIDMapPath)->default_value("user_id_map.dat"), "name of user id map file")
("item_id_map_path", po::value<string>(&itemIDMapPath)->default_value("item_id_map.dat"), "name of item id map file")
("o_mmc_train", po::value<string>(&outputMMCTrainPath)->default_value("train.mmc"), "name of output MMC training file")
("o_mmc_test", po::value<string>(&outputMMCTestPath)->default_value("test.mmc"), "name of output MMC testing file")
("o_csr_train", po::value<string>(&outputCSRTrainPath)->default_value("train.csr"), "name of output CSR training file")
("o_csr_test", po::value<string>(&outputCSRTestPath)->default_value("test.csr"), "name of output CSR testing file");
po::variables_map vm;
po::store(po::parse_command_line(argc, argv, desc), vm);
po::notify(vm);
if (vm.count("help")) {
cout << desc << endl;
return 0;
}
srand(time(NULL));
vector<Rating> ratings;
unordered_map<string, int> userIdMap;
unordered_map<string, int> itemIdMap;
transformIds(ratingFilePath, ratings, userIdMap, itemIdMap, filter_num);
cout << "rating number: " << ratings.size() << endl;
cout << "user number: " << userIdMap.size() << endl;
cout << "bussiness number: " << itemIdMap.size() << endl;
split(num_of_thread, ratingFilePath, outputFolder, metaPath, userIDMapPath, itemIDMapPath, outputMMCTrainPath, outputMMCTestPath, outputCSRTrainPath,
outputCSRTestPath, percentage, userIdMap, itemIdMap);
return 0;
}