/explore
|
You are here 
|
peterbloem.nl | ||
| | | | |
thomvolker.github.io
|
|
| | | | | Many different ways of calculating OLS regression coefficients exist, but some ways are more efficient than others. In this post we discuss some of the most common ways of calculating OLS regression coefficients, and how they relate to each other. Throughout, I assume some knowledge of linear algebra (i.e., the ability to multiply matrices), but other than that, I tried to simplify everything as much as possible. | |
| | | | |
qchu.wordpress.com
|
|
| | | | | As a warm-up to the subject of this blog post, consider the problem of how to classify$latex n \times m$ matrices $latex M \in \mathbb{R}^{n \times m}$ up to change of basis in both the source ($latex \mathbb{R}^m$) and the target ($latex \mathbb{R}^n$). In other words, the problem is todescribe the equivalence classes of the... | |
| | | | |
www.jeremykun.com
|
|
| | | | | The singular value decomposition (SVD) of a matrix is a fundamental tool in computer science, data analysis, and statistics. It's used for all kinds of applications from regression to prediction, to finding approximate solutions to optimization problems. In this series of two posts we'll motivate, define, compute, and use the singular value decomposition to analyze some data. (Jump to the second post) I want to spend the first post entirely on motivation and background. | |
| | | | |
eli.thegreenplace.net
|
|
| | | |||
