3. Given the user-item rating matrix below, what is the predicted rating for User 1 on Item C using user-based collaborative filtering with cosine similarity?
User 1: [5, 3, ?] User 2: [4, 2, 1] User 3: [1, 5, 4]
Assume similarity weights are: User 1 & User 2: 0.9 User 1 & User 3: 0.1
Use weighted average: (0.9*1 + 0.1*4) / (0.9 + 0.1)
A. Using addition instead of multiplication in denominator for cosine similarity.
B. Using np.dot instead of np.cross for similarity.
C. Missing normalization of item vectors before dot product.
D. Using zero values in vectors causes division by zero.
Solution
Step 1: Review cosine similarity formula
Cosine similarity divides dot product by product of norms, not sum.
Step 2: Identify code mistake
Code uses addition in denominator instead of multiplication, causing wrong similarity value.
Final Answer:
Using addition instead of multiplication in denominator for cosine similarity. -> Option A
Quick Check:
Denominator must multiply norms, not add [OK]
Hint: Denominator in cosine similarity = product of norms, not sum [OK]
Common Mistakes:
Adding norms instead of multiplying
Confusing dot and cross product
Assuming zero values cause errors
5. You want to improve a movie recommendation system using collaborative filtering. The user-item matrix is very sparse (many missing ratings). Which approach can best handle this sparsity to improve recommendations?
hard
A. Use matrix factorization techniques like Singular Value Decomposition (SVD).
B. Fill missing ratings with zeros before computing similarities.
C. Ignore users with missing ratings and use only complete data.
D. Use random recommendations to cover missing data.
Solution
Step 1: Understand sparsity problem in collaborative filtering
Sparse matrices have many missing values, making similarity calculations unreliable.
Step 2: Identify best method to handle sparsity
Matrix factorization like SVD reduces dimensionality and predicts missing ratings effectively.
Final Answer:
Use matrix factorization techniques like Singular Value Decomposition (SVD). -> Option A
Quick Check:
SVD handles sparsity well [OK]
Hint: Use matrix factorization to predict missing ratings [OK]
Common Mistakes:
Filling missing ratings with zeros biases similarity
Ignoring incomplete users loses valuable data
Random recommendations ignore user preferences
Recommended
Ready to prove it?
Pass the test and this pattern moves unknownstrongwhile earning +1 Grip toward your certificate.