TY - GEN
T1 - Partially Labeled Data Tuple Can Optimize Multivariate Performance Measures
AU - Wang, Jim Jing-Yan
AU - Gao, Xin
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/12/1
Y1 - 2016/12/1
N2 - Multivariate performance measure optimization refers to learn ing predictive models such that a desired complex performance measure can be optimized over a training set, such as the F1 score. Up to now, all the existing multivariate performance measure optimization methods are limited to a completely labeled data tuple, i.e., the label tuple is complete. However, in real-world applications, sometimes it is difficult to obtain a complete label tuple. In this paper, we show that the multivariate performance measures can also be optimized by learning from partially labeled data tuple, when the label tuple is incomplete. We introduce a slack label tuple to represent the sought complete true label tuple, and learn it jointly with a hyper predictor, so that it can be consistent to the known labels, prediction results, and is smooth in the neighborhood. We develop an iterative learning algorithm to learn the slack label tuple and the hyper predictor. Its advantage over state-of-the-art multivariate performance measure optimization methods is shown by experiments on benchmark data sets.
AB - Multivariate performance measure optimization refers to learn ing predictive models such that a desired complex performance measure can be optimized over a training set, such as the F1 score. Up to now, all the existing multivariate performance measure optimization methods are limited to a completely labeled data tuple, i.e., the label tuple is complete. However, in real-world applications, sometimes it is difficult to obtain a complete label tuple. In this paper, we show that the multivariate performance measures can also be optimized by learning from partially labeled data tuple, when the label tuple is incomplete. We introduce a slack label tuple to represent the sought complete true label tuple, and learn it jointly with a hyper predictor, so that it can be consistent to the known labels, prediction results, and is smooth in the neighborhood. We develop an iterative learning algorithm to learn the slack label tuple and the hyper predictor. Its advantage over state-of-the-art multivariate performance measure optimization methods is shown by experiments on benchmark data sets.
UR - http://hdl.handle.net/10754/630849
UR - http://dl.acm.org/citation.cfm?doid=2806416.2806630
UR - http://www.scopus.com/inward/record.url?scp=84958236046&partnerID=8YFLogxK
U2 - 10.1145/2806416.2806630
DO - 10.1145/2806416.2806630
M3 - Conference contribution
SN - 9781450337946
SP - 1915
EP - 1918
BT - Proceedings of the 24th ACM International on Conference on Information and Knowledge Management - CIKM '15
PB - Association for Computing Machinery (ACM)
ER -