Quantitative Techniques & Data Literacy

Chapter 12
Multivariate Analytics and Machine Learning

Graduate Program in Business Administration (GBA)
Quantitative Techniques & Data Literacy   •   Graduate

Multivariate Analytics and Machine Learning

Introduction and Context

Modern business decisions rarely depend on one variable. Customer profitability may depend simultaneously on spending, channel use, service contacts, tenure, risk, and response to promotions. A supply-chain manager may need to evaluate demand, lead time, inventory, supplier reliability, and transport cost together. Multivariate analytics provides methods for studying several variables simultaneously, while machine learning extends these methods toward automated prediction, pattern recognition, and decision support.

The central managerial challenge is not simply to obtain a high-performing model. A useful model must address a well-defined decision problem, use credible data, perform adequately on new cases, be interpretable enough for its purpose, and avoid unfair or harmful consequences. Statistical significance, predictive accuracy, and managerial usefulness are related but distinct criteria.

This chapter examines segmentation, cluster analysis, principal component analysis, classification, and predictive modelling. It also evaluates validation, overfitting, interpretability, fairness, governance, and implementation.

Learning Objectives

By the end of this chapter, students should be able to:

  1. Distinguish descriptive, explanatory, predictive, and prescriptive uses of multivariate analytics.
  2. Select and prepare variables for segmentation and cluster analysis.
  3. Explain principal component analysis and interpret its outputs.
  4. Compare classification and predictive models for business applications.
  5. Evaluate models using appropriate validation metrics.
  6. Diagnose overfitting, leakage, instability, and data-quality problems.
  7. Assess interpretability, fairness, privacy, governance, and managerial usefulness.
  8. Translate analytical results into responsible business decisions.

1. The Multivariate Analytics Perspective

Univariate analysis studies one variable; bivariate analysis studies relationships between two variables. Multivariate analysis considers several variables jointly. A data set can be represented as a matrix X \in \mathbb{R}n \times p, where n is the number of observations and p is the number of variables. The element xij is the value of variable j for observation i.

Different analytical objectives require different methods:

ObjectiveTypical questionCommon methods
DescriptionWhat patterns exist?Profiling, visualization, dimension reduction
SegmentationWhich observations are similar?k-means, hierarchical clustering
ExplanationWhich factors are associated with an outcome?Regression, generalized linear models
PredictionWhat is likely to happen next?Regression, trees, ensembles, neural networks
ClassificationWhich category will apply?Logistic regression, trees, support vector machines
PrescriptionWhat action should be taken?Optimization, causal analysis, decision rules

Association is not automatically causation. A model can predict an outcome without identifying a causal mechanism. For example, a customer’s number of service calls may predict churn because dissatisfaction causes both; it may also reflect an unobserved problem. Managers should not interpret a predictive feature as a proven intervention lever without causal evidence.

Data preparation

Before modelling, analysts should define the unit of analysis, outcome, time horizon, observation window, and decision point. Common preparation tasks include:

  • correcting inconsistent units and categories;
  • identifying duplicates and impossible values;
  • treating missingness explicitly;
  • encoding categorical variables;
  • scaling variables when distance or variance matters;
  • separating training, validation, and test data;
  • documenting data provenance and transformations.

For a variable with mean \bar{x} and standard deviation sx, a common standardization is:

zi = (xi - x̄) / sx

Here, xi is an observed value, \bar{x} is the sample mean, and sx is the sample standard deviation. The transformed value is dimensionless. Standardization is useful when variables measured in dollars, counts, and days are combined in distance-based methods. It should be calculated using training data only when the purpose is out-of-sample prediction; otherwise information from the test set can leak into the model.

Missing data require judgement. Mean imputation is simple but reduces variation and can distort relationships. Multiple imputation, model-based methods, missingness indicators, or explicit “unknown” categories may be preferable depending on the mechanism of missingness and the decision context. Missingness itself may carry operational information, but using it can also reproduce administrative bias.

2. Segmentation and Cluster Analysis

Segmentation divides a population into groups that are internally similar and meaningfully different from one another. In marketing, segments may represent customer needs; in operations, supplier profiles; in human resources, workforce patterns. Segmentation is descriptive and exploratory unless supported by a clear decision rule and subsequent validation.

Similarity and distance

For two observations with p numeric variables, Euclidean distance is:

d(xi, xj) = √[∑k=1p(xik - xjk)²]

The variables must be comparable after considering scale, units, and substantive meaning. Squared Euclidean distance gives greater influence to large differences. Manhattan distance is:

d1(xi, xj) = ∑k=1p|xik - xjk|

The choice of distance is not merely technical. If one variable is measured in large monetary units and another in small counts, unscaled Euclidean distance may make the monetary variable dominate. Correlated variables can also give one underlying construct disproportionate influence.

For categorical data, matching or other appropriate dissimilarities may be preferable. Mixed data may require methods such as Gower dissimilarity rather than blindly applying Euclidean distance.

k-means clustering

The k-means algorithm assigns observations to k clusters and seeks to minimize within-cluster squared distance:

J = ∑r=1k ∑xi ∈ Cr ||xi - μr||²

Here, Cr is cluster r, μr is its centroid, and J is the within-cluster sum of squares. The algorithm iterates between assigning each observation to its nearest centroid and recomputing centroids until assignments stabilize or improvement becomes negligible.

K-means assumes that variables are numeric, a mean is meaningful, clusters are reasonably compact, and the selected distance is appropriate. It is sensitive to outliers, starting values, scaling, and the chosen number of clusters. Multiple random starts are therefore advisable.

The number of clusters can be informed by the elbow method, silhouette analysis, stability across samples, and—most importantly—managerial interpretability. The average silhouette coefficient for an observation compares its average distance from its own cluster with the lowest average distance from another cluster. Values near 1 suggest good separation, values near 0 suggest overlap, and negative values may indicate inappropriate assignment. No single statistic proves that a segmentation is useful.

Hierarchical clustering

Hierarchical clustering creates a nested tree of groups, called a dendrogram. Agglomerative methods begin with each observation as its own cluster and successively merge clusters. Linkage rules include:

  • single linkage: minimum pairwise distance;
  • complete linkage: maximum pairwise distance;
  • average linkage: average pairwise distance;
  • Ward’s method: merge choice based on the increase in within-cluster variation.

A dendrogram allows the analyst to inspect several possible numbers of clusters. However, early merges cannot usually be undone, and the result depends on distance and linkage choices.

From statistical clusters to actionable segments

A statistically distinct cluster is not automatically a managerial segment. A useful segment should be identifiable, substantial enough to serve, reachable through an intervention or channel, stable over time, and responsive to a differentiated strategy. Analysts should profile clusters using variables not used to create them, test their stability, and avoid labels that imply unsupported psychological or moral claims.

3. Principal Component Analysis

Principal component analysis (PCA) reduces a set of correlated variables to a smaller number of uncorrelated linear combinations called principal components. It is useful for visualization, noise reduction, index construction, and reducing multicollinearity. PCA is not, by itself, a causal model or a guaranteed improvement in prediction.

Suppose the centred data matrix is Xc. Its sample covariance matrix is:

S = (1 / (n - 1)) XcᵀXc

The first principal component direction w1 is the unit vector that maximizes the variance of the projected data:

maxw wᵀ S w subject to wᵀw = 1

The solution is the eigenvector associated with the largest eigenvalue λ1 of S. The first component score for observation i is the projection of its centred vector onto that direction:

PCi1 = xc,iᵀ w1

Subsequent components are orthogonal to previous components and maximize the remaining variance. The total variance is the sum of the eigenvalues. The proportion of variance explained by component j is:

PVEj = λj / ∑l=1p λl

PCA may be based on the covariance matrix when variables have comparable units and meaningful absolute variances. It is commonly based on the correlation matrix, equivalent to standardizing variables first, when scales differ substantially. The choice should be justified rather than automatic.

Interpretation

A loading is the association between an original variable and a component, subject to the chosen convention and scaling. Large loadings can help describe a component, but a component is a mathematical direction, not necessarily a latent construct. Signs are arbitrary: multiplying a component by −1 leaves its explanatory content unchanged. Components should be named cautiously and validated substantively.

PCA can improve model efficiency when many predictors are correlated, but transformed components may be less interpretable than original variables. If the business decision requires a transparent reason code, direct variables or a sparse, constrained alternative may be preferable.

4. Classification and Predictive Models

Classification predicts a categorical outcome, such as churn versus retention or approved versus declined. Regression predicts a numeric outcome, such as revenue, demand, or delivery time. The target, prediction horizon, and cost of errors should be specified before model selection.

Linear and logistic regression

A multiple linear regression model is:

yi = β0 + β1xi1 + ··· + βpxip + εi

Here, yi is the outcome, xij are predictors, βj are coefficients, β0 is the intercept, and εi is an error term. Ordinary least squares estimates coefficients by minimizing the sum of squared residuals:

SSE = ∑i=1n(yi - ŷi)²

The classical inferential interpretation relies on assumptions such as correct functional form, independent observations, appropriate error behaviour, and no perfect multicollinearity. Prediction can remain useful when some inferential assumptions are imperfect, but performance must be evaluated honestly.

For binary classification, logistic regression models the log-odds of class 1:

log[pi / (1 - pi)] = β0 + β1xi1 + ··· + βpxip

where pi = P(Yi = 1 | xi). The probability is obtained through the logistic function:

pi = 1 / (1 + e-ηi)

where ηi is the linear predictor. Holding other variables constant, eβj is the multiplicative change in the odds associated with a one-unit increase in xj, under the model specification. This is not the same as a one-unit change in probability.

Decision trees and ensembles

A decision tree recursively partitions observations according to predictor thresholds. For classification, a common impurity measure is the Gini index:

G = 1 - ∑c=1C pc²

where pc is the proportion of cases in class c within a node. A pure node has Gini index 0. Trees capture nonlinearities and interactions and are easy to communicate as rules, but deep trees can overfit.

Random forests average many trees built from resampled observations and random subsets of variables. Gradient boosting builds trees sequentially, with later trees focusing on errors made by earlier ones. These ensembles often achieve strong predictive performance but can be harder to explain, more computationally demanding, and sensitive to data drift. Hyperparameters should be selected using validation procedures rather than tuned on the final test set.

Regularization

Regularization constrains model complexity. Ridge regression minimizes:

SSE + λ∑j=1pβj²

Lasso regression minimizes:

SSE + λ∑j=1p|βj|

Here, λ ≥ 0 controls the penalty. The intercept is usually not penalized. Ridge tends to shrink correlated coefficients together; lasso can set some coefficients exactly to zero. Both require appropriate scaling for comparable penalties. The penalty parameter must be selected using training data and cross-validation. Regularization improves generalization in many settings but does not automatically produce causal or fair models.

5. Model Evaluation and Validation

A model should be evaluated on data representing future use, not merely on the observations used to fit it. A basic split consists of training data for fitting, validation data for model selection, and a test set for final assessment. Time-dependent problems should generally use time-ordered splits rather than random shuffling.

Regression metrics

Mean absolute error is:

MAE = (1/n)∑i=1n|yi - ŷi|

It is expressed in the outcome’s units and is less sensitive to extreme errors than squared-error metrics. Root mean squared error is:

RMSE = √[(1/n)∑i=1n(yi - ŷi)²]

RMSE penalizes large errors more strongly. Mean absolute percentage error can be misleading when actual values are zero or close to zero, so it should not be used uncritically.

Classification metrics

For binary classification, predicted labels can be summarized as true positives (TP), false positives (FP), true negatives (TN), and false negatives (FN).

MetricFormulaInterpretation
Accuracy(TP+TN)/(TP+TN+FP+FN)Overall proportion correct
PrecisionTP/(TP+FP)Reliability of positive predictions
RecallTP/(TP+FN)Proportion of positives detected
SpecificityTN/(TN+FP)Proportion of negatives correctly rejected
F1 score2PR/(P+R)Harmonic mean of precision and recall

Accuracy can be deceptive under class imbalance. If only 2% of transactions are fraudulent, a model predicting “not fraud” for every case has 98% accuracy but no detection value. Precision-recall curves are often informative for rare positive classes. Receiver operating characteristic analysis examines trade-offs across thresholds, but area under the curve should not replace assessment at the operating threshold and relevant costs.

Calibration asks whether predicted probabilities correspond to observed frequencies. If cases assigned probability 0.7 experience the event approximately 70% of the time, the model is well calibrated in that region. A model may rank cases effectively yet be poorly calibrated, which matters when probabilities guide resource allocation.

Cost-sensitive evaluation

The best threshold depends on consequences. If the cost of a false negative is CFN and the cost of a false positive is CFP, expected cost can be written as:

Expected Cost = CFN × FN + CFP × FP

This simplified expression assumes equal weighting of cases and excludes other costs such as intervention expense and opportunity cost. In practice, expected value should include the financial and human effects of each action. Threshold selection should therefore involve decision owners, not only data scientists.

6. Overfitting, Leakage, and Robustness

Overfitting occurs when a model captures idiosyncrasies or noise in training data and performs poorly on new data. It is encouraged by excessive complexity, small samples, repeated uncorrected experimentation, leakage, and weak measurement.

The bias–variance perspective describes a trade-off: simple models may have high bias and low variance, while highly flexible models may have low training bias and high variance. Regularization, cross-validation, simpler feature sets, early stopping, and more data can improve generalization.

Data leakage occurs when information unavailable at the prediction time enters the model. Examples include using a post-outcome cancellation code to predict cancellation, calculating a customer’s “current” status using future transactions, or imputing all data before creating a time split. Leakage often produces impressive but unusable results.

Cross-validation partitions training data into folds. In k-fold cross-validation, the model is trained on k−1 folds and evaluated on the remaining fold, repeating until every fold has served as validation data. The average score estimates expected performance under similar sampling conditions. Grouped or blocked cross-validation is needed when observations from the same customer, employee, store, or time period are dependent.

Robustness analysis should examine performance across time, geography, customer type, operational conditions, and plausible data perturbations. Confidence intervals or bootstrap intervals can communicate uncertainty in performance estimates. A small difference in two model scores may not justify replacing an established, more interpretable system.

7. Interpretability, Fairness, and Governance

Interpretability has several meanings. A model may be intrinsically understandable, such as a short linear model or shallow tree. Post-hoc tools may explain a complex model using feature importance, partial dependence, local explanations, or counterfactual examples. These tools are useful but are not identical to a causal explanation, and local explanations can be unstable or misleading when predictors are correlated.

A practical governance process should document:

  • the business purpose and accountable owner;
  • data sources, permissions, and retention limits;
  • target definition and exclusion rules;
  • features and transformations;
  • validation design and performance by subgroup;
  • human review and escalation procedures;
  • monitoring, retraining, and retirement criteria.

Fairness is context-dependent. Relevant measures may include selection rates, false-positive rates, false-negative rates, calibration, and equalized performance across groups. These criteria can conflict, especially when base rates differ. Therefore, fairness cannot be reduced to selecting one universal metric.

Potential sources of unfairness include historical discrimination, unequal measurement quality, underrepresentation, proxy variables, selective labels, and unequal access to opportunities. Removing a protected attribute does not necessarily remove bias because other variables may encode it. Fairness assessment should occur before deployment and continuously afterward.

Privacy principles include purpose limitation, data minimization, access control, secure storage, retention limits, and transparency. Regulations differ by jurisdiction and application, but high-impact decisions commonly require stronger justification, human oversight, and rights of explanation or contestation. Legal compliance is a minimum, not a substitute for ethical responsibility.

8. Managerial Usefulness and Implementation

A model creates value only when it changes a decision sufficiently to improve outcomes. A useful implementation connects four elements:

  1. Signal: What pattern does the model detect?
  2. Decision: What action follows a given prediction?
  3. Capacity: Can the organization deliver that action at scale?
  4. Feedback: How will outcomes be measured and the model revised?

A churn model, for example, has limited value if the firm cannot offer relevant retention interventions or if contacting low-risk customers creates unnecessary cost. Managers should compare the model with a simple baseline, such as a current rule or historical average. They should also estimate implementation cost, intervention capacity, customer response, and unintended effects.

Deployment requires monitoring for data drift, concept drift, changes in measurement, missingness, calibration, subgroup performance, and operational failures. A model that was accurate last year may degrade when prices, policies, competitors, or customer behaviour change. Monitoring should have predefined thresholds and escalation responsibilities.

9. Illustrative Case: Retail Customer Retention

Background

A fictional subscription retailer, Northstar Home, experiences rising customer cancellations. Management wants to identify meaningful customer segments and prioritize retention offers without treating every customer identically.

Problem

The available data include monthly spend, order frequency, tenure, delivery complaints, service contacts, discount use, and whether the customer cancelled within the next 60 days. The company must avoid using information recorded after cancellation and must control the cost of interventions.

Analysis

The analytics team first defines the customer-month as the unit of analysis and creates predictors using only information available at the end of each month. Monetary variables are standardized for clustering. K-means solutions with two through six clusters are compared using silhouette values, stability across resamples, and managerial interpretability. A four-cluster solution is selected provisionally because it is stable and supports differentiated service strategies:

  • loyal high-value customers;
  • price-sensitive frequent buyers;
  • low-engagement customers;
  • service-frustrated customers.

The team then fits logistic regression, a pruned decision tree, and a gradient-boosted model to predict cancellation within 60 days. The data are divided chronologically: earlier months for training and validation, later months for testing. Because false negatives are costly but interventions have limited capacity, the operating threshold is selected using expected contribution rather than accuracy alone.

PCA is used for exploratory visualization of correlated service and engagement variables. It helps show a broad “engagement” direction, but the final retention model retains original variables so managers can understand recommended actions.

Approach and solution

The boosted model has the strongest test-set ranking performance, but its probability calibration is inferior to logistic regression. The firm therefore calibrates probabilities and uses a constrained intervention policy: contact only customers above a risk threshold and prioritize those for whom a service remedy is available. A human review process handles unusual cases and complaints involving vulnerable customers.

The company conducts a controlled rollout. One group receives the existing retention process, while another receives the new prioritized intervention. This comparison is essential because a predictive model may identify customers who would cancel even without intervention; prediction alone does not prove treatment effectiveness.

Outcome

In this illustrative case, the new process reduces unnecessary offers and improves retention among service-frustrated customers, but produces little benefit among low-engagement customers. Management therefore revises the strategy: service recovery is offered to the first group, while low-engagement customers receive lower-cost educational communication. The model is monitored monthly for calibration, subgroup error rates, and changes in complaint coding.

Learning points

The case demonstrates that segmentation and prediction answer different questions. Clustering describes similarity; classification estimates risk. PCA can support exploration without being used as the final decision model. Model selection must incorporate costs, intervention capacity, fairness, and experimental evidence. The best model is not necessarily the most complex model; it is the model embedded in a credible decision process.

10. Contemporary Developments

Current practice increasingly combines automated machine learning, cloud platforms, explainable AI tools, causal machine learning, and real-time monitoring. These developments improve speed and scale but also increase governance requirements. Large language models and generative systems can support feature documentation, code assistance, and qualitative interpretation, but they may hallucinate, reproduce bias, expose confidential information, or obscure accountability. Their outputs require verification and should not silently replace validated analytical procedures.

Emerging practice emphasizes responsible-by-design workflows: documenting intended use, testing subgroup performance, preserving reproducibility, tracking model versions, and involving domain experts and affected stakeholders. Causal forests, uplift modelling, and experimentation are increasingly relevant when the objective is to identify whom to treat rather than merely whom to predict. Synthetic data may assist development, but it does not automatically solve privacy, representativeness, or validity problems.

Best-Practice Checklist

Before approving a multivariate model, ask:

  • Is the decision and prediction time clearly defined?
  • Does the data represent the intended population and future period?
  • Were transformations learned only from training data?
  • Is the distance measure or model form substantively justified?
  • Were baselines, alternative models, and uncertainty assessed?
  • Are performance metrics aligned with costs and class balance?
  • Has leakage been actively tested for?
  • Are subgroup performance and fairness risks documented?
  • Can decision makers understand and contest outputs where necessary?
  • Is there a monitored implementation plan with an accountable owner?

Chapter Summary

Multivariate analytics studies several variables jointly to describe patterns, reduce complexity, classify cases, and support prediction. Segmentation requires careful definitions of similarity, scaling, distance, cluster number, stability, and managerial actionability. K-means and hierarchical clustering are useful but depend on assumptions and choices.

Principal component analysis transforms correlated variables into orthogonal directions ordered by explained variance. It can reduce dimensionality, but components require cautious interpretation and may sacrifice transparency. Classification and regression models range from interpretable linear models to flexible ensembles. Their performance must be evaluated on data that represent future use, with metrics chosen according to error costs, class imbalance, calibration, and business objectives.

Overfitting, leakage, drift, and measurement error threaten generalization. Interpretability tools are valuable but do not automatically establish causality. Fairness requires contextual evaluation of outcomes, errors, data quality, and institutional effects. Ultimately, managerial usefulness depends on whether predictions lead to feasible, beneficial, and responsible actions. Governance, monitoring, human accountability, and controlled evaluation are integral parts of analytical practice.

Key Terms

Multivariate analytics: Analysis involving several variables simultaneously.

Segmentation: Division of a population into groups with meaningful similarities and differences.

Cluster analysis: Exploratory methods for grouping observations according to similarity.

Euclidean distance: Square-root distance based on summed squared coordinate differences.

k-means: An iterative clustering algorithm that minimizes within-cluster squared distance.

Dendrogram: A tree representation of hierarchical clustering.

Principal component analysis: A variance-preserving method for transforming correlated variables into orthogonal components.

Eigenvalue: The variance associated with a principal component direction.

Loading: The contribution or association of an original variable with a component.

Classification: Prediction of a categorical outcome.

Regression: Prediction or explanation of a numeric outcome.

Logistic regression: A model for binary outcomes using the log-odds link.

Regularization: A complexity-control method that penalizes model coefficients.

Overfitting: Excessive adaptation to training data that reduces generalization.

Data leakage: Use of information unavailable at the intended prediction time.

Calibration: Agreement between predicted probabilities and observed frequencies.

Precision: The proportion of predicted positives that are actual positives.

Recall: The proportion of actual positives that are detected.

Concept drift: Change over time in the relationship between predictors and outcomes.

Algorithmic fairness: Evaluation and management of unequal effects or errors across groups.

Review Questions

5 Short Answer Questions

  1. Why should variables often be standardized before k-means clustering?
  2. What is the main purpose of principal component analysis?
  3. Distinguish precision from recall.
  4. What is data leakage? Give one business example.
  5. Why is accuracy potentially misleading for rare-event classification?

5 Long Answer Questions

  1. Compare k-means and hierarchical clustering, including their assumptions, strengths, limitations, and appropriate managerial uses.
  2. Explain PCA mathematically and discuss how covariance, scaling, eigenvalues, and loadings affect interpretation.
  3. Compare logistic regression, decision trees, random forests, and gradient boosting in terms of flexibility, interpretability, and risk of overfitting.
  4. Design a validation strategy for a model predicting customer churn using monthly historical data.
  5. Discuss why fairness, privacy, interpretability, and managerial usefulness should be treated as model-design issues rather than afterthoughts.

3 Analytical / Application Questions

  1. A bank has a fraud rate of 1%. Its model achieves 99% accuracy but detects no fraudulent transactions. Evaluate the model using more appropriate metrics and recommend an evaluation approach.
  2. A retailer clusters customers using annual spend, number of purchases, complaint count, and tenure. Explain how scaling, outliers, correlated variables, and the choice of cluster number could affect the result, and propose a validation plan.
  3. A hospital uses a risk model that performs similarly overall but has substantially higher false-negative rates for one demographic group. Analyze possible causes and recommend technical, governance, and managerial responses.

Multiple Choice Questions with Answers

Question 1

Which method is primarily designed to group observations according to similarity without a labelled outcome?

A. Cluster analysis

B. Logistic regression

C. Multiple linear regression

D. Calibration analysis

Correct Answer: A. Cluster analysis

Question 2

In k-means clustering, what quantity is minimized?

A. Between-cluster correlation

B. Within-cluster sum of squared distances

C. Classification accuracy

D. Total number of variables

Correct Answer: B. Within-cluster sum of squared distances

Question 3

What does the first principal component maximize?

A. The number of observations

B. The variance of projected data subject to a unit-length direction

C. The number of clusters

D. The classification error rate

Correct Answer: B. The variance of projected data subject to a unit-length direction

Question 4

In logistic regression, the coefficient βⱼ represents a change in which quantity for a one-unit increase in xⱼ, holding other predictors constant?

A. The raw probability in all cases

B. The log-odds of the outcome

C. The RMSE

D. The sample size

Correct Answer: B. The log-odds of the outcome

Question 5

A model has TP = 80 and FP = 20. What is its precision?

A. 20%

B. 40%

C. 80%

D. 100%

Correct Answer: C. 80%

Question 6

Which situation is an example of data leakage?

A. Using only training data to standardize predictors

B. Using a cancellation code created after the prediction date to predict cancellation

C. Evaluating a model on a held-out test set

D. Comparing a model with a historical baseline

Correct Answer: B. Using a cancellation code created after the prediction date to predict cancellation

Question 7

What is a principal reason for using regularization?

A. To increase the number of outcome categories

B. To control model complexity and improve generalization

C. To guarantee causal interpretation

D. To eliminate the need for validation

Correct Answer: B. To control model complexity and improve generalization

Question 8

Which metric is expressed in the same units as a numeric outcome?

A. RMSE

B. Accuracy

C. Precision

D. Recall

Correct Answer: A. RMSE

Question 9

Why can accuracy be misleading in a highly imbalanced classification problem?

A. It always excludes true negatives

B. A model can achieve high accuracy by predicting the majority class almost everywhere

C. It is calculated only for regression

D. It cannot be computed from a confusion matrix

Correct Answer: B. A model can achieve high accuracy by predicting the majority class almost everywhere

Question 10

Which statement best describes managerial usefulness?

A. It is identical to the highest test-set score

B. It depends only on model complexity

C. It depends on whether predictions support feasible, beneficial, and responsible decisions

D. It is guaranteed by using an ensemble model

Correct Answer: C. It depends on whether predictions support feasible, beneficial, and responsible decisions

Quantitative Techniques & Data Literacy
Chapter 12 of 15