SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Machine Learning

Volumn 17, Issue 2, 1994, Pages 115-141

Toward Efficient Agnostic Learning

(3) Kearns, Michael J a Schapire, Robert E a Sellie, Linda M b

a LUCENT TECHNOLOGIES (United States)

b UNIVERSITY OF CHICAGO (United States)

Author keywords

agnostic learning; computational learning theory; machine learning; PAC learning

Indexed keywords

EID: 0001553979 PISSN: 08856125 EISSN: 15730565 Source Type: Journal
DOI: 10.1023/A:1022615600103 Document Type: Article

Times cited : (394)

References (27)

1
- 84951644280
- Aldous, D. & Vazirani, U. (1990). A Markovian extension of Valiant's learning model. 31st Annual Symposium on Foundations of Computer Science (pp. 392–404). IEEE Press.

2
- 84951644281
- Blum, A. & Chalasani, P. (1992). Learning switching concepts. Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 231–242). ACM Press.

3
- 0024750852
- Learnability and the Vapnik-Chervonenkis dimension
- (1989) Journal of the Association for Computing Machinery , vol.36 , pp. 929-965
- Blumer, A.¹ Ehrenfeucht, A.² Haussler, D.³ Warmuth, M.K.⁴

4
- 84951644282
- Duda, R. O. & Hart, P. E. (1973). Pattern Classification and Scene Analysis. Wiley.

5
- 0000421687
- Central limit theorems for empirical measures
- (1978) The Annals of Probability , vol.6 , pp. 899-929
- Dudley, R.M.¹

6
- 84951644283
- Freund, Y. (1990). Boosting a weak learning algorithm by majority. Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 202–216). Morgan Kaufmann.

7
- 84951644284
- Freund, Y. (1992). An improved boosting algorithm and its implications on learning complexity. Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 391–398). ACM Press.

8
- 0003603813
- W. H. Freeman, San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.¹ Johnson, D.²

9
- 0002192516
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- (1992) Information and Computation , vol.100 , pp. 78-150
- Haussler, D.¹

10
- 0002896413
- Tracking drifting concepts by minimizing disagreements
- (1994) Machine Learning , vol.14 , pp. 27-45
- Helmbold, D.P.¹ Long, P.M.²

11
- 84947403595
- Probability inequalities for sums of bounded random variables
- (1963) Journal of the American Statistical Association , vol.58 , pp. 13-30
- Hoeffding, W.¹

12
- 84950426173
- Recent developments in nonparametric density estimation
- (1991) Journal of the American Statistical Association , vol.86 , pp. 205-224
- Izenman, A.J.¹

13
- 0027640858
- Learning in the presence of malicious errors
- (1993) SIAM Journal on Computing , vol.22 , pp. 807-837
- Kearns, M.¹ Li, M.²

14
- 84951644285
- Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 285–295).

15
- 84951644286
- Kearns, M. & Valiant, L. G. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the Association for Computing Machinery, 41, 67–95. ACM Press.

16
- 84951644287
- Kearns, M. J. & Schapire, R. E. (1990). Efficient distribution-free learning of probabilistic concepts. 31st Annual Symposium on Foundations of Computer Science (pp. 382–391). IEEE Press. To appear, Journal of Computer and System Sciences.

17
- 0027627287
- Constant depth circuits, Fourier transform, and learnability
- (1993) Journal of the Association for Computing Machinery , vol.40 , pp. 607-620
- Linial, N.¹ Mansour, Y.² Nisan, N.³

18
- 0024092215
- Computational limitations on learning from examples
- (1988) Journal of the Association for Computing Machinery , vol.35 , pp. 965-984
- Pitt, L.¹ Valiant, L.G.²

19
- 84951644288
- Pollard, D. (1984). Convergence of Stochastic Processes. Springer-Verlag.

20
- 0026838784
- Density estimation by stochastic complexity
- (1992) IEEE Transactions on Information Theory , vol.38 , pp. 315-323
- Rissanen, J.¹ Speed, T.P.² Yu, B.³

21
- 0025448521
- The strength of weak learnability
- (1990) Machine Learning , vol.5 , pp. 197-227
- Schapire, R.E.¹

22
- 0021518106
- A theory of the learnable
- (1984) Communications of the ACM , vol.27 , pp. 1134-1142
- Valiant, L.G.¹

23
- 84951644289
- Valiant, L. G. (1985). Learning disjunctions of conjunctions. Proceedings of the 9th International Joint Conference on Artificial Intelligence (pp. 560–566).

24
- 84951644290
- Vapnik, V. N. (1982). Estimation of Dependences Based on Empirical Data. Springer-Verlag.

25
- 0000243355
- Learning in artificial neural networks: A statistical perspective
- (1989) Neural Computation , vol.1 , pp. 425-464
- White, H.¹

26
- 0000819141
- A learning criterion for stochastic rules
- (1992) Machine Learning , vol.9 , pp. 165-203
- Yamanishi, K.¹

27
- 0013419175
- Learning nonparametric densities in terms of finite dimensional parametric hypotheses
- (1992) IEICE Transactions: D Information and Systems , vol.E75D , pp. 459-469
- Yamanishi, K.¹

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