Data collaboration analysis in predicting diabetes from a small amount of health checkup data.

Recent studies showed that machine learning models such as gradient-boosting decision tree (GBDT) can predict diabetes with high accuracy from big data. In this study, we asked whether highly accurate prediction of diabetes is possible even from small data by expanding the amount of data through data collaboration (DC) analysis, a modern framework for integrating and analyzing data accumulated at multiple institutions while ensuring confidentiality. To this end, we focused on data from two institutions: health checkup data of 1502 citizens accumulated in Tsukuba City and health history data of 1399 patients collected at the University of Tsukuba Hospital. When using only the health checkup data, the ROC-AUC and Recall for logistic regression (LR) were 0.858 ± 0.014 and 0.970 ± 0.019, respectively, while those for GBDT were 0.856 ± 0.014 and 0.983 ± 0.016, respectively. When using also the health history data through DC analysis, these values for LR improved to 0.875 ± 0.013 and 0.993 ± 0.009, respectively, while those for GBDT deteriorated because of the low compatibility with a method used for confidential data sharing (although DC analysis brought improvements). Even in a situation where health checkup data of only 324 citizens are available, the ROC-AUC and Recall for LR were 0.767 ± 0.025 and 0.867 ± 0.04, respectively, thanks to DC analysis, indicating an 11% and 12% improvement. Thus, we concluded that the answer to the above question was "Yes" for LR but "No" for GBDT for the data set tested in this study.

Two efficient calculations of edit distance between marked point processes.

In this paper, we propose to use linear programming methods or a more specialized method, namely, the Hungarian method, for speeding up the exact calculation of an edit distance for marked point processes [Y. Hirata and K. Aihara, Chaos 25, 123117 (2015)]. The key observation is that the problem of calculating the edit distance reduces to a matching problem on a bipartite graph. Our preliminary numerical results show that the proposed implementations are faster than the conventional ones by a factor of 10-1000.