Browse
Submit Data
Databases
API
Help

Dataset Information

27 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Ambiguous D-means fusion clustering algorithm based on ambiguous set theory: Special application in clustering of CT scan images of COVID-19.

ABSTRACT: Coronavirus Disease 2019 (COVID-19) has been considered one of the most critical diseases of the 21st century. Only early detection can aid in the prevention of personal transmission of the disease. Recent scientific research reports indicate that computed tomography (CT) images of COVID-19 patients exhibit acute infections and lung abnormalities. However, analyzing these CT scan images is very difficult because of the presence of noise and low-resolution. Therefore, this study suggests the development of a new early detection method to detect abnormalities in chest CT scan images of COVID-19 patients. By this motivation, a novel image clustering algorithm, called ambiguous D-means fusion clustering algorithm (ADMFCA), is introduced in this study. This algorithm is based on the newly proposed ambiguous set theory and associated concepts. The ambiguous set is used in the proposed technique to characterize the ambiguity associated with grayscale values of pixels as true, false, true-ambiguous and false-ambiguous. The proposed algorithm performs the clustering operation on the CT scan images based on the entropies of different grayscale values. Finally, a final outcome image is obtained from the clustered images by image fusion operation. The experiment is carried out on 40 different CT scan images of COVID-19 patients. The clustered images obtained by the proposed algorithm are compared to five well-known clustering methods. The comparative study based on statistical metrics shows that the proposed ADMFCA is more efficient than the five existing clustering methods.

SUBMITTER: Singh P

PROVIDER: S-EPMC8387206 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Unsupervised Cryo-EM Data Clustering through Adaptively Constrained K-Means Algorithm.

Project description:In single-particle cryo-electron microscopy (cryo-EM), K-means clustering algorithm is widely used in unsupervised 2D classification of projection images of biological macromolecules. 3D ab initio reconstruction requires accurate unsupervised classification in order to separate molecular projections of distinct orientations. Due to background noise in single-particle images and uncertainty of molecular orientations, traditional K-means clustering algorithm may classify images into wrong classes and produce classes with a large variation in membership. Overcoming these limitations requires further development on clustering algorithms for cryo-EM data analysis. We propose a novel unsupervised data clustering method building upon the traditional K-means algorithm. By introducing an adaptive constraint term in the objective function, our algorithm not only avoids a large variation in class sizes but also produces more accurate data clustering. Applications of this approach to both simulated and experimental cryo-EM data demonstrate that our algorithm is a significantly improved alterative to the traditional K-means algorithm in single-particle cryo-EM analysis.

| S-EPMC5154524 | biostudies-literature

A differential privacy protecting K-means clustering algorithm based on contour coefficients.

Project description:This paper, based on differential privacy protecting K-means clustering algorithm, realizes privacy protection by adding data-disturbing Laplace noise to cluster center point. In order to solve the problem of Laplace noise randomness which causes the center point to deviate, especially when poor availability of clustering results appears because of small privacy budget parameters, an improved differential privacy protecting K-means clustering algorithm was raised in this paper. The improved algorithm uses the contour coefficients to quantitatively evaluate the clustering effect of each iteration and add different noise to different clusters. In order to be adapted to the huge number of data, this paper provides an algorithm design in MapReduce Framework. Experimental finding shows that the new algorithm improves the availability of the algorithm clustering results under the condition of ensuring individual privacy without significantly increasing its operating time.

| S-EPMC6248925 | biostudies-literature

Differential privacy fuzzy C-means clustering algorithm based on gaussian kernel function.

Project description:Fuzzy C-means clustering algorithm is one of the typical clustering algorithms in data mining applications. However, due to the sensitive information in the dataset, there is a risk of user privacy being leaked during the clustering process. The fuzzy C-means clustering of differential privacy protection can protect the user's individual privacy while mining data rules, however, the decline in availability caused by data disturbances is a common problem of these algorithms. Aiming at the problem that the algorithm accuracy is reduced by randomly initializing the membership matrix of fuzzy C-means, in this paper, the maximum distance method is firstly used to determine the initial center point. Then, the gaussian value of the cluster center point is used to calculate the privacy budget allocation ratio. Additionally, Laplace noise is added to complete differential privacy protection. The experimental results demonstrate that the clustering accuracy and effectiveness of the proposed algorithm are higher than baselines under the same privacy protection intensity.

| S-EPMC7987176 | biostudies-literature

A quantum-clustering optimization method for COVID-19 CT scan image segmentation.

Project description:The World Health Organization (WHO) has declared Coronavirus Disease 2019 (COVID-19) as one of the highly contagious diseases and considered this epidemic as a global health emergency. Therefore, medical professionals urgently need an early diagnosis method for this new type of disease as soon as possible. In this research work, a new early screening method for the investigation of COVID-19 pneumonia using chest CT scan images has been introduced. For this purpose, a new image segmentation method based on K-means clustering algorithm (KMC) and novel fast forward quantum optimization algorithm (FFQOA) is proposed. The proposed method, called FFQOAK (FFQOA+KMC), initiates by clustering gray level values with the KMC algorithm and generating an optimal segmented image with the FFQOA. The main objective of the proposed FFQOAK is to segment the chest CT scan images so that infected regions can be accurately detected. The proposed method is verified and validated with different chest CT scan images of COVID-19 patients. The segmented images obtained using FFQOAK method are compared with various benchmark image segmentation methods. The proposed method achieves mean squared error, peak signal-to-noise ratio, Jaccard similarity coefficient and correlation coefficient of 712.30, 19.61, 0.90 and 0.91 in case of four experimental sets, namely Experimental_Set_1, Experimental_Set_2, Experimental_Set_3 and Experimental_Set_4, respectively. These four performance evaluation metrics show the effectiveness of FFQOAK method over these existing methods.

| S-EPMC8316646 | biostudies-literature

Diagnosis of COVID-19 using CT scan images and deep learning techniques.

Project description:Early diagnosis of the coronavirus disease in 2019 (COVID-19) is essential for controlling this pandemic. COVID-19 has been spreading rapidly all over the world. There is no vaccine available for this virus yet. Fast and accurate COVID-19 screening is possible using computed tomography (CT) scan images. The deep learning techniques used in the proposed method is based on a convolutional neural network (CNN). Our manuscript focuses on differentiating the CT scan images of COVID-19 and non-COVID 19 CT using different deep learning techniques. A self-developed model named CTnet-10 was designed for the COVID-19 diagnosis, having an accuracy of 82.1%. Also, other models that we tested are DenseNet-169, VGG-16, ResNet-50, InceptionV3, and VGG-19. The VGG-19 proved to be superior with an accuracy of 94.52% as compared to all other deep learning models. Automated diagnosis of COVID-19 from the CT scan pictures can be used by the doctors as a quick and efficient method for COVID-19 screening.

| S-EPMC7848247 | biostudies-literature

A novel harmony search-K means hybrid algorithm for clustering gene expression data.

Project description:Recent progress in bioinformatics research has led to the accumulation of huge quantities of biological data at various data sources. The DNA microarray technology makes it possible to simultaneously analyze large number of genes across different samples. Clustering of microarray data can reveal the hidden gene expression patterns from large quantities of expression data that in turn offers tremendous possibilities in functional genomics, comparative genomics, disease diagnosis and drug development. The k- ¬means clustering algorithm is widely used for many practical applications. But the original k-¬means algorithm has several drawbacks. It is computationally expensive and generates locally optimal solutions based on the random choice of the initial centroids. Several methods have been proposed in the literature for improving the performance of the k-¬means algorithm. A meta-heuristic optimization algorithm named harmony search helps find out near-global optimal solutions by searching the entire solution space. Low clustering accuracy of the existing algorithms limits their use in many crucial applications of life sciences. In this paper we propose a novel Harmony Search-K means Hybrid (HSKH) algorithm for clustering the gene expression data. Experimental results show that the proposed algorithm produces clusters with better accuracy in comparison with the existing algorithms.

| S-EPMC3563403 | biostudies-literature

CT-scan ancient DNA

Project description:Optimized DNA sampling of ancient bones using Computed Tomography (CT) scans

| PRJEB25493 | ENA

What to Do When K-Means Clustering Fails: A Simple yet Principled Alternative Algorithm.

Project description:The K-means algorithm is one of the most popular clustering algorithms in current use as it is relatively fast yet simple to understand and deploy in practice. Nevertheless, its use entails certain restrictive assumptions about the data, the negative consequences of which are not always immediately apparent, as we demonstrate. While more flexible algorithms have been developed, their widespread use has been hindered by their computational and technical complexity. Motivated by these considerations, we present a flexible alternative to K-means that relaxes most of the assumptions, whilst remaining almost as fast and simple. This novel algorithm which we call MAP-DP (maximum a-posteriori Dirichlet process mixtures), is statistically rigorous as it is based on nonparametric Bayesian Dirichlet process mixture modeling. This approach allows us to overcome most of the limitations imposed by K-means. The number of clusters K is estimated from the data instead of being fixed a-priori as in K-means. In addition, while K-means is restricted to continuous data, the MAP-DP framework can be applied to many kinds of data, for example, binary, count or ordinal data. Also, it can efficiently separate outliers from the data. This additional flexibility does not incur a significant computational overhead compared to K-means with MAP-DP convergence typically achieved in the order of seconds for many practical problems. Finally, in contrast to K-means, since the algorithm is based on an underlying statistical model, the MAP-DP framework can deal with missing data and enables model testing such as cross validation in a principled way. We demonstrate the simplicity and effectiveness of this algorithm on the health informatics problem of clinical sub-typing in a cluster of diseases known as parkinsonism.

| S-EPMC5036949 | biostudies-literature

Single-Cell Transcriptome Data Clustering via Multinomial Modeling and Adaptive Fuzzy K-Means Algorithm.

Project description:Single-cell RNA sequencing technologies have enabled us to study tissue heterogeneity at cellular resolution. Fast-developing sequencing platforms like droplet-based sequencing make it feasible to parallel process thousands of single cells effectively. Although a unique molecular identifier (UMI) can remove bias from amplification noise to a certain extent, clustering for such sparse and high-dimensional large-scale discrete data remains intractable and challenging. Most existing deep learning-based clustering methods utilize the mean square error or negative binomial distribution with or without zero inflation to denoise single-cell UMI count data, which may underfit or overfit the gene expression profiles. In addition, neglecting the molecule sampling mechanism and extracting representation by simple linear dimension reduction with a hard clustering algorithm may distort data structure and lead to spurious analytical results. In this paper, we combined the deep autoencoder technique with statistical modeling and developed a novel and effective clustering method, scDMFK, for single-cell transcriptome UMI count data. ScDMFK utilizes multinomial distribution to characterize data structure and draw support from neural network to facilitate model parameter estimation. In the learned low-dimensional latent space, we proposed an adaptive fuzzy k-means algorithm with entropy regularization to perform soft clustering. Various simulation scenarios and the analysis of 10 real datasets have shown that scDMFK outperforms other state-of-the-art methods with respect to data modeling and clustering algorithms. Besides, scDMFK has excellent scalability for large-scale single-cell datasets.

| S-EPMC7180207 | biostudies-literature

COVID-19 identification and analysis using CT scan images: Deep transfer learning-based approach

Project description:Due to this epidemic of COVID-19, the everyday lives, welfare, and wealth of a country are affected. Inefficiency, a lack of medical diagnostics, and inadequately trained healthcare professionals are among the most significant barriers to arresting the development of this disease. Blockchain offers enormous promise for providing consistent and reliable real time and smart health facilities offsite. The infected patients with COVID-19 have shown they often have a lung infection upon arrival. It can be detected and analyzed using CT scan images. Unfortunately, though, it is time-consuming and liable to error. Thus, the assessment of chest CT scans must be automated. The proposed method uses transfer deep learning techniques to analyze CT scan images automatically. Transfer deep learning can improve the parameters of networks on huge databases, and pretrained networks can be used effectively on small datasets. We proposed a model built on VGGNet19, a convolutional neural network to classify individuals infected with coronavirus utilizing images of CT radiographs. We have used a globally accessible CT scan database that included 2500 CT pictures with COVID-19 infection and 2500 CT images without COVID-19 infection. An extensive experiment has been conducted using three deep learning methods such as VGG19, Xception Net, and CNN. Experiment findings indicate that the proposed model outperforms the other Xception Net and CNN models considerably. The results demonstrate that the proposed models have an accuracy of up to 95% and area under the receiver operating characteristic curve up to 95%.

| S-EPMC9212254 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data