Advanced Business Statistics

Chapter 9
Multivariate Business Analysis

Post Graduate Program in Business Analytics
Advanced Business Statistics   •   Post Graduate

Multivariate Business Analysis

Introduction and Context

Business decisions rarely depend on one variable. A customer’s value may depend simultaneously on spending, frequency, profitability, tenure, channel use and service interactions. A product’s market position may be assessed through several perceived attributes. A credit applicant may be evaluated using income, repayment history, leverage and cash-flow indicators. Multivariate analysis provides a systematic framework for examining such interdependent observations.

The central purpose of multivariate business analysis is not merely to reduce a large dataset. It is to discover structure, represent complex relationships, classify observations and support decisions while preserving the information that matters. This chapter develops five complementary approaches:

  • principal component analysis (PCA) for dimensionality reduction;
  • factor analysis for identifying latent constructs;
  • clustering for discovering homogeneous groups;
  • discriminant analysis for assigning observations to known groups; and
  • multivariate visualization for communicating high-dimensional patterns.

These methods are related but answer different questions. PCA asks how observed variables can be replaced by a smaller set of mathematically constructed components. Factor analysis asks whether observed correlations can be explained by unobserved factors. Clustering asks whether observations form naturally similar groups. Discriminant analysis asks how an observation should be classified when groups are already defined. Visualization helps analysts inspect assumptions, communicate results and detect patterns that numerical summaries may conceal.

Learning Objectives

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

  1. distinguish PCA, factor analysis, clustering and discriminant analysis;
  2. standardize data appropriately and assess multivariate suitability;
  3. calculate and interpret covariance, correlation, eigenvalues and explained variance;
  4. select and validate components, factors and clusters;
  5. apply discriminant functions to classification problems;
  6. interpret multivariate visualizations without overstating evidence;
  7. evaluate assumptions, limitations, ethical risks and managerial implications.

1. The Multivariate Data Structure

Suppose there are n observations and p measured variables. The data matrix is written as:

X = [xᵢⱼ], i = 1, …, n; j = 1, …, p

Here, xᵢⱼ is the value of variable j for observation i. In a customer dataset, an observation may be a customer and the variables may include annual spend, number of orders and complaint count.

The sample mean of variable j is:

x̄ⱼ = (1/n) ∑ᵢ₌₁ⁿ xᵢⱼ

The sample covariance between variables j and k is:

sⱼₖ = [1/(n − 1)] ∑ᵢ₌₁ⁿ (xᵢⱼ − x̄ⱼ)(xᵢₖ − x̄ₖ)

The covariance matrix S contains all sⱼₖ values. Covariance is scale-dependent: revenue measured in rupees and order count measured in units cannot be compared directly. The correlation between variables j and k is:

rⱼₖ = sⱼₖ/(sⱼ sₖ)

where sⱼ and sₖ are the sample standard deviations. Correlation is dimensionless and lies between −1 and +1.

A standardized observation is:

zᵢⱼ = (xᵢⱼ − x̄ⱼ)/sⱼ

Standardization gives each variable mean 0 and standard deviation 1. It is generally appropriate when variables use different units or have substantially different variances. It may be inappropriate when the original scale has direct substantive meaning and variance differences are meaningful.

Data preparation

Before applying any method, analysts should:

  • define the unit of analysis clearly;
  • inspect missingness and determine whether imputation is defensible;
  • identify impossible values and influential outliers;
  • transform strongly skewed variables where justified;
  • encode categorical variables appropriately;
  • avoid including duplicate measures or variables that directly reproduce the target;
  • separate training and test data when prediction is involved.

A correlation matrix describes linear association, not causation. A high correlation can result from a common trend, a third variable, measurement design or data leakage.

2. Principal Component Analysis

2.1 Purpose and logic

PCA transforms p correlated variables into p uncorrelated linear combinations called principal components. The first component captures the maximum possible variance among all standardized linear combinations; each subsequent component captures the maximum remaining variance subject to being uncorrelated with earlier components.

For standardized variables, the first component for observation i is:

PC₁ᵢ = w₁₁zᵢ₁ + w₁₂zᵢ₂ + … + w₁ₚzᵢₚ

The vector w₁ contains component weights and is constrained so that:

w₁′w₁ = 1

The weights are obtained from the eigenvectors of the covariance or correlation matrix. If R is the correlation matrix, an eigenvector w and eigenvalue λ satisfy:

Rw = λw

The eigenvalue is the variance of the corresponding component. For standardized variables, the total variance equals p, because the diagonal of R contains p ones. The proportion of variance explained by component k is:

PVEₖ = λₖ / ∑ⱼ₌₁ᵖ λⱼ

The cumulative explained variance for the first q components is:

CPVE(q) = [∑ₖ₌₁ᑫ λₖ / ∑ⱼ₌₁ᵖ λⱼ] × 100%

2.2 Worked example: customer survey reduction

Assume a retailer measures four standardized customer perceptions: convenience, website usability, delivery speed and service responsiveness. The correlation matrix has eigenvalues 2.40, 0.90, 0.45 and 0.25. Since the total is 4.00:

  • Component 1 explains 2.40 ÷ 4.00 = 60%.
  • Component 2 explains 0.90 ÷ 4.00 = 22.5%.
  • The first two explain 82.5%.

A two-component representation may therefore be useful, subject to interpretability and validation. The first component might represent overall digital service quality if all four variables have substantial positive loadings. The second might contrast operational delivery performance with website experience if the relevant loadings have opposite signs.

The sign of an eigenvector is arbitrary: multiplying every loading by −1 produces the same component. Interpretation should therefore focus on relative signs and magnitudes, not on whether a component is labelled positive or negative merely because of its sign.

2.3 Choosing the number of components

Common tools include:

  • a scree plot, which looks for an elbow where additional eigenvalues become small;
  • cumulative explained variance, interpreted in light of the application;
  • the Kaiser rule, retaining eigenvalues above 1 when PCA uses a correlation matrix;
  • parallel analysis, which compares observed eigenvalues with those from random data; and
  • predictive validation, examining whether reduced features preserve performance in a downstream model.

No single rule is universally correct. The Kaiser rule can over-retain components, especially with many variables. Explained variance alone can retain statistically useful but managerially meaningless dimensions. Parallel analysis and substantive interpretation are usually stronger complements.

2.4 Scores, loadings and uses

A loading indicates the association between a variable and a component, although exact interpretation depends on the software convention and whether components are standardized. Component scores locate observations in the reduced space. PCA is useful for:

  • compressing correlated measures;
  • reducing multicollinearity before regression;
  • constructing indices such as service quality;
  • visualizing observations in two or three dimensions; and
  • creating features for predictive models.

PCA is not a causal model. Its components are mathematical summaries, not necessarily real organizational constructs.

3. Exploratory Factor Analysis

3.1 Factor model

Factor analysis models observed variables as functions of fewer unobserved factors plus unique error:

x = μ + Λf + ε

where x is a p × 1 observed-variable vector, μ is its mean vector, Λ is a p × m loading matrix, f is an m × 1 vector of common factors, and ε is a p × 1 vector of unique factors or errors. A frequently used assumption is:

Cov(f) = Φ, Cov(ε) = Ψ, Cov(f, ε) = 0

Here Φ is the factor covariance matrix and Ψ is usually diagonal, meaning unique errors are uncorrelated. Under these assumptions:

Σ = ΛΦΛ′ + Ψ

Σ is the population covariance matrix. In an orthogonal factor model, Φ = I, so Σ = ΛΛ′ + Ψ.

PCA decomposes total variance. Factor analysis attempts to explain common variance and explicitly separates unique variance. This distinction is important when the theoretical objective is to identify latent constructs such as trust, perceived value or employee engagement.

3.2 Suitability and extraction

Factor analysis requires meaningful intercorrelations. Analysts commonly inspect:

  • the correlation matrix;
  • the Kaiser–Meyer–Olkin (KMO) measure of sampling adequacy;
  • Bartlett’s test of sphericity;
  • communalities; and
  • sample size relative to the number and quality of indicators.

KMO values closer to 1 indicate that partial correlations are relatively small compared with correlations, supporting factor analysis. Bartlett’s test evaluates whether the correlation matrix differs from an identity matrix. A statistically significant result suggests that correlations exist, although significance is sensitive to sample size and does not prove that the factor model is substantively appropriate.

Extraction methods include principal-axis factoring and maximum likelihood. Maximum likelihood supports formal model comparisons and some inferential procedures when multivariate normality is plausible. Principal-axis factoring is often more robust when normality is doubtful.

3.3 Rotation and interpretation

Initial extracted factors may be difficult to interpret. Rotation redistributes explained variance to obtain a simpler pattern. Varimax is an orthogonal rotation that maintains uncorrelated factors. Oblimin and promax are oblique rotations that permit correlated factors; they are often more realistic in business research, where constructs such as satisfaction and loyalty may be related.

A factor loading is the estimated association between an observed variable and a factor. Communality for variable j is the proportion of its variance explained by common factors. With an orthogonal model:

hⱼ² = ∑ₖ₌₁ᵐ λⱼₖ²

The uniqueness is approximately 1 − hⱼ² for standardized variables. Low communalities may indicate that a variable does not fit the factor solution.

Factor labels must be justified by the variables with high loadings, not invented from statistical convenience. Cross-loading items—items loading substantially on several factors—may require theoretical review, revision or retention with explicit acknowledgement.

3.4 Reliability and validity

A factor solution is not automatically a valid measurement scale. Internal consistency may be assessed with Cronbach’s alpha:

α = [k/(k − 1)] [1 − (∑ᵢ₌₁ᵏ σᵢ² / σₜ²)]

where k is the number of items, σᵢ² is the variance of item i and σₜ² is the variance of the total score. Alpha assumes, among other conditions, essentially tau-equivalent items and uncorrelated errors; it is not proof of unidimensionality. Composite reliability, convergent validity, discriminant validity and confirmatory factor analysis provide additional evidence.

4. Cluster Analysis for Segmentation

4.1 Objective

Clustering groups observations so that members of the same cluster are more similar under a chosen distance measure than members of different clusters. Unlike discriminant analysis, clustering does not begin with known class labels.

For standardized Euclidean data, the distance between observations a and b is:

d(a,b) = √[∑ⱼ₌₁ᵖ (zₐⱼ − zbⱼ)²]

Distance selection is a modelling decision. Euclidean distance is sensitive to scale and outliers. Manhattan distance may be more robust in some settings. Gower distance is useful for mixed numeric, ordinal and categorical data when implemented appropriately.

4.2 Hierarchical clustering

Agglomerative hierarchical clustering begins with each observation as a separate cluster and repeatedly merges clusters. The result is displayed as a dendrogram. Linkage rules include:

  • single linkage: minimum pairwise distance;
  • complete linkage: maximum pairwise distance;
  • average linkage: average pairwise distance; and
  • Ward’s method: merges that produce the smallest increase in within-cluster squared error.

A dendrogram supports exploration, but selecting a cut is not purely mechanical. Different linkage rules may produce different structures.

4.3 k-means clustering

In k-means, the analyst selects k clusters and seeks centroids minimizing within-cluster sum of squares:

WSS = ∑ₖ₌₁ᴷ ∑i∈Cₖ ||xᵢ − μₖ||²

where Cₖ is cluster k, μₖ is its centroid and ||·|| is Euclidean norm. The algorithm alternates between assigning each observation to the nearest centroid and recalculating centroids until assignments stabilize or improvement becomes negligible.

Because k-means uses means and squared distances, it is sensitive to outliers, scale and initialization. Multiple random starts are advisable. The selected k can be assessed using the elbow method, silhouette width, gap statistic, stability under resampling and managerial actionability. A silhouette value for observation i compares its average distance to its own cluster with the lowest average distance to another cluster; higher values indicate better separation, although the exact aggregate should be interpreted comparatively.

4.4 Segmentation interpretation

A segment is useful only if it is measurable, substantial, reachable, differentiable and actionable. Statistical separation is not sufficient. Analysts should profile clusters using variables not used to create them, examine stability over time and avoid labels that stigmatize people. Cluster names should describe observed behaviour—for example, “high-frequency digital buyers”—rather than make unsupported psychological claims.

5. Discriminant Analysis

5.1 Classification with known groups

Discriminant analysis constructs functions that distinguish predefined groups. In two-group linear discriminant analysis, a score can be written as:

D(x) = a + b₁x₁ + b₂x₂ + … + bₚxₚ

where xⱼ are predictors, bⱼ are coefficients and a is an intercept. A classification rule assigns an observation to the group with the largest discriminant score or posterior probability.

Under linear discriminant analysis (LDA), the usual assumptions are approximately multivariate normal predictors within each group and equal covariance matrices across groups. With group g having mean vector μ_g, common covariance matrix Σ and prior probability π_g, the discriminant function is:

δg(x) = x′Σ⁻¹μg − (1/2)μg′Σ⁻¹μg + ln(πg)

The observation is assigned to the group with the largest δ_g(x). If group covariance matrices differ, quadratic discriminant analysis (QDA) uses group-specific Σ_g and produces curved rather than linear boundaries. QDA requires more data because more covariance parameters must be estimated.

Posterior probabilities can be expressed as:

P(g|x) = exp[δg(x)] / ∑ₕ exp[δₕ(x)]

when δ values are based on the corresponding Gaussian discriminant model. Priors should reflect population prevalence or an explicit decision policy; arbitrary equal priors can be inappropriate in highly imbalanced applications.

5.2 Evaluation

Training accuracy is optimistic. Use a holdout set or cross-validation. A confusion matrix should report sensitivity, specificity, precision and class-specific error rates where relevant. If misclassification costs differ, the threshold should be selected using expected cost rather than accuracy alone.

A significant separation between group centroids does not guarantee useful prediction. Conversely, modest statistical separation can still be valuable if the operational cost of errors is low. Predictors should be measured before the classification decision and should not encode the outcome indirectly.

6. Multivariate Visualization

Visualization is part of analysis, not merely presentation. Useful displays include:

  • scatterplot matrices for pairwise relationships;
  • heat maps of correlations or standardized values;
  • scree plots for PCA or factor selection;
  • biplots showing observations and variable directions;
  • dendrograms for hierarchical clustering;
  • parallel-coordinate plots for profiles across many variables;
  • score plots for component or factor spaces; and
  • discriminant score plots with validation-based class boundaries.

A PCA biplot should be interpreted cautiously. The angle between variable vectors approximates correlation only under particular scaling conventions, and the lengths and distances depend on whether the plot uses a correlation, covariance or symmetric scaling. A two-dimensional projection can hide separation present in higher dimensions and can create apparent proximity that is not reliable.

Dimensionality-reduction methods such as t-SNE and UMAP can reveal local neighbourhood structure, but they are primarily visualization tools. Distances between separated islands, cluster sizes and global geometry may not have stable substantive interpretations. Random seeds, perplexity or neighbourhood parameters can change the display. They should not be treated as definitive evidence of natural segments.

7. Integrated Applied Case: Illustrative Retail Customer Segmentation

Background

A fictional omnichannel retailer has 24 months of customer data for 18,000 active customers. Variables include annual margin, order frequency, average basket value, mobile share of orders, returns rate, service contacts and tenure. Management wants to design differentiated retention and channel strategies.

Problem

The variables have different units, are correlated and include extreme high-value customers. Management needs segments that are statistically defensible and operationally usable, while avoiding the use of protected characteristics.

Analysis approach

First, the team defines the customer as the unit of analysis and calculates behavioural measures over a fixed 12-month window. Monetary variables are inflation-adjusted and log-transformed where appropriate. Variables are standardized after winsorization is reviewed against business rules. Missing service-contact counts are treated as zero only when the data-generating process confirms that no contact means no recorded contact; otherwise missingness is modelled explicitly.

Second, PCA is used to inspect redundancy. The first three components explain 78% of standardized variance. Loadings suggest dimensions resembling value intensity, digital engagement and service friction. These components are used for visualization and sensitivity analysis, not automatically assumed to be managerial constructs.

Third, a factor analysis of survey items is conducted separately to measure perceived convenience, trust and responsiveness. Oblique rotation is selected because these perceptions are expected to correlate. Items with weak communalities are reviewed rather than removed solely to improve a fit statistic.

Fourth, k-means is run for k = 3 through 7 with 50 random starts per k. Silhouette values and bootstrap stability favour four clusters. Profiles are validated using holdout-period behaviour. The resulting groups are:

SegmentProfileStrategic implication
AHigh margin, frequent, low service frictionProtect with loyalty benefits
BDigital-heavy, moderate margin, high growthUse app-based cross-selling
CLow frequency, promotion responsiveTest targeted offers carefully
DHigh returns and service contactsInvestigate fulfilment and product-fit causes

Fifth, a discriminant model is trained to classify new customers into these four operational segments using variables available at the time of campaign assignment. Cross-validation is used, and segment-specific precision is reported. The model does not use future margin or post-campaign behaviour.

Outcome

A pilot campaign compares segment-specific treatment with a control group. Success is evaluated through incremental margin, retention and complaint rates—not campaign response alone. Segment D receives a service-resolution intervention rather than automatic discounting. Results show higher incremental margin in Segment B and reduced complaints in Segment D, while Segment C does not justify broad discounts.

Learning points

The case demonstrates that segmentation is a workflow rather than a single algorithm. Data preparation, dimensionality assessment, clustering, classification, validation and controlled implementation must be connected. A mathematically distinct cluster is not automatically a profitable or ethical target. The use of protected attributes, proxies such as postcode, or inferred sensitive traits requires explicit governance review.

8. Assumptions, Limitations and Governance

Statistical limitations

Multivariate methods can be distorted by missing data, nonlinearity, outliers, multicollinearity and small samples. PCA and factor analysis are sensitive to the correlation structure; cluster results depend on distance and algorithm; discriminant analysis depends on distributional and covariance assumptions. Results should therefore be subjected to sensitivity analysis using alternative scaling, distance measures, extraction methods or validation splits.

Statistical significance can be misleading in large datasets, while unstable results can appear persuasive in small datasets. Analysts should report uncertainty, stability and practical effect—not only fit indices or a preferred number of clusters.

Ethical and regulatory issues

Segmentation and classification can produce disparate treatment. Governance should address:

  • lawful purpose, transparency and data minimization;
  • consent or another valid legal basis where required;
  • access, correction and deletion rights under applicable law;
  • fairness testing across relevant demographic groups;
  • explainability for consequential decisions;
  • human review and appeal mechanisms; and
  • retention, security and audit trails.

A cluster label should not be used to deny essential services without examining whether the data reflect historical disadvantage. Proxy variables can reproduce protected characteristics even when those characteristics are excluded. Fairness cannot be established by removing a sensitive column alone.

Technology and AI

Modern analytics platforms automate scaling, imputation, PCA, clustering and model validation. Automation improves repeatability but does not replace methodological judgment. Reproducible pipelines should record variable definitions, transformations, software versions, random seeds, model parameters and validation results. Generative AI may help document or explain analysis, but analysts must independently verify calculations, protect confidential data and retain accountability for decisions.

9. Best-Practice Workflow

A defensible multivariate project usually follows this sequence:

  1. Translate the business question into an analytical question.
  2. Define the unit of analysis, observation window and decision use.
  3. Audit data quality, missingness, leakage and ethical constraints.
  4. Explore distributions, correlations and outliers.
  5. Standardize or transform variables with a documented rationale.
  6. Select a method consistent with the question: PCA for compression, factors for latent constructs, clustering for discovery and discriminant analysis for known-group classification.
  7. Compare plausible specifications rather than relying on one algorithm.
  8. Validate statistically and operationally, including out-of-sample performance where appropriate.
  9. Visualize results with uncertainty and clear scale conventions.
  10. Translate findings into interventions, monitor outcomes and reassess drift.

Chapter Summary

Multivariate business analysis studies several variables or observations simultaneously. PCA replaces correlated variables with orthogonal components that maximize successive amounts of variance. Its eigenvalues measure component variance, while explained-variance ratios assist dimensionality decisions. Factor analysis instead models observed variables through latent common factors and unique error; extraction, rotation, communalities and validity assessment are essential to interpretation.

Clustering discovers groups without known labels. Distance choice, scaling, linkage, initialization, cluster-number selection and stability all affect results. Discriminant analysis classifies observations into predefined groups and relies on assumptions concerning within-group distributions and covariance matrices; LDA creates linear boundaries, whereas QDA permits group-specific covariance matrices. Visualization helps diagnose structure and communicate results, but low-dimensional displays must not be mistaken for complete representations of high-dimensional reality.

Professional practice requires data preparation, sensitivity analysis, out-of-sample validation, meaningful business profiling, fairness assessment and governance. The best solution is not necessarily the most complex or statistically separated; it is the one that is stable, interpretable, ethical and useful for decisions.

Key Terms

Principal component analysis: A transformation of correlated variables into orthogonal components ordered by explained variance.

Eigenvalue: The variance associated with an eigenvector and, in PCA, with its component.

Eigenvector: A direction defining the weights of a principal component.

Loading: An association between a measured variable and a component or latent factor.

Component score: The position of an observation on a principal component.

Factor analysis: A model that explains observed correlations through latent common factors and unique error.

Communality: The proportion of a variable’s variance explained by common factors.

Uniqueness: The variance of a variable not explained by common factors.

Rotation: A transformation used to obtain a more interpretable factor-loading pattern.

KMO measure: An index of sampling adequacy for factor analysis.

Cluster analysis: A family of methods for grouping similar observations without predefined labels.

Centroid: The mean position of observations assigned to a cluster.

Within-cluster sum of squares: The total squared distance of observations from their cluster centroids.

Linkage: The rule used to determine distance between clusters in hierarchical clustering.

Discriminant analysis: A method for classifying observations into known groups.

LDA: Linear discriminant analysis using a common covariance matrix.

QDA: Quadratic discriminant analysis using group-specific covariance matrices.

Biplot: A plot jointly representing observations and variable directions, often in reduced dimensions.

Data leakage: Use of information unavailable at the time a prediction or decision would be made.

Segment actionability: The extent to which a segment can be reached and served with a useful intervention.

Review Questions

Short Answer Questions

  1. Why might an analyst use the correlation matrix rather than the covariance matrix in PCA?
  2. Distinguish a principal component from a latent factor.
  3. What does a cluster centroid represent?
  4. State one important assumption of linear discriminant analysis.
  5. Why should cluster solutions be validated beyond statistical separation?

Long Answer Questions

  1. Explain PCA from the correlation matrix through eigenvalues, component scores and explained variance. Discuss how the number of components should be selected.
  2. Compare PCA and exploratory factor analysis in terms of objective, variance decomposition, assumptions and interpretation.
  3. Describe a complete clustering workflow for customer segmentation, including preprocessing, distance choice, algorithm selection and validation.
  4. Compare LDA and QDA, including their covariance assumptions, decision boundaries and data requirements.
  5. Discuss the ethical, legal and managerial risks of using multivariate segmentation in customer decision systems.

Analytical / Application Questions

  1. A dataset has five standardized variables with eigenvalues 2.8, 1.1, 0.6, 0.3 and 0.2. Calculate the percentage of variance explained by the first two components and evaluate whether retaining two components is defensible.
  2. A retailer obtains four clusters, but one cluster is unstable across bootstrap samples and cannot be reached through a distinct marketing action. Should it be retained? Develop a reasoned decision using statistical and managerial criteria.
  3. A credit classifier has 95% overall accuracy, but the minority class has very low recall. Explain why accuracy is inadequate and recommend a validation and decision-threshold strategy.

Multiple Choice Questions with Answers

Question 1

For standardized variables, what does a PCA eigenvalue represent?

A. The number of observations in the sample

B. The variance explained by the corresponding component

C. The average correlation of all variables

D. The probability that the component is causal

Correct Answer: B. The variance explained by the corresponding component

Question 2

Which method explicitly separates common variance from unique variance?

A. Factor analysis

B. k-means clustering

C. Linear discriminant analysis

D. Hierarchical visualization

Correct Answer: A. Factor analysis

Question 3

What is the main purpose of standardization before Euclidean-distance clustering?

A. To make all variables categorical

B. To remove every outlier

C. To prevent variables with large units from dominating distance

D. To guarantee normally distributed clusters

Correct Answer: C. To prevent variables with large units from dominating distance

Question 4

Which method is most appropriate when group labels are already known and new observations must be classified?

A. PCA

B. Exploratory factor analysis

C. k-means clustering

D. Discriminant analysis

Correct Answer: D. Discriminant analysis

Question 5

A standardized PCA has eigenvalues 2.4, 0.9, 0.45 and 0.25. What percentage of variance is explained by the first two components?

A. 60.0%

B. 72.5%

C. 82.5%

D. 90.0%

Correct Answer: C. 82.5%

Question 6

Which rotation permits factors to correlate?

A. Varimax

B. Oblique rotation

C. Orthogonal rotation

D. Identity rotation

Correct Answer: B. Oblique rotation

Question 7

What does the k-means objective minimize?

A. Between-group correlation

B. Total sample size

C. Within-cluster sum of squared distances

D. The number of variables

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

Question 8

Which assumption distinguishes standard LDA from QDA?

A. LDA assumes equal covariance matrices across groups

B. LDA assumes there are no predictors

C. LDA requires all variables to be categorical

D. LDA assumes every class has equal sample size

Correct Answer: A. LDA assumes equal covariance matrices across groups

Question 9

Why should t-SNE or UMAP plots be interpreted cautiously?

A. They cannot display any observations

B. Their displayed geometry can depend strongly on parameters and random initialization

C. They always preserve global distances exactly

D. They require a known dependent variable

Correct Answer: B. Their displayed geometry can depend strongly on parameters and random initialization

Question 10

Which is an example of data leakage in customer classification?

A. Standardizing predictors using training data

B. Using customer tenure measured before campaign assignment

C. Using post-campaign revenue to assign a pre-campaign segment

D. Cross-validating the classification model

Correct Answer: C. Using post-campaign revenue to assign a pre-campaign segment

Advanced Business Statistics
Chapter 9 of 15