Why Collaborative filtering in ML Python? - Purpose & Use Cases

The Big Idea

What if your app could guess what you like before you even say it?

The Scenario

Imagine you run a small bookstore and want to recommend books to your customers. You try to remember which books each customer liked and suggest similar ones manually.

As your customers and book collection grow, keeping track of everyone's preferences becomes impossible.

The Problem

Manually tracking preferences is slow and confusing. You might forget who liked what or suggest books that don't fit their taste.

This leads to unhappy customers and lost sales because your recommendations feel random or irrelevant.

The Solution

Collaborative filtering uses data from many users to find patterns in preferences automatically.

It suggests items based on what similar users liked, making recommendations smarter and personalized without you needing to remember every detail.

Before vs After

✗ Before

if user_likes_book_A:
    recommend_book_B
else:
    recommend_book_C

✓ After

recommendations = collaborative_filtering(user_id, user_item_matrix)

What It Enables

It enables personalized recommendations at scale, delighting users with suggestions they actually want.

Real Life Example

Streaming services like Netflix use collaborative filtering to suggest movies based on what other viewers with similar tastes enjoyed.

Key Takeaways

Manual recommendations don't scale and are error-prone.

Collaborative filtering finds patterns from many users automatically.

This creates smart, personalized suggestions that improve user experience.

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