Looking for 344.086, VL Learning from User-generated Data, Markus Schedl, 2026S test answers and solutions? Browse our comprehensive collection of verified answers for 344.086, VL Learning from User-generated Data, Markus Schedl, 2026S at moodle.jku.at.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
You want to assess popularity (mis)calibration of a given recommender system using the popularity calibration metrics %Δ𝜉 ("Delta metrics") we discussed in the lecture.
The items in the interaction history Hu of user u have the following popularity estimates (e.g., total number of users who interacted with the item):
| i1 | i2 | i3 | i4 | i5 | |
| Hu | 1 | 5 | 13 | 2 | 4 |
The items in the recommendation list Ru of user u have the following popularity estimates (using the same underlying popularity definition as for Hu):
| i1 | i2 | i3 | i4 | i5 | i6 | i7 | i8 | i9 | |
| Ru | 67 | 39 | 42 | 50 | 12 | 4 | 5 | 6 | 7 |
Please calculate the popularity (mis)calibration of the recommender system for user u in terms of the %Δ𝜉 measure using the median for 𝜉 and reporting the result as percentage (like in the examples provided in the lecture).
You want to assess popularity (mis)calibration of a given recommender system using the popularity calibration metrics %Δ𝜉 ("Delta metrics") we discussed in the lecture.
The items in the interaction history Hu of user u have the following popularity estimates (e.g., total number of users who interacted with the item):
| i1 | i2 | i3 | i4 | i5 | |
| Hu | 1 | 5 | 13 | 2 | 4 |
The items in the recommendation list Ru of user u have the following popularity estimates (using the same underlying popularity definition as for Hu):
| i1 | i2 | i3 | i4 | i5 | i6 | i7 | i8 | i9 | i10 | |
| Ru | 8 | 10 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 9 |
Please calculate the popularity (mis)calibration of the recommender system for user u in terms of the %Δ𝜉 measure using the arithmetic mean for 𝜉 and reporting the result as percentage (like in the examples provided in the lecture).
Assume you are a developer for a fancy travel platform and just implemented and deployed a new hotel recommender system. It is configured to recommend 5 hotels per user based on their travel style. Your catalog is composed of 500 hotels to which the recommender system has access.
For your first (and only) two users of the system, the lists of recommended items are given below.
| u1 | u2 | |
| i1 | Domus Antea | Gianicolo Apartments |
| i2 | Relais Circo Massimo | Hotel Del Mare |
| i3 | Suite Palazzo Bonaventura | Relais Circo Massimo |
| i4 | Guest House Les Nobles | Hotel Artemis |
| i5 | Hotel Artemis | Casa Malupa |
What is the item coverage of your recommender? Provide your numeric answer in [0,1].
Assume you are a developer for a fancy travel platform and just implemented and deployed a new hotel recommender system. It is configured to recommend 5 hotels per user based on their travel style. Your catalog is composed of 500 hotels to which the recommender system has access.
For your first two users, the recommender creates the following ranked recommendation lists, which are displayed to each user. You record the hotels (items in the recommendation list) that each user clicks on to display further information and use this data as binary relevance score.
| rel(u1) | rel(u2) | |
| i1 | 0 | 0 |
| i2 | 0 | 1 |
| i3 | 0 | 1 |
| i4 | 1 | 1 |
| i5 | 0 | 1 |
What is the MRR of your recommender? Provide your answer as number in [0,1].
Interpreting the binary relevance scores as gain, what is the mean CG@4 of your recommender, i.e. the mean-averaged CG@4 scores over the two users? Provide your answer as a single number.
Assuming these two users are the only ones you have at the moment, what is the user coverage of your recommender? Provide your numeric answer in [0,1].
Consider the following user-item-rating matrix containing explicit feedback signals on a 7-point Likert-scale [1,7]. Zeros indicate unknown ratings.
| i1 | i2 | i3 | i4 | i5 | i6 | |
| u1 | 7 | 0 | 0 | 3 | 2 | 0 |
| u2 | 7 | 6 | 5 | 4 | 0 | 3 |
| u3 | 0 | 0 | 0 | 2 | 0 | 3 |
| u4 | 0 | 0 | 3 | 0 | 0 | 0 |
You want to build a memory-based User-KNN collaborative filtering recommender using Pearson correlation coefficient for user-user similarity computation.Compute user u2's rating bias.
Consider the following user-item-rating matrix containing explicit feedback signals on a 7-point Likert-scale [1,7]. Zeros indicate unknown ratings.
| i1 | i2 | i3 | i4 | i5 | i6 | |
| u1 | 7 | 0 | 0 | 3 | 2 | 0 |
| u2 | 7 | 6 | 5 | 4 | 0 | 3 |
| u3 | 0 | 0 | 0 | 2 | 0 | 3 |
| u4 | 0 | 0 | 3 | 0 | 0 | 0 |
You want to build a memory-based User-KNN collaborative filtering recommender using Pearson correlation coefficient for user-user similarity computation.Compute user u3's rating bias.
Consider the following user-item-rating matrix containing explicit feedback signals on a 7-point Likert-scale [1,7]. Zeros indicate unknown ratings.
| i1 | i2 | i3 | i4 | i5 | i6 | |
| u1 | 7 | 0 | 0 | 3 | 2 | 0 |
| u2 | 7 | 6 | 5 | 4 | 0 | 3 |
| u3 | 0 | 0 | 0 | 2 | 0 | 3 |
| u4 | 0 | 0 | 3 | 0 | 0 | 0 |
You want to build a memory-based User-KNN collaborative filtering recommender using Pearson correlation coefficient for user-user similarity computation.Compute user u1's rating bias.
F-measure is defined as the geometric mean of precision and recall.