TY - GEN
T1 - Predicting glaucoma progression using multi-task learning with heterogeneous features
AU - Maya, Shigeru
AU - Morino, Kai
AU - Yamanishi, Kenji
PY - 2015/1/7
Y1 - 2015/1/7
N2 - We consider the prediction of glaucomatous visual field loss based on patient datasets. It is critically important to predict how rapidly the disease is progressing in an individual patient. However, the number of measurements for each patient is so small that a reliable predictor cannot be constructed from the data of a single patient alone. In this paper, we propose a novel multi-task learning approach to this issue. Patient data consist of three features: patient ID, 74-dimensional visual loss values, and inspection time. We reduce the prediction problem into one of matrix completion for these features. Specifically, by assuming heterogeneity in the three features, we introduce similarity measures that reflect the unique statistical nature of the respective features to solve a specific type of matrix decomposition problem. For example, we employ Gaussian kernels as a similarity measure for visual field loss and a linear regression-type relation for the time feature. We empirically demonstrate that our proposed method works significantly better than the existing methods.
AB - We consider the prediction of glaucomatous visual field loss based on patient datasets. It is critically important to predict how rapidly the disease is progressing in an individual patient. However, the number of measurements for each patient is so small that a reliable predictor cannot be constructed from the data of a single patient alone. In this paper, we propose a novel multi-task learning approach to this issue. Patient data consist of three features: patient ID, 74-dimensional visual loss values, and inspection time. We reduce the prediction problem into one of matrix completion for these features. Specifically, by assuming heterogeneity in the three features, we introduce similarity measures that reflect the unique statistical nature of the respective features to solve a specific type of matrix decomposition problem. For example, we employ Gaussian kernels as a similarity measure for visual field loss and a linear regression-type relation for the time feature. We empirically demonstrate that our proposed method works significantly better than the existing methods.
UR - http://www.scopus.com/inward/record.url?scp=84921803226&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84921803226&partnerID=8YFLogxK
U2 - 10.1109/BigData.2014.7004241
DO - 10.1109/BigData.2014.7004241
M3 - Conference contribution
AN - SCOPUS:84921803226
T3 - Proceedings - 2014 IEEE International Conference on Big Data, IEEE Big Data 2014
SP - 261
EP - 270
BT - Proceedings - 2014 IEEE International Conference on Big Data, IEEE Big Data 2014
A2 - Chang, Wo
A2 - Huan, Jun
A2 - Cercone, Nick
A2 - Pyne, Saumyadipta
A2 - Honavar, Vasant
A2 - Lin, Jimmy
A2 - Hu, Xiaohua Tony
A2 - Aggarwal, Charu
A2 - Mobasher, Bamshad
A2 - Pei, Jian
A2 - Nambiar, Raghunath
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd IEEE International Conference on Big Data, IEEE Big Data 2014
Y2 - 27 October 2014 through 30 October 2014
ER -