The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, which is used to cluster genes. FCM allows an object to belong to two or more clusters with a membership grade between zero and one and the sum of belonging to all clusters of each gene is equal to one. This paradigm is useful when dealing with microarray data. The total time required to implement the first model is 22.2589 s. The second model combines FCM and particle swarm optimization (PSO) to obtain better results. The hybrid algorithm, i.e., FCM–PSO, uses the DB index as objective function. The experimental results show that the proposed hybrid FCM–PSO method is effective. The total time of implementation of this model is 89.6087 s. The third model combines FCM with a genetic algorithm (GA) to obtain better results. This hybrid algorithm also uses the DB index as objective function. The experimental results show that the proposed hybrid FCM–GA method is effective. Its total time of implementation is 50.8021 s. In addition, this study uses cluster validity indexes to determine the best partitioning for the underlying data. Internal validity indexes include the Jaccard, Davies Bouldin, Dunn, Xie–Beni, and silhouette. Meanwhile, external validity indexes include Minkowski, adjusted Rand, and percentage of correctly categorized pairings. Experiments conducted on brain tumor gene expression data demonstrate that the techniques used in this study outperform traditional models in terms of stability and biological significance.
In this paper, some Bayes estimators of the reliability function of Gompertz distribution have been derived based on generalized weighted loss function. In order to get a best understanding of the behaviour of Bayesian estimators, a non-informative prior as well as an informative prior represented by exponential distribution is considered. Monte-Carlo simulation have been employed to compare the performance of different estimates for the reliability function of Gompertz distribution based on Integrated mean squared errors. It was found that Bayes estimators with exponential prior information under the generalized weighted loss function were generally better than the estimators based o
In present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.
In this study, we fabricated nanofiltration membranes using the electrospinning technique, employing pure PAN and a mixed matrix of PAN/HPMC. The PAN nanofibrous membranes with a concentration of 13wt% were prepared and blended with different concentrations of HPMC in the solvent N, N-Dimethylformamide (DMF). We conducted a comprehensive analysis of these membranes' surface morphology, chemical composition, wettability, and porosity and compared the results. The findings indicated that the inclusion of HPMC in the PAN membranes led to a reduction in surface porosity and fiber size. The contact angle decreased, indicating increased surface hydrophilicity, which can enhance flux and reduce fouling tendencies. Subsequently, we evaluated the e
... Show MoreAssume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).