메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Transfer learning using Kolmogorov complexity: Basic theory and empirical evaluations

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION USE;

EID: 85161958942     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (33)

References (18)
  • 1
    • 0031189914 scopus 로고    scopus 로고
    • Multitask learning
    • Rich Caruana. Multitask learning. Machine Learning, 28:41-75, 1997. (Pubitemid 127507169)
    • (1997) Machine Learning , vol.28 , Issue.1 , pp. 41-75
    • Caruana, R.1
  • 11
    • 4644374039 scopus 로고    scopus 로고
    • Optimality of Bayesian universal prediction for general loss and alphabet
    • Marcus Hutter. Optimality of Bayesian universal prediction for general loss and alphabet. Journal of Machine Learning Research, 4:971-1000, 2003.
    • (2003) Journal of Machine Learning Research , vol.4 , pp. 971-1000
    • Hutter, M.1
  • 12
    • 34548243292 scopus 로고    scopus 로고
    • On universal prediction and bayesian confirmation
    • in press
    • Marcus Hutter. On universal prediction and bayesian confirmation. Theoretical Computer Science (in press), 2007.
    • (2007) Theoretical Computer Science
    • Hutter, M.1
  • 14
    • 0017996595 scopus 로고
    • Complexity-based induction systems: Comparisons and convergence theorems
    • R. J. Solomonoff. Complexity-based induction systems: comparisons and convergence theorems. IEEE Transactions on Information Theory, 24(4):422-432, 1978. (Pubitemid 8623282)
    • (1978) IEEE Transactions on Information Theory , vol.IT-24 , Issue.4 , pp. 422-432
    • Solomonoff, R.J.1
  • 15
    • 0037262814 scopus 로고    scopus 로고
    • An introduction toMCMC for machine learning
    • Christophe Andrieu, Nando de Freitas, Arnaud Doucet, andMichael I. Jordan. An introduction toMCMC for machine learning. Machine Learning, 50(1-2):5-43, 2003.
    • (2003) Machine Learning , vol.50 , Issue.1-2 , pp. 5-43
    • Andrieu, C.1    De Freitas, N.2    Doucet, A.3    Jordan, M.I.4
  • 16
    • 0035478854 scopus 로고    scopus 로고
    • Random forests
    • DOI 10.1023/A:1010933404324
    • Leo Breiman. Random forests. Machine Learning, 45:5-32, 2001. (Pubitemid 32933532)
    • (2001) Machine Learning , vol.45 , Issue.1 , pp. 5-32
    • Breiman, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.