Graph-based learning for phonetic classification

被引:6
作者
Alexandrescu, Andrei [1 ]
Kirchhoff, Katrin [2 ]
机构
[1] Univ Washington, Dept Comp Sci, Seattle, WA 98195 USA
[2] Univ Washington, Dept Elect Engn, Seattle, WA 98195 USA
来源
2007 IEEE WORKSHOP ON AUTOMATIC SPEECH RECOGNITION AND UNDERSTANDING, VOLS 1 AND 2 | 2007年
关键词
acoustic modeling; graph-based learning; classification; adaptation;
D O I
10.1109/ASRU.2007.4430138
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce graph-based learning for acoustic-phonetic classification. In graph-based learning, training and test data points are jointly represented in a weighted undirected graph characterized by a weight matrix indicating similarities between different samples. Classification of test samples is achieved by label propagation over the entire graph. Although this learning technique is commonly applied in semi-supervised settings, we show how it can also be used as a post-processing step to a supervised classifier by imposing additional regularization constraints based on the underlying data manifold. We also present a technique to adapt graph-based learning to large datasets and evaluate our system on a vowel classification task. Our results show that graph-based learning improves significantly over state-of-the art baselines.
引用
收藏
页码:359 / +
页数:2
相关论文
共 20 条
[1]  
ALEXANDRESCU A, 2007, HLT
[2]  
Belkin M., 2005, P 10 INT WORKSH ART
[3]  
BLUM A, 2004, ICML 04, P13
[4]  
Blum A., 2001, P 18 INT C MACH LEAR, P19, DOI DOI 10.1184/R1/6606860.V1
[5]  
Bourlard H. A., 1994, Connectionist speech recognition: a hybrid approach
[6]  
GALES M, 1996, COMPUTER SPEECH LANG
[7]  
GANAPATHIRAJU A, 2000, P NIPS
[8]   Maximum a Posteriori Estimation for Multivariate Gaussian Mixture Observations of Markov Chains [J].
Gauvain, Jean-Luc ;
Lee, Chin-Hui .
IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 1994, 2 (02) :291-298
[9]  
GOLDBERG A, 2006, HLT NAACL WORKSH GRA
[10]  
JOACHIMS T, 2003, P ICML