Websterberger3274

Z Iurium Wiki

Verze z 3. 10. 2024, 17:33, kterou vytvořil Websterberger3274 (diskuse | příspěvky) (Založena nová stránka s textem „Accurate breast cancer detection using automated algorithms remains a problem within the literature. Although a plethora of work has tried to address this…“)
(rozdíl) ← Starší verze | zobrazit aktuální verzi (rozdíl) | Novější verze → (rozdíl)

Accurate breast cancer detection using automated algorithms remains a problem within the literature. Although a plethora of work has tried to address this issue, an exact solution is yet to be found. This problem is further exacerbated by the fact that most of the existing datasets are imbalanced, i.e. the number of instances of a particular class far exceeds that of the others. In this paper, we propose a framework based on the notion of transfer learning to address this issue and focus our efforts on histopathological and imbalanced image classification. We use the popular VGG-19 as the base model and complement it with several state-of-the-art techniques to improve the overall performance of the system. With the ImageNet dataset taken as the source domain, we apply the learned knowledge in the target domain consisting of histopathological images. With experimentation performed on a large-scale dataset consisting of 277,524 images, we show that the framework proposed in this paper gives superior performance than those available in the existing literature. Through numerical simulations conducted on a supercomputer, we also present guidelines for work in transfer learning and imbalanced image classification.To understand the underlying biological mechanisms of gene expression data, it is important to discover the groups of genes that have similar expression patterns under certain subsets of conditions. Biclustering algorithms have been effective in analyzing large-scale gene expression data. Recently, traditional biclustering has been improved by introducing biological knowledge along with the expression data during the biclustering process. In this paper, we propose the Pathway-based Order Preserving Biclustering (POPBic) algorithm by incorporating Kyoto Encyclopedia of Genes and Genomes (KEGG) based on the hypothesis that two genes sharing similar pathways are likely to be similar. The basic principle of the POPBic approach is to apply the concept of longest common subsequence between a pair of genes which have a high number of common pathways. The algorithm identifies the expression patterns from data using two major steps (i) selection of significant seed genes, and (ii) extraction of biclusters. We have performed exhaustive experimentation with the POPBic algorithm using synthetic dataset to evaluate the bicluster model, finding its robustness in the presence of noise and identifying overlapping biclusters. We demonstrate that POPBic discovers biologically significant biclusters for four cancer microarray gene expression datasets. POPBic has been found to perform consistently well in comparison to its closest competitors.Graph models often give us a deeper understanding of real-world networks. In the case of biological networks they help in predicting the evolution and history of biomolecule interactions, provided we map properly real networks into the corresponding graph models. In this paper, we show that for biological graph models many of the existing parameter estimation techniques overlook the critical property of graph symmetry (also known formally as graph automorphisms), thus the estimated parameters give statistically insignificant results concerning the observed network. To demonstrate it and to develop accurate estimation procedures, we focus on the biologically inspired duplication-divergence model, and the up-to-date data of protein-protein interactions of seven species including human and yeast. Using exact recurrence relations of some prominent graph statistics, we devise a parameter estimation technique that provides the right order of symmetries and uses phylogenetically old proteins as the choice of seed graph nodes. We also find that our results are consistent with the ones obtained from maximum likelihood estimation (MLE). However, the MLE approach is significantly slower than our methods in practice.Identifying motifs in promoter regions is crucial to our understanding of transcription regulation. Researchers commonly use known promoter features in a variety of species to predict promoter motifs. However the results are not particularly useful. Different species rarely have similar features in promoter binding sites. In this study, we adopt sequence analysis techniques to find the possible promoter binding sites among all species. We sought to improve the existing algorithm to suit the task of mining sequential patterns with specific number of gaps. Moreover, we discuss the implementation of proposed method in a distributed environment. The proposed method finds the transcription start sites (TSS) and extracts possible promoter regions from DNA sequences according to TSS. We derived the motifs in the possible promoter regions, while taking into account the number of gaps in the motifs to deal with unimportant nucleotides. The motifs generated from promoter regions using the proposed methodology were shown to tolerate unimportant nucleotides. A comparison with known promoter motifs verified the efficacy of the proposed method.Segmenting small retinal vessels with width less than 2 pixels in fundus images is a challenging task. In this paper, in order to effectively segment the vessels, especially the narrow parts, we propose a local regression scheme to enhance the narrow parts, along with a novel multi-label classification method based on this scheme. We consider five labels for blood vessels and background in particular the center of big vessels, the edge of big vessels, the center as well as the edge of small vessels, the center of background, and the edge of background. We first determine the multi-label by the local de-regression model according to the vessel pattern from the ground truth images. Then, we train a convolutional neural network (CNN) for multi-label classification. Next, we perform a local regression method to transform the previous multi-label into binary label to better locate small vessels and generate an entire retinal vessel image. Our method is evaluated using two publicly available datasets and compared with several state-of-the-art studies. https://www.selleckchem.com/products/elexacaftor.html The experimental results have demonstrated the effectiveness of our method in segmenting retinal vessels.

Autoři článku: Websterberger3274 (Clements Ibrahim)