Collaborative filtering in ML Python - Model Pipeline Trace

Model Pipeline - Collaborative filtering

Collaborative filtering helps recommend items to users by learning from their past preferences and the preferences of similar users.

Data Flow - 5 Stages

1Raw user-item ratings

1000 users x 500 items→Collect user ratings for items (e.g., movies, products)→1000 users x 500 items

User 1 rated Movie A: 4 stars, Movie B: 5 stars; User 2 rated Movie A: 3 stars

↓

2Data preprocessing

1000 users x 500 items→Fill missing ratings with zeros or average ratings→1000 users x 500 items

Missing rating for User 3 on Movie C replaced with 0

↓

3Matrix factorization

1000 users x 500 items→Decompose rating matrix into user and item feature matrices→User features: 1000 x 20, Item features: 500 x 20

User 1 features: [0.2, 0.5, ..., 0.1], Movie A features: [0.3, 0.7, ..., 0.4]

↓

4Model training

User features: 1000 x 20, Item features: 500 x 20→Optimize features to minimize difference between predicted and actual ratings→Trained user and item feature matrices

User 1 and Movie A features adjusted to predict rating close to 4 stars

↓

5Prediction

User features: 1 x 20, Item features: 1 x 20→Calculate predicted rating by dot product of user and item features→Predicted rating scalar

Predicted rating for User 1 on Movie C: 3.8 stars

Training Trace - Epoch by Epoch

Loss
0.9 |*       
0.8 |**      
0.7 |**      
0.6 |***     
0.5 |****    
0.4 |*****   
0.3 |******  
0.2 |******* 
    +--------
     1 5 10 15 Epochs

Epoch	Loss ↓	Accuracy ↑	Observation
1	0.85	N/A	Initial loss is high as model starts learning user-item patterns
5	0.45	N/A	Loss decreases as model improves rating predictions
10	0.30	N/A	Loss continues to decrease, model converging
15	0.25	N/A	Loss stabilizes, model has learned meaningful features

Prediction Trace - 4 Layers

Layer 1: User feature vector extraction

Layer 2: Item feature vector extraction

Layer 3: Dot product calculation

Layer 4: Rating prediction output

Model Quiz - 3 Questions

What does the matrix factorization step do in collaborative filtering?

A It breaks down the user-item rating matrix into smaller feature matrices

B It removes missing ratings from the dataset

C It directly predicts the final ratings without training

D It collects raw user ratings from the database

Key Insight

Collaborative filtering uses patterns in user-item interactions to predict preferences, learning hidden features that represent users and items. This helps recommend items users might like based on similar users' tastes.

Practice

1. What is the main idea behind collaborative filtering in recommendation systems?

easy

A. It recommends items based on the user's location.

B. It recommends items based on similar users' preferences.

C. It randomly suggests items without user data.

D. It uses item descriptions to recommend similar items.

Solution

1. Step 1: Understand collaborative filtering concept

   Collaborative filtering finds users with similar tastes and recommends items they liked.

2. Step 2: Compare options to definition

   Only It recommends items based on similar users' preferences. matches this idea; others describe different methods or unrelated ideas.

3. Final Answer:

   It recommends items based on similar users' preferences. -> Option B

4. Quick Check:

   Collaborative filtering = similar users' preferences [OK]

Hint: Focus on user similarity for collaborative filtering [OK]

Common Mistakes:

• Confusing collaborative filtering with content-based filtering
• Thinking it uses item descriptions only
• Assuming it recommends randomly

2. Which of the following is the correct way to compute cosine similarity between two user vectors u and v in Python using NumPy?

easy

A. np.dot(u, v) * (np.linalg.norm(u) + np.linalg.norm(v))

B. np.dot(u, v) * (np.linalg.norm(u) * np.linalg.norm(v))

C. np.dot(u, v) / (np.linalg.norm(u) + np.linalg.norm(v))

D. np.dot(u, v) / (np.linalg.norm(u) * np.linalg.norm(v))

Solution

1. Step 1: Recall cosine similarity formula

   Cosine similarity = dot product of vectors divided by product of their norms.

2. Step 2: Match formula to code

   np.dot(u, v) / (np.linalg.norm(u) * np.linalg.norm(v)) correctly implements this formula using NumPy functions.

3. Final Answer:

   np.dot(u, v) / (np.linalg.norm(u) * np.linalg.norm(v)) -> Option D

4. Quick Check:

   Cosine similarity formula = np.dot(u, v) / (np.linalg.norm(u) * np.linalg.norm(v)) [OK]

Hint: Cosine similarity = dot product ÷ product of norms [OK]

Common Mistakes:

• Adding norms instead of multiplying
• Multiplying dot product by norms
• Dividing by sum of norms

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)

medium

A. 2.5

B. 1.9

C. 1.3

D. 3.0

Solution

1. Step 1: Calculate weighted sum of ratings

   Weighted sum = (0.9 * 1) + (0.1 * 4) = 0.9 + 0.4 = 1.3

2. Step 2: Calculate sum of weights and divide

   Sum weights = 0.9 + 0.1 = 1.0; Predicted rating = 1.3 / 1.0 = 1.3

3. Final Answer:

   1.3 -> Option C

4. Quick Check:

   Weighted average = 1.3 [OK]

Hint: Multiply ratings by similarity, sum, then divide by total similarity [OK]

Common Mistakes:

• Forgetting to divide by sum of weights
• Mixing up user similarities
• Using unweighted average

4. You have this Python code snippet for item-based collaborative filtering similarity calculation:

import numpy as np

item1 = np.array([5, 3, 0])
item2 = np.array([4, 0, 1])
similarity = np.dot(item1, item2) / (np.linalg.norm(item1) + np.linalg.norm(item2))
print(similarity)

What is the error in this code?

medium

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

1. Step 1: Review cosine similarity formula

   Cosine similarity divides dot product by product of norms, not sum.

2. Step 2: Identify code mistake

   Code uses addition in denominator instead of multiplication, causing wrong similarity value.

3. Final Answer:

   Using addition instead of multiplication in denominator for cosine similarity. -> Option A

4. 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

1. Step 1: Understand sparsity problem in collaborative filtering

   Sparse matrices have many missing values, making similarity calculations unreliable.

2. Step 2: Identify best method to handle sparsity

   Matrix factorization like SVD reduces dimensionality and predicts missing ratings effectively.

3. Final Answer:

   Use matrix factorization techniques like Singular Value Decomposition (SVD). -> Option A

4. 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