Search

Analyzing the relationships among various drugs is an essential issue in the field of computational biology. Different kinds of informative knowledge, such as drug repurposing, can be extracted from drug-drug relationships. Scientific literature represents a rich source for the retrieval of knowledge about the relationships between biological concepts, mainly drug-drug, disease-disease, and drug-disease relationships. In this paper, we propose DDREL as a general-purpose method that applies deep learning on scientific literature to automatically extract the graph of syntactic and semantic relationships among drugs. DDREL remarkably outperforms the existing human drug network method and a random network respected to average similarities of drugs' anatomical therapeutic chemical (ATC) codes. DDREL is able to shed light on the existing deficiency of the ATC codes in various drug groups. From the DDREL graph, the history of drug discovery became visible. In addition, drugs that had repurposing score 1 (diflunisal, pargyline, fenofibrate, guanfacine, chlorzoxazone, doxazosin, oxymetholone, azathioprine, drotaverine, demecarium, omifensine, yohimbine) were already used in additional indication. The proposed DDREL method justifies the predictive power of textual data in PubMed abstracts. DDREL shows that such data can be used to 1- Predict repurposing drugs with high accuracy, and 2- Reveal existing deficiencies of the ATC codes in various drug groups. [ABSTRACT FROM AUTHOR]

Regularization is an essential aspect in the context of deep learning as it mitigates the risk of overfitting in deep neural networks. This study presents a novel deep learning regularization method, referred to DL-Reg, which effectively reduces the nonlinearity of deep networks by enforcing linearity to a certain extent. The proposed method is based on the incorporation of a linear constraint into the objective function of deep neural networks, which is defined as the error of a linear mapping from the inputs to the outputs of the model. Specifically, DL-Reg imposes a linear constraint on the network, which is further adjusted by a regularization factor, thereby preventing the network from overfitting. The effectiveness of DL-Reg is evaluated by training state-of-the-art deep network models on several benchmark datasets. The results of the experiments demonstrate that the proposed regularization method provides significant improvements over existing regularization techniques and enhances the performance of deep neural networks, particularly when dealing with small-sized training datasets. The main code of DL-Reg written in PyTorch is also available here: https://github.com/m2dgithub/DL-Reg.git. • Regularizing deep networks using a linear regression model. • Allowing supervised deep networks to be trained using the semi-supervised learning. • Increasing the performance of deep networks on the small-sized dataset. • Conducting extensive experiments to certify the significance of the proposed method. [ABSTRACT FROM AUTHOR]

• Training of a deep neural network for dehazing with unmatched training data. • Improvements over existing methods from based on objective PSNR and SSIM measures. • Demonstration of training method that can be applied to vision tasks. • Demonstration of effects of Haze on Object Detection Models. The rapid growth in computer vision applications that are affected by environmental conditions challenge the limitations of existing techniques. This is driving the development of new deep learning based vision techniques that are robust to environmental noise and interference. We propose a novel deep CNN model, which is trained from unmatched images for the purpose of image dehazing. This solution is enabled by the concept of the Siamese network architecture. Using object performance measures of image PSNR and SSIM we are able to demonstrate a quantitative and qualitative improvement in the network dehazing performance. This superior performance is achieved with significantly smaller training datasets than existing methods. [ABSTRACT FROM AUTHOR]