A Globally-Variant Locally-Constant Model for Fusion of Labels from Multiple Diverse Experts without Using Reference Labels

被引:27
作者
Audhkhasi, Kartik [1 ]
Narayanan, Shrikanth [1 ]
机构
[1] Univ So Calif, Dept Elect Engn, SAIL, Los Angeles, CA 90089 USA
基金
美国国家科学基金会;
关键词
Multiple diverse experts; label fusion; label reliability; expectation-maximization algorithm; human annotation; emotion recognition;
D O I
10.1109/TPAMI.2012.139
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Researchers have shown that fusion of categorical labels from multiple experts-humans or machine classifiers-improves the accuracy and generalizability of the overall classification system. Simple plurality is a popular technique for performing this fusion, but it gives equal importance to labels from all experts, who may not be equally reliable or consistent across the dataset. Estimation of expert reliability without knowing the reference labels is, however, a challenging problem. Most previous works deal with these challenges by modeling expert reliability as constant over the entire data (feature) space. This paper presents a model based on the consideration that in dealing with real-world data, expert reliability is variable over the complete feature space but constant over local clusters of homogeneous instances. This model jointly learns a classifier and expert reliability parameters without assuming knowledge of the reference labels using the Expectation-Maximization (EM) algorithm. Classification experiments on simulated data, data from the UCI Machine Learning Repository, and two emotional speech classification datasets show the benefits of the proposed model. Using a metric based on the Jensen-Shannon divergence, we empirically show that the proposed model gives greater benefit for datasets where expert reliability is highly variable over the feature space.
引用
收藏
页码:769 / 783
页数:15
相关论文
共 32 条
[1]  
[Anonymous], P INT C AC SPEECH SI
[2]  
[Anonymous], POPULATION BIOL ABAL
[3]  
[Anonymous], P INT C
[4]  
[Anonymous], CHI2010 P 28 ANN
[5]  
[Anonymous], P 3 INT C AFF COMP I
[6]  
[Anonymous], 2006, PATTERN RECOGN
[7]  
[Anonymous], 2014, C4. 5: programs for machine learning
[8]  
[Anonymous], 2001, PATTERN CLASSIFICATI
[9]  
[Anonymous], 1996, P 5 TURKISH ARTIFICI
[10]  
[Anonymous], 2002, P INT C SPEECH PROSO