Computer Science – Computational Complexity
Scientific paper
2005-05-29
Computer Science
Computational Complexity
submitted
Scientific paper
We show that Kolmogorov complexity and such its estimators as universal codes
(or data compression methods) can be applied for hypotheses testing in a
framework of classical mathematical statistics. The methods for identity
testing and nonparametric testing of serial independence for time series are
suggested.
Astola Jaakko
Gammerman Alex
Ryabko Boris
No associations
LandOfFree
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-690468