메뉴 건너뛰기




Volumn , Issue , 2013, Pages 721-726

Using document summarization techniques for speech data subset selection

Author keywords

[No Author keywords available]

Indexed keywords

ACOUSTIC DATA; DATA SUBSETS; DOCUMENT SUMMARIZATION; FUNCTION OPTIMIZATION; PHONE RECOGNITION; RANDOM SELECTION; SPEECH DATA; SUBMODULAR FUNCTIONS; SUBSET SELECTION;

EID: 84926184611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (88)

References (14)
  • 1
    • 68149178821 scopus 로고    scopus 로고
    • Training data selection for improving discriminative training of acoustic models
    • B. Chen, S. H Liu, and F. H. Chu. 2009. Training data selection for improving discriminative training of acoustic models. Pattern Recognition Letters, 30:1228-1235.
    • (2009) Pattern Recognition Letters , vol.30 , pp. 1228-1235
    • Chen, B.1    Liu, S.H.2    Chu, F.H.3
  • 2
    • 0002167079 scopus 로고
    • Combinatorial Structures and their Applications, chapter Submodular functions, matroids and certain polyhedra
    • J. Edmonds, 1970. Combinatorial Structures and their Applications, chapter Submodular functions, matroids and certain polyhedra, pages 69-87. Gordon and Breach.
    • (1970) Gordon and Breach , pp. 69-87
    • Edmonds, J.1
  • 3
    • 0036293684 scopus 로고    scopus 로고
    • Active learning for automatic speech recognition
    • G. Hakkani-Tur, G. Riccardi, and A. Gorin. 2002. Active learning for automatic speech recognition. In Proc. of ICASSP, pages 3904-3907.
    • (2002) Proc. of ICASSP , pp. 3904-3907
    • Hakkani-Tur, G.1    Riccardi, G.2    Gorin, A.3
  • 7
    • 0036460908 scopus 로고    scopus 로고
    • Lightly supervised and unsupervised acoustic model training
    • L. Lamel, J. L. Gauvain, and G. Adda. 2002. Lightly supervised and unsupervised acoustic model training. Computer, Speech and Language, 16:116-125.
    • (2002) Computer, Speech and Language , vol.16 , pp. 116-125
    • Lamel, L.1    Gauvain, J.L.2    Adda, G.3
  • 8
    • 0024768209 scopus 로고
    • Speaker-independent phone recognition using Hidden Markov Models
    • K. F. Lee and H. W. Hon. 1989. Speaker-independent phone recognition using Hidden Markov Models. IEEE Trans. ASSP, 37:1641-1648.
    • (1989) IEEE Trans. ASSP , vol.37 , pp. 1641-1648
    • Lee, K.F.1    Hon, H.W.2
  • 10
    • 84859070008 scopus 로고    scopus 로고
    • A class of submodular functions for document summarization
    • H. Lin and J. Bilmes. 2011. A class of submodular functions for document summarization. In Proceedings of ACL.
    • (2011) Proceedings of ACL
    • Lin, H.1    Bilmes, J.2
  • 11
    • 84976447702 scopus 로고    scopus 로고
    • A comparison of the data requirements of automatic speech recognition systems and human listeners
    • R. K. Moore. 2003. A comparison of the data requirements of automatic speech recognition systems and human listeners. In Proceedings of Eurospeech, pages 2581-2584.
    • (2003) Proceedings of Eurospeech , pp. 2581-2584
    • Moore, R.K.1
  • 12
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular functions-I
    • G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. 1978. An analysis of approximations for maximizing submodular functions-I. Math. Program., 14:265-294.
    • (1978) Math. Program. , vol.14 , pp. 265-294
    • Nemhauser, G.L.1    Wolsey, L.A.2    Fisher, M.L.3
  • 13
    • 24944584599 scopus 로고    scopus 로고
    • Efficien computation of of gapped substring kernels for large alphabets
    • J. Rousu and J. Shawe-Taylor. 2005. Efficien computation of of gapped substring kernels for large alphabets. Journal of Machine Leaning Research, 6:13231344.
    • (2005) Journal of Machine Leaning Research , vol.6 , pp. 13231344
    • Rousu, J.1    Shawe-Taylor, J.2


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