다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Journal of computer and system sciences, v.55 no.1, 1997년, pp.119 - 139
Freund, Y. , Schapire, R.E.
AI-Helper
In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst-case on-line framework. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic set...
Adv. Neural Inform. Process. Systems I Baum 81 1989 What size net gives valid generalization?
Pacific J. Math. Blackwell 6 1 1956 10.2140/pjm.1956.6.1 An analog of the minimax theorem for vector payoffs
L. Breiman, 1996, Bias, variance, and arcing classifiers, Statistics Dept. University of California
10.1145/167088.167198 N. Cesa-Bianchi, Y. Freund, D. P. Helmhold, D. Haussler, R. E. Schapire, M. K. Warmuth, How to use expert advice, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 1993, 382, 391
10.1145/180139.181097 T. H. Chung, Approximate methods for sequential decision making using expert advice, Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994, 183, 189
Math. Finance Cover 1 1 1991 10.1111/j.1467-9965.1991.tb00002.x Universal portfolios
J. Artif. Intell. Res. Dietterich 2 263 1995 10.1613/jair.105 Solving multiclass learning problems via error-correcting output codes
Adv. Neural Inform. Process. Systems Drucker 8 1996 Boosting decision trees
Int. J. Pattern Recognition Artif. Intell. Drucker 7 705 1993 10.1142/S0218001493000352 Boosting performance in neural networks
Y. Freund, 1993, Data Filtering and Distribution Modeling Algorithms for Machine Learning, University of California at Santa Cruz
Inform. and Comput. Freund 121 256 1995 10.1006/inco.1995.1136 Boosting a weak learning algorithm by majority
Y. Freund, R. E. Schapire, Experiments with a new boosting algorithm, Machine Learning: Proceedings of the Thirteenth International Conference, 1996, 148, 156
10.1145/238061.238163 Y. Freund, R. E. Schapire, Game theory, on-line prediction and boosting, Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996, 325, 332
Hannan 1957 Contributions to the Theory of Games Approximation to Bayes risk in repeated play
Haussler 1995 Computational Learning Theory: Second European Conference, EuroCOLT '95 Tight worst-case loss bounds for predicting with expert advice
Adv. Neural Inform. Process. Systems Jackson 8 1996 Learning sparse perceptrons
10.1145/225298.225301 M. Kearns, Y. Mansour, A. Y. Ng, D. Ron, An experimental and theoretical comparison of model selection methods, Proceedings of the Eighth Annual Conference on Computational Learning Theory, 1995
Kearns 1994 An Introduction to Computational Learning Theory
Kivinen 1994 Computational Learning Theory: EuroCOLT '93 Using experts for predicting continuous outcomes
Inform. and Comput. Littlestone 108 212 1994 10.1006/inco.1994.1009 The weighted majority algorithm
J. R. Quinlan, Bagging, boosting, and C4.5, Proceedings, Fourteenth National Conference on Artificial Intelligence, 1996
Machine Learning Schapire 5 197 1990 10.1007/BF00116037 The strength of weak learnability
Vapnik 1982 Estimation of Dependences Based on Empirical Data
10.1145/225298.225304 V. G. Vovk, A game of prediction with expert advice, Proceedings of the Eighth Annual Conference on Computational Learning Theory, 1995
10.1016/B978-1-55860-146-8.50032-1 V. G. Vovk, Aggregating strategies, Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990, 321, 383
Discrete Mathematics Wenocur 33 313 1981 10.1016/0012-365X(81)90274-0 Some special Vapnik-Chervonenkis classes
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.