Skip to content
This repository was archived by the owner on Sep 2, 2025. It is now read-only.

Commit e0218f0

Browse files
adding presentation and very minor readme edit
1 parent d5f611a commit e0218f0

File tree

2 files changed

+5
-5
lines changed

2 files changed

+5
-5
lines changed

assignment3/README.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ recommendations in each iteration.
1919

2020
## Running the script
2121

22-
- User needs to provide path to the MovieLens 100K ratings dataset when calling the script. Usage:
22+
- User needs to provide path to the MovieLens 100K ratings dataset when calling the script. Call the script inside the `assignment3` directory. Usage:
2323

2424
```python
2525
python assignment3.py <path/to/ml-latest-small/ratings.csv>
@@ -78,13 +78,13 @@ Group recommendations combine the recommendations of each user in a group into o
7878
In average aggregation all members are considered equals. So, the rating of an item for a group of users will be given be averaging the scores of an item across all group members. The movie $i$ group score is equal to the average of predicted ratings for all the group $g$ members, i.e.:
7979

8080
$$
81-
avg\_score_g(i) = \frac{ \sum_{u \in g}{\hat{r_{ui}}} }{|g|}
81+
avg\_score_g(i) = \frac{ \sum_{u \in g}{\hat{r_{u,i}}} }{|g|}
8282
$$
8383

84-
where $r_{ui}$ is the predicted rating for user $u$ item $i$. The problem with this logic is that the outlier (someone with a really high or low score) will never be satisfied. This is implemented in the `assignment3/assignment2.py/average_aggregate` function.
84+
where $r_{u,i}$ is the predicted rating for user $u$ item $i$. The problem with this logic is that the outlier (someone with a really high or low score) will never be satisfied. This is implemented in the `assignment3/assignment2.py/average_aggregate` function.
8585

8686
In least misery aggregation can act as a veto for the rest of the group. In this case, the rating of an item for a group of users is computed as the minimum score assigned to that item in all group members recommendations. The movie $i$ group score is the smallest score any member of the group $g$ has given as a rating $r_{ui}$, i.e.:
87-
$$ least\_score_g(i) = \min_{u \in g}{\hat{r_{ui}}} $$
87+
$$ least\_score_g(i) = \min_{u \in g}{\hat{r_{u,i}}} $$
8888
As one might predict, the recommended movies are unlikely to ilicit strong reactions, either positive or negative. This is implemented in the `assignment3/assignment2.py/least_misery_aggregate` function.
8989

9090
#### **Sequential Hybrid Aggregation Model**
@@ -186,4 +186,4 @@ Movie number: 1193, Predicted rating: 3.13
186186

187187
### Prepare also a short presentation (about 5 slides) to show how your method works (Score: 10%)
188188

189-
This presentation can be found in our repository `assignment3/asg3_presentation.pdf`.
189+
This presentation can be found in our repository `assignment3/asg3_presentation.pdf`/`assignment3/asg3_presentation.pdf`.

assignment3/asg3_presentation.pdf

89.8 KB
Binary file not shown.

0 commit comments

Comments
 (0)