SCOPUS 정보 검색 플랫폼

Volumn 25, Issue 2-3, 1996, Pages 151-193

CLASSIC learning

Author keywords

CLASSIC; Description logic; Knowledge acquisition; Polynomial time learning; Queries; Subsumption

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; SPURIOUS SIGNAL NOISE;

DESCRIPTION LOGIC CLASSIC; POLYNOMIAL TIME LEARNING; QUERIES;

FORMAL LOGIC;

EID: 0030282756 PISSN: 08856125 EISSN: None Source Type: Journal
DOI: 10.1007/bf00114009 Document Type: Article

Times cited : (46)

References (5)

1
- 0023453626
- Learning regular sets from queries and counterexamples
- Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87-106.
- (1987) Information and Computation , vol.75 , Issue.2 , pp. 87-106
- Angluin, D.¹

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

3
- 0000452640
- Learning conjunctions of Horn clauses
- Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of Horn clauses. Machine Learning, 9, 147-164.
- (1992) Machine Learning , vol.9 , pp. 147-164
- Angluin, D.¹ Frazier, M.² Pitt, L.³

4
- 0000492326
- Learning from noisy examples
- Angluin, D. & Laird, P. (1988). Learning from noisy examples. Machine Learning, 2(4), 343-370.
- (1988) Machine Learning , vol.2 , Issue.4 , pp. 343-370
- Angluin, D.¹ Laird, P.²

5
- 0013446086
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Angluin, D. & Slonim, D. K. (1994). Randomly fallible teachers: learning monotone DNF with an incomplete membership oracle. Machine Learning, 14(1), 7-26.
- (1994) Machine Learning , vol.14 , Issue.1 , pp. 7-26
- Angluin, D.¹ Slonim, D.K.²

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