Explore >> Select a destination
|
You are here 
|
lucatrevisan.wordpress.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | A key theme in real analysis is that of studying general functions $latex {f: X \rightarrow {\bf R}}&fg=000000$ or $latex {f: X \rightarrow {\bf C}}&fg=000000$ by first approximating them b | |
| | | | |
francisbach.com
|
|
| | | | | ||
| | | | |
www.jeremykun.com
|
|
| | | | | I'm just going to jump right into the definitions and rigor, so if you haven't read the previous post motivating the singular value decomposition, go back and do that first. This post will be theorem, proof, algorithm, data. The data set we test on is a thousand-story CNN news data set. All of the data, code, and examples used in this post is in a github repository, as usual. We start with the best-approximating $ k$-dimensional linear subspace. | |
| | | | |
booksandpictures.wordpress.com
|
|
| | | Cat is mine, dog is not. | ||
