This page is published in English.
Weight Objective
PCA Weighting - Principal Component Analysis based objective weighting
Weight_Objective (PCA variance explained, eigenvector-based)
Pearson, K.1901doi:10.1080/14786440109462720 ↗
Overview
PCA weighting extracts weights from the structure of the data itself - criteria that explain more variance (are less redundant) get higher weight. Requires m ≥ n for a non-singular covariance matrix. Results can be sensitive to dataset changes (new alternatives shift weights).
- Output
- Weight, higher is better
- Data
- Crisp, complete numeric matrix
- Weights
- Derived internally, no weight source needed
- Size
- 2+ alternatives, 3-12 criteria works best
- Used for
- Any (objective weighting)
How it works
- 1
Z-score standardise each criterion column (mean=0, σ=1).
Hotelling 1933, p.419 (standardisation; pending PDF page verification)
- 2
Compute eigenvalue decomposition of the correlation matrix R = Z^T Z / (m−1). Retain q components (Kaiser: eigenvalue ≥ 1).
Pearson 1901, p.562 (principal component extraction; pending PDF page verification)
- 3
Weight criterion j by its total contribution across retained components: w_j = Σ_{k=1}^{q} (λ_k/Σλ) · v_{kj}². Normalise Σ w_j = 1.
PCA-MCDM weight adaptation (pending PDF page verification)
Look elsewhere when
- •No data variation (constant criterion). Weight degenerates.
- •Expert judgment is the actual driver. Use subjective weighting.
Assumptions to verify
- Decision matrix exists with measurable criteria
- Sufficient inter-alternative variation per criterion
Edge cases and pitfalls
Singular covariance matrix (m < n or perfectly correlated criteria): eigendecomposition fails. Regularise or use Moore-Penrose pseudo-inverse.
Works with
Commonly takes its weights from
Its derived weights can feed
How to cite
Pearson, K. (1901). On lines and planes of closest fit to systems of points in space. Philosophical Magazine. https://doi.org/10.1080/14786440109462720
System ID, as it appears in reports and the API
PCA-WEIGHT