FRM Part I · FRM Exam Part I · Machine Learning and Prediction
A K-means model is fitted to bond data with features of duration (range 1 to 20 years) and bond price volatility expressed in basis points (range 50 to 5,000). No preprocessing is applied. What is the most likely problem?
The volatility feature will dominate. K-means relies on Euclidean distance, which is scale-sensitive, so the variable with the much larger numeric range (basis points) drives cluster assignments. Standardizing features before clustering prevents this distortion.
- AThe algorithm will fail to converge because the features have different units
- BThe volatility feature will dominate the Euclidean distance, so clusters mainly reflect volatilityCorrect
- CDuration will dominate because it is measured in years
- DK-means will automatically rescale features, so there is no problem
Explanation
K-means uses Euclidean distance, which is sensitive to scale. The feature with the much larger numeric range contributes most of the squared distance, so the basis-point volatility dominates. Standardizing the features fixes this.
Did you get it right without looking?
One question tells you little. A timed set on Machine Learning and Prediction shows your real accuracy, how long you take and where you lose marks.
More Machine Learning and Prediction questions
- Compared with a regression using all original predictors, a principal components regression (PCR) that uses the first few components has whi…
- A risk team has transaction data for 50,000 corporate clients with no labels. They run k-means to group clients with similar trading behavio…
- A risk analyst fits a linear model to predict loan losses using 60 correlated explanatory variables and only 120 observations. The analyst w…
- A quantitative analyst fits a very flexible model to 500 observations. It achieves a training mean squared error of 0.2 but a test mean squa…
- A single neuron receives inputs x1 = 2 and x2 = -1 with weights w1 = 0.5 and w2 = 1.5 and bias b = 0.5. It uses a ReLU activation, f(z) = ma…
- A node in a classification tree holds 100 observations: 50 defaults and 50 non-defaults. A candidate split sends 40 observations left (35 de…