Description
| Title | Data Complexity |
| Abstract | Kolmogorov complexity measures the amount of information in a data set. This can be used to learn things about the data, e.g. to find out if it very noisy or very regular, or for clustering, classification or denoising. I'll explain such applications and how I hope to apply these notions for the semantic web. |
Other presentations by Steven de Rooij
| Date | Title |
|---|---|
| 18 March 2013 | Data Complexity |
| 30 September 2013 | Codes and probabilities |
| 24 February 2014 | |
| 22 September 2014 | Programming with lots of strings |
| 28 September 2015 |