메뉴 건너뛰기




Volumn , Issue , 2014, Pages 3311-3315

Submodular subset selection for large-scale speech training data

Author keywords

automatic speech recognition; large scale systems; machine learning; speech processing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; SPEECH PROCESSING; SPEECH RECOGNITION;

EID: 84905251799     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2014.6854213     Document Type: Conference Paper
Times cited : (92)

References (19)
  • 5
    • 0036460908 scopus 로고    scopus 로고
    • Lightly supervised and unsupervised acoustic model training
    • Lori Lamel, Jean-Luc Gauvain, and Gilles Adda, "Lightly supervised and unsupervised acoustic model training," Computer Speech & Language, vol. 16, no. 1, pp. 115-129, 2002.
    • (2002) Computer Speech & Language , vol.16 , Issue.1 , pp. 115-129
    • Lamel, L.1    Gauvain, J.2    Adda, G.3
  • 6
    • 0342929892 scopus 로고    scopus 로고
    • Unsupervised training of a speech recognizer using TV broadcasts
    • Thomas Kemp and Alex Waibel, "Unsupervised training of a speech recognizer using TV broadcasts," in ICSLP, 1998, vol. 98, pp. 2207-2210.
    • (1998) ICSLP , vol.98 , pp. 2207-2210
    • Kemp, T.1    Waibel, A.2
  • 11
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions-I
    • G.L. Nemhauser, L.A.Wolsey, and M.L. Fisher, "An analysis of approximations for maximizing submodular set functions-I," Mathematical Programming, vol. 14, no. 1, pp. 265-294, 1978.
    • (1978) Mathematical Programming , vol.14 , Issue.1 , pp. 265-294
    • Nemhauser, G.L.1    Wolsey, L.A.2    Fisher, M.L.3
  • 12
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • U. Feige, "A threshold of ln n for approximating set cover," Journal of the ACM (JACM), vol. 45, no. 4, pp. 634-652, 1998.
    • (1998) Journal of the ACM (JACM) , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 13
    • 77951148076 scopus 로고
    • Accelerated greedy algorithms for maximizing submodular set functions
    • M. Minoux, "Accelerated greedy algorithms for maximizing submodular set functions," Optimization Techniques, pp. 234-243, 1978.
    • (1978) Optimization Techniques , pp. 234-243
    • Minoux, M.1
  • 15
    • 85162051091 scopus 로고    scopus 로고
    • Efficient minimization of decomposable submodular functions
    • P. Stobbe and A. Krause, "Efficient minimization of decomposable submodular functions," in NIPS, 2010.
    • (2010) NIPS
    • Stobbe, P.1    Krause, A.2


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