Transductive confidence machine is universal

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2842, Issue , 2003, Pages 283-297

  Nouretdinov, Ilia ^a   V’yugin, Vladimir ^a   Gammerman, Alex ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORECASTING; PARALLEL PROCESSING SYSTEMS; COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; RANDOM PROCESSES;

ALGORITHMIC RANDOMNESS; CONFIDENCE INFORMATION; KOLMOGOROV THEORY; PREDICTION ALGORITHMS; PREDICTION METHODS; PREDICTIVE PERFORMANCE; TRANSDUCTIVE CONFIDENCE MACHINE;

COMPUTATIONAL COMPLEXITY; ALGORITHMS;

PREDICTIVE PERFORMANCE; TRANSDUCTIVE CONFIDENCE MACHINE (TCM);

EID: 7444249671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39624-6_23     Document Type: Conference Paper

References (18)

1. J. M. Bernardo, A. F. M. Smith. Bayesian Theory. Wiley, Chichester, 2000.
2. D. Cox, D. Hinkley. Theoretical Statistics. Chapman, Hall, London, 1974.
3. N. Cristianini, J. Shawe-Taylor. An Introduction to Support Vector Machines and OtherKernel-based Methods. Cambridge, Cambridge University Press, 2000.
4. A. Gammerman, V. Vapnik, V. Vovk. Learning by transduction. In Proceedings of UAI’1998, pages 148-156, San Francisco, MorganKaufmann.
5. A. N. Kolmogorov Three approaches to the quantitative definition of information, Problems Inform. Transmission, 1965, 1 N 1, p. 4-7.
6. A. N. Kolmogorov Combinatorial foundations of information theory and the calculus of probabilities. Russian Math. Suveys, 1983, 38, N 4, p. 29-40.
7. M. Li, P. Vitányi. An Introduction to Kolmogorov Complexity and ItsApplications. Springer, New York, 2nd edition, 1997.
8. T. Melluish, C. Saunders, I. Nouretdinov, V. Vovk. Comparing the Bayes and typicalness frameworks. In Proceedings of ECML’2001, 2001. Full version published as a CLRC technical report TR-01-05; see http://www.clrc.rhul.ac.uk.
9. I. Nouretdinov, V. Vovk, M. Vyugin, A. Gammerman. Pattern recognition and density estimation under the general i. i. d. assumption. In David Helmbold and Bob Williamson, editors, Proceedings of COLT’ 2001, pages 337-353.
10. H. Rogers. Theory of recursive functions and effective computability, New York: McGraw Hill, 1967
11. C. Saunders, A. Gammerman, V. Vovk. Transduction with confidence and credibility. In Proceedings of the 16th IJCAI, pages 722-726, 1999.
12. C. Saunders, A. Gammerman, V. Vovk. Computationally efficient transductive machines. In Proceedings of ALT’00, 2000.
13. V. Vovk. On the concept of the Bernoulli property. Russian Mathematical Surveys, 41:247-248, 1986.
14. V. Vovk, A. Gammerman. Statistical applications of algorithmic randomness. In Bulletin of the International Statistical Institute. The 52ndSession, Contributed Papers, volume LVIII, book 3, pages 469-470, 1999.
15. V. Vovk, A. Gammerman. Algorithmic randomness for machine learning. Manuscript, 2001.
16. V. Vovk, A. Gammerman, C. Saunders. Machine-learning applications of algorithmic randomness. In Proceedings of the 16th ICML, pages 444-453, 1999.
17. V. Vovk. On-Line Confidence Machines Are Well-Calibrated. In proceedings of FOCS’02, pages 187-196, 2002.
18. I. Nuretdinov, V. Vovk, V. V’yugin, A. Gammerman, Transductive confidence machine is universal. CLRC technical report http://www.clrc.rhul.ac.uk/tech-report/