메뉴 건너뛰기




Volumn 1720, Issue , 1999, Pages 219-230

Positive and unlabeled examples help learning

Author keywords

Data mining; Decision trees; PAC model; Positive examples; Statistical queries; Unlabeled examples

Indexed keywords

DATA MINING; DECISION TREES; TREES (MATHEMATICS);

EID: 84957055189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46769-6_18     Document Type: Conference Paper
Times cited : (83)

References (10)
  • 1
    • 0000492326 scopus 로고
    • Learning from noisy examples
    • [AL88]
    • [AL88] D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 343-370
    • Angluin, D.1    Laird, P.2
  • 2
    • 0031620208 scopus 로고    scopus 로고
    • Combining labeled and unlabeled data with cotraining
    • [BM98], ACM Press, New York, NY
    • [BM98] A. Blum and T. Mitchell. Combining labeled and unlabeled data with cotraining. In Proc. 11th Annu. Conf. on Comput. Learning Theory, pages 92-100. ACM Press, New York, NY, 1998.
    • (1998) Proc. 11th Annu. Conf. on Comput. Learning Theory , pp. 92-100
    • Blum, A.1    Mitchell, T.2
  • 5
    • 0027188175 scopus 로고
    • Efficient noise-tolerant learning from statistical queries
    • [Kea93], ACM Press, New York, NY
    • [Kea93] M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the 25th ACM Symposium on the Theory of Computing, pages 392-401. ACM Press, New York, NY, 1993.
    • (1993) Proceedings of the 25th ACM Symposium on the Theory of Computing , pp. 392-401
    • Kearns, M.1
  • 10
    • 0021518106 scopus 로고
    • A theory of the learnable
    • [Val84], November
    • [Val84] L.G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, November 1984.
    • (1984) Commun. ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1


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