Why unsupervised learning finds hidden patterns in ML Python - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why does unsupervised learning find hidden patterns?

Unsupervised learning algorithms analyze data without labeled answers. Why can they find hidden patterns in data?

A Because they group or organize data based on similarities or structures found within the data

B Because they predict future values based on past labeled examples

C Because they randomly assign categories without analyzing data

D Because they use labels to guide the learning process

💡 Hint

Think about how the algorithm looks for natural groupings or structures in data without any external guidance.

Unsupervised learning finds hidden patterns by grouping or organizing data points based on their similarities or underlying structures, without needing labeled outputs.

❓ Predict Output

intermediate

Output of K-means clustering on simple data

What is the output cluster assignment for the points after running K-means with 2 clusters?

ML Python

from sklearn.cluster import KMeans
import numpy as np

points = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
kmeans = KMeans(n_clusters=2, random_state=0).fit(points)
labels = kmeans.labels_
print(labels.tolist())

A [1, 1, 1, 0, 0, 0]

B [1, 0, 1, 0, 1, 0]

C [0, 1, 0, 1, 0, 1]

D [0, 0, 0, 1, 1, 1]

💡 Hint

Look at how points are grouped by their x-coordinate values.

K-means groups points into clusters based on distance. Points near (1, y) form one cluster (label 0), points near (10, y) form the other (label 1).

❓ Model Choice

advanced

Best unsupervised model for dimensionality reduction

You want to reduce the number of features in your dataset while preserving important information. Which unsupervised model is best suited for this?

A Principal Component Analysis (PCA)

B K-means clustering

C Linear Regression

D Decision Tree

💡 Hint

Think about which method transforms data into fewer dimensions while keeping most variance.

PCA reduces dimensionality by finding new features (principal components) that capture most of the data's variance without labels.

❓ Metrics

advanced

Evaluating clustering quality without labels

Which metric can be used to evaluate the quality of clusters found by an unsupervised algorithm when no true labels are available?

A Accuracy score

B Silhouette score

C Mean squared error

D Cross-entropy loss

💡 Hint

Look for a metric that measures how well-separated and compact clusters are without needing labels.

Silhouette score measures how similar an object is to its own cluster compared to other clusters, useful without labels.

🔧 Debug

expert

Why does this PCA code raise an error?

What error does the following PCA code raise and why?

ML Python

from sklearn.decomposition import PCA
import numpy as np

X = np.array([[1, 2], [3, 4], [5, 6]])
pca = PCA(n_components=4)
pca.fit(X)

A AttributeError: 'PCA' object has no attribute 'fit'

B TypeError: n_components must be an integer

C ValueError: n_components must be between 0 and min(n_samples, n_features) inclusive

D No error, code runs successfully

💡 Hint

Check the number of components requested versus the shape of the data.

PCA cannot have more components than the smaller dimension of the data (samples or features). Here, n_components=4 is too large for data with shape (3,2).

Practice

1. What is the main reason unsupervised learning can find hidden patterns in data?

easy

A. It removes noise from data using labels

B. It uses labeled data to predict outcomes

C. It groups data based on similarities without needing labels

D. It requires human input to label data first

Solution

1. Step 1: Understand unsupervised learning basics

   Unsupervised learning works without labeled data, so it cannot predict outcomes but can find structure.

2. Step 2: Identify how patterns are found

   It groups or clusters data points based on their features, revealing hidden patterns without labels.

3. Final Answer:

   It groups data based on similarities without needing labels -> Option C

4. Quick Check:

   Unsupervised = grouping without labels [OK]

Hint: Unsupervised means no labels, so it groups data [OK]

Common Mistakes:

• Thinking labels are needed to find patterns
• Confusing unsupervised with supervised learning
• Assuming it predicts outcomes

2. Which of the following is the correct syntax to create a KMeans clustering model in Python using scikit-learn?

easy

A. model = KMeans(n_clusters=3)

B. model = KMeans(3_clusters)

C. model = KMeans(clusters=3)

D. model = KMeans(n_cluster=3)

Solution

1. Step 1: Recall scikit-learn KMeans syntax

   The correct parameter to set number of clusters is n_clusters.

2. Step 2: Match options with correct syntax

   model = KMeans(n_clusters=3) uses n_clusters=3, which is correct. Others have wrong parameter names.

3. Final Answer:

   model = KMeans(n_clusters=3) -> Option A

4. Quick Check:

   Correct parameter is n_clusters [OK]

Hint: Remember: n_clusters sets cluster count in KMeans [OK]

Common Mistakes:

• Using wrong parameter names like clusters or n_cluster
• Missing the equals sign
• Confusing parameter order

3. What will be the output clusters for the following code snippet?

from sklearn.cluster import KMeans
import numpy as np
X = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
model = KMeans(n_clusters=2, random_state=0)
model.fit(X)
print(model.labels_)

medium

A. [1 1 1 0 0 0]

B. [1 0 1 0 1 0]

C. [0 1 0 1 0 1]

D. [0 0 0 1 1 1]

Solution

1. Step 1: Understand data points and clusters

   Points are grouped near (1, x) and (10, x). KMeans with 2 clusters will separate these two groups.

2. Step 2: Check cluster labels assigned by KMeans

   KMeans assigns label 0 to first cluster and 1 to second. Points near (1, x) get label 0, near (10, x) get label 1.

3. Final Answer:

   [0 0 0 1 1 1] -> Option D

4. Quick Check:

   Clusters separate by position [OK]

Hint: Clusters group close points; labels start at 0 [OK]

Common Mistakes:

• Assuming labels start at 1
• Mixing cluster assignments
• Ignoring random_state effect

4. Identify the error in this unsupervised learning code snippet:

from sklearn.cluster import KMeans
X = [[1, 2], [3, 4], [5, 6]]
model = KMeans(n_clusters=2)
model.fit(X)
print(model.labels_)

medium

A. No error, code runs correctly

B. Missing random_state parameter in KMeans

C. X should be a numpy array, not a list

D. model.labels_ should be model.predict(X)

Solution

1. Step 1: Check data type requirements

   KMeans accepts lists or numpy arrays, so list input is valid.

2. Step 2: Verify code correctness

   random_state is optional; model.labels_ is valid after fit. Code runs without error.

3. Final Answer:

   No error, code runs correctly -> Option A

4. Quick Check:

   List input and labels_ usage are valid [OK]

Hint: KMeans accepts lists; labels_ valid after fit [OK]

Common Mistakes:

• Thinking list input causes error
• Confusing labels_ with predict()
• Assuming random_state is mandatory

5. You have a dataset with no labels and want to find groups of similar customers. Which unsupervised learning method and approach best fits this goal?

hard

A. Use supervised neural networks with labeled data

B. Use KMeans clustering to group customers by feature similarity

C. Use decision trees to classify customers into known categories

D. Use linear regression to predict customer spending

Solution

1. Step 1: Identify problem type

   Dataset has no labels, so supervised methods like regression or classification won't work.

2. Step 2: Choose suitable unsupervised method

   KMeans clustering groups data points by similarity, ideal for finding customer groups without labels.

3. Final Answer:

   Use KMeans clustering to group customers by feature similarity -> Option B

4. Quick Check:

   No labels means clustering fits best [OK]

Hint: No labels? Use clustering like KMeans [OK]

Common Mistakes:

• Trying supervised methods without labels
• Confusing regression with clustering
• Ignoring data labeling requirement