SCOPUS 정보 검색 플랫폼

Volumn 2, Issue 3, 1987, Pages 229-246

Learning Decision Lists

Author keywords

Boolean formulae; decision lists; Learning from examples; polynomial time identification

Indexed keywords

EID: 1442267080 PISSN: 08856125 EISSN: 15730565 Source Type: Journal
DOI: 10.1023/A:1022607331053 Document Type: Article

Times cited : (683)

References (10)

1
- 84951542219
- Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (pp. 273-282). Berkeley, CA.

3
- 84951542220
- 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). New York, NY.

4
- 84951542221
- Some NP-complete set-covering problems
- Massachusetts Institute of Technology, Cambridge, MA
- (1976) Unpublished manu-script, Laboratory for Computer Science
- Masek, W.¹

5
- 0018058024
- On the connection between the complexity and credibility of inferred models
- (1978) Journal of General Systems , vol.4 , pp. 255-264
- Pearl, J.¹

6
- 84869422153
- Harvard University, Aiken Computation Laboratory, Cambridge, MA
- (1986) Computational limitations on learning from examples
- Pitt, L.¹ Valiant, L.G.²

7
- 33744584654
- Induction of decision trees
- (1986) Machine Learning , vol.1 , pp. 81-106
- Quinlan, J.R.¹

8
- 0002347685
- Generating production rules from decision trees
- Morgan Kaufmann, Milan, Italy
- (1987) Proceedings of the Tenth International Joint Conference on Artificial Intelligence , pp. 304 307
- Quinlan, J.R.¹

9
- 0018015137
- Modeling by shortest data description
- (1978) Automatica , vol.14 , pp. 465 471
- Rissanen, J.¹

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

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