Unit 1: Foundations of Unsupervised Learning - Practice Quiz

1 What is the primary characteristic of the data used in unsupervised learning?

2 Which learning paradigm uses a dataset containing a small amount of labeled data and a large amount of unlabeled data?

3 If a machine learning model is trained to predict house prices based on historical sales data where the final price is known, which type of learning is this?

4 In the mathematical formulation of an unsupervised learning problem, the dataset is typically represented as:

5 What is the primary objective when formulating an unsupervised learning problem?

6 How is unsupervised learning applied in market segmentation?

7 Why is market segmentation considered an unsupervised learning problem?

8 In customer behavior analysis, what does 'association rule learning' (an unsupervised method) typically discover?

9 When an e-commerce platform groups website visitors based on their browsing paths to better understand user journeys, this is an example of:

10 What is the main goal of anomaly detection in data mining?

11 Why is unsupervised learning highly suitable for detecting new, unseen types of credit card fraud?

12 In bioinformatics, clustering algorithms are often used to group genes. What is the algorithm attempting to discover?

13 In a social network, discovering tightly knit groups of friends or users who interact frequently is known as:

14 Which distance metric represents the shortest straight-line distance between two points in Euclidean space?

15 Which metric is calculated as the sum of the absolute differences of their Cartesian coordinates?

16 The formula represents which distance metric?

17 Cosine similarity measures the similarity between two vectors based on:

18 If two vectors point in exactly the same direction, their Cosine similarity is:

19 Why is the choice of distance metric crucial in an unsupervised learning algorithm like K-Means?

20 If you are clustering text documents based on word frequencies, why is Cosine similarity usually preferred over Euclidean distance?

21 A medical research facility has a dataset of 50,000 X-ray images, but only 1,000 of them have been diagnosed and tagged by expert radiologists. The facility wants to build a model to categorize the remaining images. Which learning paradigm is most appropriate for this scenario?

22 Which of the following scenarios describes a transition from a supervised learning problem to an unsupervised learning problem?

23 In contrasting learning paradigms, which fundamental characteristic distinguishes how a model's performance is typically evaluated in supervised versus unsupervised learning?

24 Let represent a dataset. Which of the following best represents a common mathematical objective in an unsupervised dimensionality reduction task?

25 In the formulation of a clustering problem, the objective is often to partition a set of observations into sets . What is the typical goal of the objective function in this context?

26 A retail brand applies a clustering algorithm to demographic and purchasing data to achieve market segmentation. What is the primary operational benefit of the output generated by this unsupervised learning task?

27 An e-commerce platform uses association rule mining, an unsupervised learning technique, to analyze customer transaction logs. Which of the following insights is most likely derived from this analysis?

28 When building an unsupervised anomaly detection system for credit card fraud, the model learns the normal distribution of transactions. How does it identify a potentially fraudulent transaction?

29 What is a significant limitation of using strictly unsupervised learning for anomaly detection in a network intrusion system?

30 Biologists are analyzing gene expression data (RNA-Seq) across different tissue samples. How can unsupervised learning help them discover new biological patterns?

31 In social network analysis, researchers apply a community detection algorithm to a graph of user interactions. What is the fundamental assumption underlying this unsupervised approach?

32 Consider two data points in a 2D space: and . What are the Euclidean distance and the Manhattan distance between point and point , respectively?

33 Which of the following scenarios best justifies the use of Cosine similarity over Euclidean distance?

34 Given two non-zero vectors and in , under what condition will the Cosine similarity between them be equal to ?

35 A dataset has two features: Age (ranging from 18 to 80) and Annual Income (ranging from $20,000 to $150,000). If a clustering algorithm uses Euclidean distance on the raw, unscaled data, what is the most likely outcome?

36 Why might a data scientist choose Manhattan distance ( norm) over Euclidean distance ( norm) when dealing with a high-dimensional dataset that contains several extreme outliers?

37 In a recommendation system, you want to cluster users based on their ratings of movies. The data is highly sparse because most users have only rated a few movies out of thousands. Which distance/similarity measure is generally most effective here, and why?

38 A routing algorithm for automated delivery drones must navigate a warehouse composed of strictly arranged parallel and perpendicular aisles. Which distance metric mathematically represents the true navigation path of the drone?

39 Assume you are clustering data using K-Means, which traditionally minimizes the within-cluster sum of squares (Euclidean distance). If you change the underlying objective to minimize the sum of absolute differences (Manhattan distance), forming the K-Medians algorithm, how does the geometric shape of the theoretical cluster boundaries shift?

40 Suppose you are comparing two sets of vectors. Set A has dense, normally distributed continuous features. Set B consists of binary feature vectors where a 1 indicates the presence of a trait. Why does the choice of distance matter fundamentally between Set A and Set B?

41 In semi-supervised learning, algorithms often rely on specific structural assumptions about the underlying data distribution to leverage unlabeled data effectively. Which of the following describes a scenario where applying semi-supervised learning is highly likely to degrade model performance compared to purely supervised learning?

42 Consider a Positive-Unlabeled (PU) learning scenario formulated to find anomalies. Under what condition can PU learning be theoretically reduced to a standard semi-supervised learning problem?

43 Transductive learning is often contrasted with inductive semi-supervised learning. Which of the following is a strict mathematical limitation of transductive Support Vector Machines (TSVMs) applied to a clustering-like formulation?

44 In latent variable models for unsupervised learning, the goal is often to maximize the log-likelihood of the observed data . Because the true posterior of the latent variables is often intractable, variational inference is used. Which inequality forms the fundamental basis for this problem formulation?

45 When formulating a centroid-based clustering algorithm (like K-Means) as an optimization problem, it is mathematically posed as minimizing the within-cluster sum of squares (WCSS). What makes finding the exact global minimum of this formulation computationally prohibitive?

46 An unsupervised anomaly detection system minimizes a reconstruction error function . If the model is an undercomplete linear autoencoder (equivalent to PCA), which of the following best describes the subspace on which projects the data to formulate the 'normal' profile?

47 In anomaly detection, particularly in fraud detection systems using distance-based unsupervised methods, the phenomenon of 'swamping' occurs. How is 'swamping' mathematically defined or observed in this context?

48 When applying unsupervised learning for pattern discovery in biological data (e.g., gene expression microarrays), 'biclustering' is often preferred over standard clustering. What specific problem formulation makes biclustering uniquely suited for this use case?

49 A bank uses K-means for market segmentation based on continuous customer behavioral features. To evaluate the quality of the unsupervised segmentation, the data science team uses the Silhouette Coefficient. In which of the following edge cases will the Silhouette Coefficient misleadingly report a near-zero or negative score despite the clusters being perfectly separated?

50 In customer behavior analysis, sequential pattern mining (e.g., PrefixSpan) is used to find frequent subsequences of purchases. If a transaction dataset has a very high diversity of items but short transaction lengths, why might an unsupervised frequent itemset mining algorithm like Apriori fail computationally while a sequential pattern approach is required?

51 When building an autoencoder for fraud detection on credit card transactions, the training dataset consists exclusively of 'normal' transactions. If the autoencoder is designed with a massive latent dimension (overcomplete) without proper regularization, what will be the expected outcome during inference on real-world data containing fraud?

52 Let and be two real-valued feature vectors representing text documents. If and are both strictly -normalized such that and , what is the exact mathematical relationship between their squared Euclidean distance and their Cosine similarity ?

53 According to the phenomenon associated with the 'curse of dimensionality' in distance metric spaces, as the dimensionality , what happens to the ratio for a given query point (where and are the maximum and minimum distances to other points)?

54 A data scientist is designing a custom clustering algorithm using 'Cosine Distance', defined as . They intend to use a metric tree (e.g., Ball Tree) to speed up neighbor searches. Why will this approach fundamentally fail or yield incorrect optimizations?

55 When performing clustering on high-dimensional data, researchers sometimes prefer fractional distance metrics ( norm where ) over standard Euclidean () or Manhattan () metrics. What is the primary theoretical justification for this choice?

56 In a dataset with highly correlated features with differing variances, standard Euclidean distance often creates skewed, elongated clusters. A common mitigation is to use the Mahalanobis distance. Which of the following data preprocessing steps followed by standard Euclidean distance is mathematically equivalent to computing the Mahalanobis distance on the original data?

57 Consider the Minkowski distance metric . As the parameter approaches infinity (), which widely known distance metric does this equation mathematically converge to?

58 Why is Cosine similarity typically preferred over Euclidean distance when analyzing document similarity using TF-IDF (Term Frequency-Inverse Document Frequency) vectors?

59 If an unsupervised algorithm relies on updating cluster centroids using the arithmetic mean of the assigned points, but uses Cosine similarity for assignments (e.g., Spherical K-Means), what critical adjustment must be made to the centroid update step to maintain mathematical consistency?

60 A dataset contains features representing specific geolocational grids in a city, where travel is strictly limited to an orthogonal street network. If one attempts to use Euclidean distance to cluster optimal distribution hubs, what specific topological error is being introduced?