Publication Type

Journal Article

Publication Date

2011

Abstract

This appendix proves CORN's universal consistency. One of Bin's PhD thesis examiner (Special thanks to Vladimir Vovk from Royal Holloway, University of London) suggested that CORN is universal and provided sketch proof of Lemma 1.6, which is the key of this proof. Based on the proof in Gy\"prfi et al. [2006], we thus prove CORN's universal consistency. Note that the notations in this appendix follows Gy\"orfi et al. [2006].

Discipline

Databases and Information Systems

Research Areas

Data Management and Analytics

Publication

ACM Transactions on Intelligent Systems and Technology

Volume

2

Issue

3

ISSN

2157-6904

Identifier

10.1145/1961189.1961193

Publisher

ACM

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1145/1961189.1961193

Share

COinS