Search

Purpose: Short- and long-term complications of gestational diabetes mellitus (GDM) involving pregnancies and offspring warrant the development of an effective individualized risk prediction model to reduce and prevent GDM together with its associated co-morbidities. The aim is to use machine learning (ML) algorithms to study data gathered throughout the first trimester in order to predict GDM., Methods: Two independent cohorts with forty-five features gathered through first trimester were included. We constructed prediction models based on three different algorithms and traditional logistic regression, and deployed additional two ensemble algorithms to identify the importance of individual features., Results: 4799 and 2795 pregnancies were included in the Xinhua Hospital Chongming branch (XHCM) and the Shanghai Pudong New Area People's Hospital (SPNPH) cohorts, respectively. Extreme gradient boosting (XGBoost) predicted GDM with moderate performance (the area under the receiver operating curve (AUC) = 0.75) at pregnancy initiation and good-to-excellent performance (AUC = 0.99) at the end of the first trimester in the XHCM cohort. The trained XGBoost showed moderate performance in the SPNPH cohort (AUC = 0.83). The top predictive features for GDM diagnosis were pre-pregnancy BMI and maternal abdominal circumference at pregnancy initiation, and FPG and HbA1c at the end of the first trimester., Conclusion: Our work demonstrated that ML models based on the data gathered throughout the first trimester achieved moderate performance in the external validation cohort., (© 2023. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.)

An algorithm for the two-stage robust optimization surgery-to-operating room allocation problem is presented. The second-stage problem is an integer linear program whose convex hull is approximated using three types of specialized valid inequalities and Chvátal-Gomory cuts. The resulting linear relaxation of the second-stage problem is then dualized and integrated into the first-stage problem. The resulting mixed integer linear program, which is an approximation of the original problem, is then solved using a commercial solver. If the solution of this model is not optimal for the second-stage problem, valid inequalities for the second-stage problem are generated, yielding a type of column-generation based approach that we refer to as the sequential follower refinement (SFR) algorithm. Data from an academic medical center are used to compare the computational performance of SFR with the constraint and column generation (C&CG) algorithm, which is the only exact approach that has been specifically applied for this problem in the literature. An extensive numerical study of SFR and its computational characteristics is presented that shows that SFR yields better-quality solutions compared with C&CG, even as the termination criterion of SFR is met much sooner, especially for problems involving higher number of surgeries. History: Accepted by Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0191) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0191). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Cervical cancer is the most common cancer among women worldwide. The diagnosis and classification of cancer are extremely important, as it influences the optimal treatment and length of survival. The objective was to develop and validate a diagnosis system based on convolutional neural networks (CNN) that identifies cervical malignancies and provides diagnostic interpretability. A total of 8496 labeled histology images were extracted from 229 cervical specimens (cervical squamous cell carcinoma, SCC, n = 37; cervical adenocarcinoma, AC, n = 8; nonmalignant cervical tissues, n = 184). AlexNet, VGG-19, Xception, and ResNet-50 with five-fold cross-validation were constructed to distinguish cervical cancer images from nonmalignant images. The performance of CNNs was quantified in terms of accuracy, precision, recall, and the area under the receiver operating curve (AUC). Six pathologists were recruited to make a comparison with the performance of CNNs. Guided Backpropagation and Gradient-weighted Class Activation Mapping (Grad-CAM) were deployed to highlight the area of high malignant probability. The Xception model had excellent performance in identifying cervical SCC and AC in test sets. For cervical SCC, AUC was 0.98 (internal validation) and 0.974 (external validation). For cervical AC, AUC was 0.966 (internal validation) and 0.958 (external validation). The performance of CNNs falls between experienced and inexperienced pathologists. Grad-CAM and Guided Gard-CAM ensured diagnoses interpretability by highlighting morphological features of malignant changes. CNN is efficient for histological image classification tasks of distinguishing cervical malignancies from benign tissues and could highlight the specific areas of concern. All these findings suggest that CNNs could serve as a diagnostic tool to aid pathologic diagnosis. [ABSTRACT FROM AUTHOR]

The Transcatheter Aortic Valve Replacement (TAVR) procedure requires an initial consultation and a subsequent procedure by an interventionalist (IC) and surgeon. The IC-surgeon pair coordination is extremely challenging, especially at Mayo Clinic due to provider time commitments distributed across practice, research, and education activities. Current practice aims to establish the coordination manually, resulting in a scheduling process that is cumbersome and time consuming for the schedulers. We develop an algorithm for pairing ICs and surgeons that minimizes the lead time (days elapsed between the clinic consult and procedure). As compared to current practice, this algorithm is able to reduce average lead time by 59% and increase possible IC-surgeon pairs by 7%. The proposed algorithm is shown to be flexible enough to incorporate practice variations such as lead time upper bound and two procedure days for a single consult day. Algorithm alternatives are also presented for practices who may find the proposed algorithm infeasible for their practice. [ABSTRACT FROM AUTHOR]