aboutsummaryrefslogtreecommitdiff
path: root/posts
diff options
context:
space:
mode:
authorYuchen Pei <me@ypei.me>2019-01-04 15:13:10 +0100
committerYuchen Pei <me@ypei.me>2019-01-04 15:13:10 +0100
commit312842f6d75cf6b2f04d0308fec91ff908720f65 (patch)
tree088ddd6cb9df161cfb1325dcac0fb743f52149e2 /posts
parentb801aab95dd9e0610df08db5c256879047ddfa31 (diff)
minor
Diffstat (limited to 'posts')
-rw-r--r--posts/2019-01-03-discriminant-analysis.md3
1 files changed, 2 insertions, 1 deletions
diff --git a/posts/2019-01-03-discriminant-analysis.md b/posts/2019-01-03-discriminant-analysis.md
index 51630b3..d2aaaa3 100644
--- a/posts/2019-01-03-discriminant-analysis.md
+++ b/posts/2019-01-03-discriminant-analysis.md
@@ -176,7 +176,8 @@ will result in a lossy compression / regularisation equivalent to doing
analysis](https://en.wikipedia.org/wiki/Principal_component_analysis) on
$(M - \bar x) V_x D_x^{-1}$.
-Note that as of 2019-01-04, in the scikit-learn implementation, the prediction is done without
+Note that as of 2019-01-04, in the scikit-learn implementation, the prediction of
+LDA is done without
any lossy compression, even if the parameter `n_components` is set to be smaller
than dimension of the affine space spanned by the centroids.
In other words, the prediction does not change regardless of `n_components`.