Kvíz spojený s průvodcem · Střední úroveň

Distance Metrics in Machine Learning Quiz

Tests how Euclidean, Manhattan, cosine, Mahalanobis, and Hamming distances encode similarity, and why feature scaling can change nearest-neighbor results.

Související vodicí cestyDistance Metrics In Machine Learning
Otázka 1 z 8

Why did the delivery routing example choose Manhattan distance over Euclidean distance?

Náhled každé otázky8 otázky

Odpovědi a vysvětlení se zobrazují, jak budete v kvízu.

  1. Why did the delivery routing example choose Manhattan distance over Euclidean distance?
    • Because vehicles must travel along street grids rather than in straight lines
    • Because Manhattan distance is always more accurate
    • Because Manhattan distance requires less computation for any dataset
    • Because Euclidean distance cannot handle numeric data
  2. What does cosine distance measure, as defined in the guide, that makes it suited to recommendation systems?
    • The absolute difference in rating counts
    • The number of matching categorical labels
    • The angle between two vectors rather than their magnitude
    • The square of the Euclidean distance
  3. What additional information does Mahalanobis distance incorporate that Euclidean distance does not?
    • The alphabetical order of feature names
    • The correlations and differing variances between features via the covariance matrix
    • The total number of rows in the dataset
    • The categorical labels of each point
  4. For what type of data is Hamming distance specifically suited, according to the guide?
    • Continuous numeric data with large ranges
    • Only image pixel data
    • Only time-series financial data
    • Equal-length categorical or string data, such as genetic sequences
  5. What preprocessing step does the guide say is typically required before computing Euclidean distance across features?
    • Removing all categorical variables
    • Standardizing or scaling the features so no single feature dominates
    • Converting all features to Hamming-compatible strings
    • Reducing the dataset to two dimensions only
  6. What phenomenon does the guide describe that undermines the assumption that Euclidean distance is always a safe default?
    • Přetahování
    • Gradient vanishing
    • The curse of dimensionality, where pairwise distances become similar in high dimensions
    • Únik štítku
  7. How is cosine distance computed, per the technical section?
    • As one minus the cosine similarity, the normalized dot product of two vectors
    • As the sum of absolute differences per dimension
    • As the square root of the covariance matrix
    • As the count of mismatched positions between two vectors
  8. According to the futureOutlook section, how does metric learning relate to distance metrics in modern deep learning systems?
    • It eliminates the need for any distance function
    • It only applies to Manhattan distance
    • It replaces Hamming distance in all genetic applications
    • A neural network learns an embedding space where a classical distance, like cosine or Euclidean, becomes meaningful after training