/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.ethanepperly.com
| | danieltakeshi.github.io

In my STAT 210A class, we frequently have to deal with the minimum of asequence of independent, identically distributed (IID) random variables. Thishappens b...
6.2 parsecs

Travel
| |
| | nickhar.wordpress.com

1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B...
4.7 parsecs

Travel
| |
| | blog.georgeshakan.com

In this post, I talk about the mathematical foundations of PCA
5.4 parsecs

Travel
| |
| | leimao.github.io

Fundamentals to Principal Component Analysis
22.6 parsecs

Travel
|