메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Active learning for probabilistic hypotheses using the maximum Gibbs error criterion

Author keywords

[No Author keywords available]

Indexed keywords

TEXT PROCESSING;

EID: 84898957551     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (41)

References (16)
  • 2
    • 84856462978 scopus 로고    scopus 로고
    • Adaptive submodularity: Theory and applications in active learning and stochastic optimization
    • Daniel Golovin and Andreas Krause. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. Journal of Artificial Intelligence Research, 42(1):427-486, 2011.
    • (2011) Journal of Artificial Intelligence Research , vol.42 , Issue.1 , pp. 427-486
    • Golovin, D.1    Krause, A.2
  • 3
    • 84897484375 scopus 로고    scopus 로고
    • Near-optimal batch mode active learning and adaptive submodular optimization
    • Yuxin Chen and Andreas Krause. Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization. In International Conference on Machine Learning (ICML), pages 160-168, 2013.
    • (2013) International Conference on Machine Learning (ICML) , pp. 160-168
    • Chen, Y.1    Krause, A.2
  • 4
    • 2342547094 scopus 로고    scopus 로고
    • Nonextensive statistical mechanics: A brief introduction
    • Constantino Tsallis and Edgardo Brigatti. Nonextensive statistical mechanics: A brief introduction. Continuum Mechanics and Thermodynamics, 16(3):223-235, 2004.
    • (2004) Continuum Mechanics and Thermodynamics , vol.16 , Issue.3 , pp. 223-235
    • Tsallis, C.1    Brigatti, E.2
  • 7
    • 36749048256 scopus 로고    scopus 로고
    • The implication problem for measure-based constraints
    • Bassem Sayrafi, Dirk Van Gucht, and Marc Gyssens. The implication problem for measure-based constraints. Information Systems, 33(2):221-239, 2008.
    • (2008) Information Systems , vol.33 , Issue.2 , pp. 221-239
    • Sayrafi, B.1    Van Gucht, D.2    Gyssens, M.3
  • 8
    • 0010814278 scopus 로고
    • Best algorithms for approximating the maximum of a submodular set function
    • G.L. Nemhauser and L.A. Wolsey. Best Algorithms for Approximating the Maximum of a Submodular Set Function. Mathematics of Operations Research, 3(3):177-188, 1978.
    • (1978) Mathematics of Operations Research , vol.3 , Issue.3 , pp. 177-188
    • Nemhauser, G.L.1    Wolsey, L.A.2
  • 12
    • 80053375448 scopus 로고    scopus 로고
    • An analysis of active learning strategies for sequence labeling tasks
    • Association for Computational Linguistics
    • Burr Settles and Mark Craven. An Analysis of Active Learning Strategies for Sequence Labeling Tasks. In Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1070-1079. Association for Computational Linguistics, 2008.
    • (2008) Conference on Empirical Methods in Natural Language Processing (EMNLP) , pp. 1070-1079
    • Settles, B.1    Craven, M.2
  • 13
    • 0010226736 scopus 로고    scopus 로고
    • A probabilistic analysis of the rocchio algorithm with tfidf for text categorization
    • Thorsten Joachims. A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization. Technical report, DTIC Document, 1996.
    • (1996) Technical Report DTIC Document
    • Joachims, T.1


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