Improving blood glucose level predictability using machine learning.

This study was designed to improve blood glucose level predictability and future hypoglycemic and hyperglycemic event alerts through a novel patient-specific supervised-machine-learning (SML) analysis of glucose level based on a continuous-glucose-monitoring system (CGM) that needs no human intervention, and minimises false-positive alerts. The CGM data over 7 to 50 non-consecutive days from 11 type-1 diabetic patients aged 18 to 39 with a mean HbA1C of 7.5% ± 1.2% were analysed using four SML models. The algorithm was constructed to choose the best-fit model for each patient. Several statistical parameters were calculated to aggregate the magnitudes of the prediction errors. The personalised solutions provided by the algorithm were effective in predicting glucose levels 30 minutes after the last measurement. The average root-mean-square-error was 20.48 mg/dL and the average absolute-mean-error was 15.36 mg/dL when the best-fit model was selected for each patient. Using the best-fit-model, the true-positive-hypoglycemia-prediction-rate was 64%, whereas the false-positive- rate was 4.0%, and the false-negative-rate was 0.015%. Similar results were found even when only CGM samples below 70 were considered. The true-positive-hyperglycemia-prediction-rate was 61%. State-of-the-art SML tools are effective in predicting the glucose level values of patients with type-1diabetes and notifying these patients of future hypoglycemic and hyperglycemic events, thus improving glycemic control. The algorithm can be used to improve the calculation of the basal insulin rate and bolus insulin, and suitable for a closed loop "artificial pancreas" system. The algorithm provides a personalised medical solution that can successfully identify the best-fit method for each patient.

Automatic identification of optimal marker genes for phenotypic and taxonomic groups of microorganisms.

Finding optimal markers for microorganisms important in the medical, agricultural, environmental or ecological fields is of great importance. Thousands of complete microbial genomes now available allow us, for the first time, to exhaustively identify marker proteins for groups of microbial organisms. In this work, we model the biological task as the well-known mathematical "hitting set" problem, solving it based on both greedy and randomized approximation algorithms. We identify unique markers for 17 phenotypic and taxonomic microbial groups, including proteins related to the nitrite reductase enzyme as markers for the non-anammox nitrifying bacteria group, and two transcription regulation proteins, nusG and yhiF, as markers for the Archaea and Escherichia/Shigella taxonomic groups, respectively. Additionally, we identify marker proteins for three subtypes of pathogenic E. coli, which previously had no known optimal markers. Practically, depending on the completeness of the database this algorithm can be used for identification of marker genes for any microbial group, these marker genes may be prime candidates for the understanding of the genetic basis of the group's phenotype or to help discover novel functions which are uniquely shared among a group of microbes. We show that our method is both theoretically and practically efficient, while establishing an upper bound on its time complexity and approximation ratio; thus, it promises to remain efficient and permit the identification of marker proteins that are specific to phenotypic or taxonomic groups, even as more and more bacterial genomes are being sequenced.