Herein, we aim to assess mortality risk prediction in peritoneal dialysis patients using machine-learning algorithms for proper prognosis prediction. A total of 1,730 peritoneal dialysis patients in the CRC for ESRD prospective cohort from 2008 to 2014 were enrolled in this study. Classification algorithms were used for prediction of N-year mortality including neural network. The survival hazard ratio was presented by machine-learning algorithms using survival statistics and was compared to conventional algorithms. A survival-tree algorithm presented the most accurate prediction model and outperformed a conventional method such as Cox regression (concordance index 0.769 vs 0.745). Among various survival decision-tree models, the modified Charlson Comorbidity index (mCCI) was selected as the best predictor of mortality. If peritoneal dialysis patients with high mCCI (>4) were aged ≥70.5 years old, the survival hazard ratio was predicted as 4.61 compared to the overall study population. Among the various algorithm using longitudinal data, the AUC value of logistic regression was augmented at 0.804. In addition, the deep neural network significantly improved performance to 0.841. We propose machine learning-based final model, mCCI and age were interrelated as notable risk factors for mortality in Korean peritoneal dialysis patients.

In laser powder bed fusion, a convolutional neural network could build a good regression model to predict a laser power value from a melt-pool image. To empirically validate it, we used the acquired image data from a monitoring system inside metal additive manufacturing equipment and optimally configured a convolutional network by the grid search of hyper-parameters. The proposed network showed only 0.12 % of test images were out of the criterion for judging the predicted laser power value to be reliable and showed more accurate results than deep feed-forward neural network in the prediction of laser power states unseen in training steps. We expect that the proposed model could be utilized to discover the problematic position in additive-manufactured layers causing defects during a process.

In this work, we seek new insights into the underlying challenges of the scene graph generation (SGG) task. Quantitative and qualitative analysis of the visual genome (VG) dataset implies: 1) ambiguity: even if interobject relationship contains the same object (or predicate), they may not be visually or semantically similar; 2) asymmetry: despite the nature of the relationship that embodied the direction, it was not well addressed in previous studies; and 3) higher-order contexts: leveraging the identities of certain graph elements can help generate accurate scene graphs. Motivated by the analysis, we design a novel SGG framework, Local-to-global interaction networks (LOGINs). Locally, interactions extract the essence between three instances of subject, object, and background, while baking direction awareness into the network by explicitly constraining the input order of subject and object. Globally, interactions encode the contexts between every graph component (i.e., nodes and edges). Finally, Attract and Repel loss is utilized to fine-tune the distribution of predicate embeddings. By design, our framework enables predicting the scene graph in a bottom-up manner, leveraging the possible complementariness. To quantify how much LOGIN is aware of relational direction, a new diagnostic task called Bidirectional Relationship Classification (BRC) is also proposed. Experimental results demonstrate that LOGIN can successfully distinguish relational direction than existing methods (in BRC task), while showing state-of-the-art results on the VG benchmark (in SGG task).

Visual understanding of the implied knowledge in line charts is an important task affecting many downstream tasks in information retrieval. Despite common use, clearly defining the knowledge is difficult because of ambiguity, so most methods used in research implicitly learn the knowledge. When building a deep neural network, the integrated approach hides the properties of individual subtasks, which can hinder finding the optimal configurations for the understanding task in academia. In this paper, we propose a problem definition for explicitly understanding knowledge in a line chart and provide an algorithm for generating supervised data that are easy to share and scale-up. To introduce the properties of the definition and data, we set well-known and modified convolutional neural networks and evaluate their performance on real and synthetic datasets for qualitative and quantitative analyses. In the results, the knowledge is explicitly extracted and the generated synthetic data show patterns similar to human-labeled data. This work is expected to provide a separate and scalable environment to enhance research into technical document understanding.