Bi-convex Optimization to Learn Classifiers from Multiple Biomedical Annotations.
The problem of constructing classifiers from multiple annotators who provide inconsistent training labels is important and occurs in many application domains. Many existing methods focus on the understanding and learning of the crowd behaviors. Several probabilistic algorithms consider the construction of classifiers for specific tasks using consensus of multiple labelers annotations. These methods impose a prior on the consensus and develop an expectation-maximization algorithm based on logistic regression loss. We extend the discussion to the hinge loss commonly used by support vector machines. Our formulations form bi-convex programs that construct classifiers and estimate the reliability of each labeler simultaneously. Each labeler is associated with a reliability parameter, which can be a constant, or class-dependent, or varies for different examples. The hinge loss is modified by replacing the true labels by the weighted combination of labelers' labels with reliabilities as weights. Statistical justification is discussed to motivate the use of linear combination of labels. In parallel to the expectation-maximization algorithm for logistic-based methods, efficient alternating algorithms are developed to solve the proposed bi-convex programs. Experimental results on benchmark datasets and three real-world biomedical problems demonstrate that the proposed methods either outperform or are competitive to the state of the art.
Xin
X
Wang
Jinbo
J
Bi
D000544:Alzheimer Disease / Q000000981:diagnostic imaging; D001185:Artificial Intelligence; D001943:Breast Neoplasms / Q000000981:diagnostic imaging; D066289:Data Curation / Q000145:classification*; D016208:Databases, Factual; D005149:Facial Expression; D005260:Female; D006801:Humans; D007090:Image Interpretation, Computer-Assisted; D008490:Medical Informatics / Q000379:methods*; D008962:Models, Theoretical; D060388:Support Vector Machine