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

메뉴 건너뛰기

Machine Learning

Volumn 9, Issue 2, 1992, Pages 147-164

Learning Conjunctions of Horn Clauses

(3) Angluin, Dana a Frazier, Michael b Pitt, Leonard b

a YALE UNIVERSITY (United States)

b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN (United States)

Author keywords

equivalence queries; exact identification; membership queries; polynomial time learning; Propositional Horn sentences

Indexed keywords

EID: 0000452640 PISSN: 08856125 EISSN: 15730565 Source Type: Journal
DOI: 10.1023/A:1022689015665 Document Type: Article

Times cited : (165)

References (20)

1
- 70350364209
- Learning with hints
- Morgan Kaumann, Boston, MA
- (1988) Proceedings of the 1988 Workshop on omputational Learning Theory , pp. 167-181
- Angluin, D.¹

2
- 0000710299
- Queries and concept learning
- (1988) Machine Learning , vol.2 , pp. 19-342
- Angluin, D.¹

3
- 84951530385
- Angluin, D. (1988). Requests for hints that return no hints (Technical Report ALE/DCS/RR-647). Department of Computer Science, Yale University.

4
- 0025449393
- Negative results for equivalence queries
- (1990) Machine Leaning , vol.5 , pp. 121-150
- Angluin, D.¹

5
- 0025855543
- Learning conjunctions of Horn clases
- IEEE Computer Society Pres, St. Louis, MO
- (1990) Proceedings of the 31st Annual Symposium on Foundations of Comuter Science , pp. 186-192
- Angluin, D.¹ Frazier, M.² Pitt, L.³

6
- 84951530386
- Angluin, D., Hellerstein, L., & Karpinski, M. (1989). Learning read-once forulas with queries (Technical Report, University of California at Berkeley, Report No.89/528). (Also, International Computer Science Institute Technical Report TR-89-050. To ppear, JACM.)

7
- 34250691793
- When won't membership queries help?
- ACM Press, New Orleans, LA
- (1991) Proceedings of the Twenty Third Annual ACM Symposium on Theory of Comuting , pp. 444-454
- Angluin, D.¹ Kharitonov, M.²

8
- 0024750852
- Learnability andthe Vapnik-Chervonenkis dimension
- (1989) J. ACM , vol.36 , pp. 929-965
- Blumer, A.¹ Ehrenfeucht, A.² Haussler, D.³ Warmuth, M.⁴

9
- 0347670077
- Learning decision trees from random exaples
- Morgan Kaufmann, Boston, MA
- (1988) Proceedings of the 1988 Workshop on Computational Learning Thery , pp. 182-194
- Ehrenfeucht, A.¹ Haussler, D.²

10
- 0024082469
- Quantifying inductive bias: AI learning algorithms and Valiant's leaning framework
- (1988) Artificial Intelligence , vol.36 , pp. 177-221
- Haussler, D.¹

11
- 2542455833
- Learning conjunctive concepts in structural domains
- (1989) Machine Leaning , vol.4 , pp. 7-40
- Haussler, D.¹

12
- 0024137232
- Predicting {0, 1} funtions on randomly drawn points
- IEEE Comuter Society Press, Washington, D.C.
- (1988) Proceedings of the 29th Annual Symposium on oundations of Computer Science , pp. 100-109
- Haussler, D.¹ Littlestone, N.² Warmuth, M.K.³

13
- 49549127781
- Complete problems for deterministic polnomial time
- (1977) Theoretical Computer Science , vol.3 , pp. 107-113
- Jones, N.D.¹ Laaser, W.T.²

14
- 0023545078
- On the learnability of Booean formulae
- ACM Press, New York, NY
- (1987) Proceedings of the Nineteenth Annual ACM Symposium on Thery of Computing , pp. 285-295
- Kearns, M.¹ Li, M.² Pitt, L.³ Valiant, L.G.⁴

15
- 0024863228
- Cryptographic limitations on learning boolean forulae and finite automata
- ACM Press, Seattle, WA
- (1989) Proceedings of the Twenty First Annual ACM Symosium on Theory of Computing , pp. 433-444
- Kearns, M.¹ Valiant, L.G.²

16
- 34250091945
- Learning quickly when irrelevant attributes abound: A new linear-threshold algrithm
- (1988) Machine Learning , vol.2 , pp. 285-318
- Littlestone, N.¹

17
- 0025623922
- Prediction-preserving reducibility
- (1990) J. of Comuter and System Sciences , vol.41 , pp. 430-467
- Pitt, L.¹ Warmuth, M.K.²

18
- 1442267080
- Learning decision lists
- (1987) Machine Learning , vol.2 , pp. 29-246
- Rivest, R.L.¹

19
- 84951530387
- Valiant, L.G. (1985). Learning disjunctions of conjunctions. In Proceedings of the9th International Joint Conference on Artificial Intelligence (pp. 560–566). LosAngeles, CA.

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

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