.png){kind=icon}
返回
Correlated Chained Gaussian Processes for Datasets With Multiple Annotators
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2021.3116943.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The labeling process within a supervised learning task is usually carried out by an expert, which provides the ground truth (gold standard) for each sample. However, in many real-world applications, we typically have access to annotations provided by crowds holding different and unknown expertise levels. Learning from crowds (LFC) intends to configure machine learning paradigms in the presence of multilabelers, residing on two key assumptions: the labeler's performance does not depend on the input space, and independence among the annotators is imposed. Here, we propose the correlated chained Gaussian processes from the multiple annotators (CCGPMA) approach, which models each annotator's performance as a function of the input space and exploits the correlations among experts. Experimental results associated with classification and regression tasks show that our CCGPMA performs better modeling of the labelers' behavior, indicating that it consistently outperforms other state-of-the-art LFC approaches.
Keyword:
Labeling
Codes
Supervised learning
Gaussian processes
Task analysis
Proposals
Kernel
Correlated chained Gaussian processes
multiple annotators (MAs)
semiparametric latent factor model (SLFM)
variational inference
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容