Prediction algorithms and confidence measures based on algorithmic randomness theory
β Scribed by Alex Gammerman; Volodya Vovk
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 104 KB
- Volume
- 287
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper reviews some theoretical and experimental developments in building computable approximations of Kolmogorov's algorithmic notion of randomness. Based on these approximations a new set of machine learning algorithms have been developed that can be used not just to make predictions but also to estimate the conΓΏdence under the usual iid assumption.
π SIMILAR VOLUMES
The routine modelling method for GM 1,1 grey model is described in details and its disadvantages are pointed out. The annealing evolution algorithm derived from simulated annealing and combined with the strategy of evolution in the genetic Ε½ . algorithm is applied to GM 1,1 modelling, and the unifor
Genome wide association studies have identified several single nucleotide polymorphisms (SNPs) that are independently associated with small increments in risk of prostate cancer, opening up the possibility for using such variants in risk prediction. Using segregation analysis of population-based sam