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

메뉴 건너뛰기

Machine Learning

Volumn 9, Issue 2, 1992, Pages 205-260

On the Computational Complexity of Approximating Distributions by Probabilistic Automata

(2) Abe, Naoki a Warmuth, Manfred K b

a NEC CORPORATION (Japan)

b UNIVERSITY OF CALIFORNIA (United States)

Author keywords

computational learning theory; density estimation; Hidden Markov models; Kullback Leibler divergence; PAC learning model

Indexed keywords

EID: 0001841122 PISSN: 08856125 EISSN: 15730565 Source Type: Journal
DOI: 10.1023/A:1022693116573 Document Type: Article

Times cited : (103)

References (20)

1
- 0005809110
- Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence
- Morgan Kaufmann, San Mateo, CA
- (1991) Proceedings of the 1991 Workshop on Computational Learning Theory
- Abe, N.¹ Takeuchi, J.² Warmuth, M.K.³

2
- 0018062404
- On the complexity of minimal inference of regular sets
- (1978) Information and Control , vol.39 , pp. 337-350
- Angluin, D.¹

3
- 84951542485
- Angluin, D., (1988). Identifying languages from stochastic examples Technical Report YALEU/DCS/RR-614. Yale University.

4
- 85025877295
- Angluin, D., (1989). Minimum consistent 2-state DFA problem is NP-complete. Unpublished manuscript.

5
- 84951542487
- Barron, A.R. & Cover, T.M., (1989). Minimum complexity density estimation. IEEE Transactions on Information Theory.

6
- 0001862769
- An inequality and associated maximizaton technique in statistical estimation for probabilistic functions of a Markov process
- (1972) Inequalities , vol.3 , pp. 1-8
- Baum, L.E.¹

7
- 0024750852
- Learnability and the Vapnik-Chervonenkis dimension
- (1989) Journal of the ACM , vol.36 , pp. 929-965
- Blumer, A.¹ Ehrenfeucht, A.² Haussler, D.³ Warmuth⁴

8
- 0000595574
- Probabilistic Turing machines
- (1977) SIAM J. Comput. , vol.6 , pp. 675-695
- Gill, J.¹

9
- 0001187706
- Complexity of automaton identification from given data
- (1978) Information and Control , vol.37 , pp. 302-320
- Gold, E.M.¹

10
- 84951542488
- Hamming, R.W., (1986). Coding and Information Theory, Second Edition. Prentice-Hall.

11
- 84951542489
- Haussler, D., (1991). Decision theoretic generalizing of the pac model for neural net and other learning applications. Information and Computation. To appear. (An extended abstract appeared in the Proceedings of FOCS '89.)

12
- 84951542490
- Kearns, M., & Schapire, R., (1990). Efficient distribution-free learning of probabilitic concepts. In Proceedings of IEEE Symposium on Foundations of Computer Science.

13
- 84951542491
- Kullback, S., (1967). A lower bound for discrimination in terms of variation. IEEE Transactions on Information Theory, 126–127.

14
- 85060615244
- Efficient unsupervised learning
- Morgan Kaufmann, San Mateo, CA
- (1988) Proceedings of the 1988 Workshop on Computational Learning Theory.
- Laird, P.D.¹

15
- 84951542492
- Levinson, S.E., Rabiner, L.R., & Sondhi, M.M., (1983). An introduction to the application of the theory of the probabilistic functions of a Markov process to automatic speech recognition. The Bell System Technical Journal, 62.

16
- 84951542493
- Pitt, L., & Warmuth, M.K., (1989). The minimum consistent DFA problem cannot be approximated within any polynomial. In Proc. 19th ACM Symp. on Theory of Computation. To appear in JACM.

17
- 84951542494
- Pollard, D., (1984). Convergence of Stochastic Processes. Springer-Verlag.

18
- 84951542495
- Tzeng, W., (1989). The equivalence and learning of probabilistic automata. In Proceedings of the 30th IEEE Annual Symposium on the Foundations of Computer Science.

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

20
- 84951542496
- Yamanishi, K., (1991). A learning criterion for stochastic rules. Machine Learning, 9.

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