메뉴 건너뛰기




Volumn 60, Issue 2, 2000, Pages 258-277

Structural results about exact learning with unspecified attribute values

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; MATHEMATICAL MODELS;

EID: 0033879318     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1638     Document Type: Article
Times cited : (6)

References (14)
  • 1
    • 0000710299 scopus 로고
    • Queries and concept learning
    • Angluin D. Queries and concept learning. Mach. Learning. 2:1988;319-342.
    • (1988) Mach. Learning , vol.2 , pp. 319-342
    • Angluin, D.1
  • 5
    • 58149319164 scopus 로고
    • Exact learning Boolean functions via the monotone theory
    • Bshouty N. H. Exact learning Boolean functions via the monotone theory. Inform. and Comput. 123:1995;146-153.
    • (1995) Inform. and Comput. , vol.123 , pp. 146-153
    • Bshouty, N.H.1
  • 8
    • 0025446773 scopus 로고
    • Learning nested differences of intersection-closed concept classes
    • Helmbold D., Sloan R., Warmuth M. K. Learning nested differences of intersection-closed concept classes. Mach. Learning. 5:1990;165-196.
    • (1990) Mach. Learning , vol.5 , pp. 165-196
    • Helmbold, D.1    Sloan, R.2    Warmuth, M.K.3
  • 9
    • 0028460231 scopus 로고
    • Efficient distribution-free learning of probabilistic concepts
    • Kearns M., Shapire R. E. Efficient distribution-free learning of probabilistic concepts. J. Comput. System Sci. 48:1994;464-497.
    • (1994) J. Comput. System Sci. , vol.48 , pp. 464-497
    • Kearns, M.1    Shapire, R.E.2
  • 10
    • 0028324717 scopus 로고
    • Cryptographic limitations on learning Boolean formulae and finite automata
    • Kearns M., Valiant L. G. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM. 41:1994;67-95.
    • (1994) J. ACM , vol.41 , pp. 67-95
    • Kearns, M.1    Valiant, L.G.2
  • 13
    • 0000586256 scopus 로고
    • Lower bound methods and separation results for on-line learning models
    • Maass W., Turán G. Lower bound methods and separation results for on-line learning models. Mach. Learning. 9:1992;107-145.
    • (1992) Mach. Learning , vol.9 , pp. 107-145
    • Maass, W.1    Turán, G.2


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