Clustering Algorithms: Their Application to Gene Expression Data
Jelili Oyelade,Itunuoluwa Isewon,Funke Oladipupo,Olufemi Aromolaran,Efosa Uwoghiren,Faridah Ameh,Moses Achas,Ezekiel Adebiyi +7 more
Reads0
Chats0
TLDR
This review examines the various clustering algorithms applicable to the gene expression data in order to discover and provide useful knowledge of the appropriate clustering technique that will guarantee stability and high degree of accuracy in its analysis procedure.Abstract:
Gene expression data hide vital information required to understand the biological process that takes place in a particular organism in relation to its environment. Deciphering the hidden patterns in gene expression data proffers a prodigious preference to strengthen the understanding of functional genomics. The complexity of biological networks and the volume of genes present increase the challenges of comprehending and interpretation of the resulting mass of data, which consists of millions of measurements; these data also inhibit vagueness, imprecision, and noise. Therefore, the use of clustering techniques is a first step toward addressing these challenges, which is essential in the data mining process to reveal natural structures and identify interesting patterns in the underlying data. The clustering of gene expression data has been proven to be useful in making known the natural structure inherent in gene expression data, understanding gene functions, cellular processes, and subtypes of cells, mining useful information from noisy data, and understanding gene regulation. The other benefit of clustering gene expression data is the identification of homology, which is very important in vaccine design. This review examines the various clustering algorithms applicable to the gene expression data in order to discover and provide useful knowledge of the appropriate clustering technique that will guarantee stability and high degree of accuracy in its analysis procedure.read more
Citations
More filters
Journal ArticleDOI
Bayesian cluster analysis
TL;DR: Bayesian cluster analysis offers substantial benefits over algorithmic approaches by providing not only point estimates but also uncertainty in the clustering structure and patterns within each cluster as mentioned in this paper , including both model-based and loss-based approaches, along with a discussion on the importance of the kernel or loss selected and prior specification.
Posted ContentDOI
Multi-Omics Binary Integration via Lasso Ensembles (MOBILE) for identification of context-specific networks and new regulatory mechanisms
Bertrand Guenin,Enzo Carpentieri +1 more
TL;DR: In this paper , a multi-omics data integration strategy called MOBILE (Multi-Omics Binary Integration via Lasso Ensembles) was developed to identify molecular features associated with specific cellular phenotypes.
Journal ArticleDOI
The transcriptome of rabbit conjunctiva in dry eye disease: Large-scale changes and similarity to the human dry eye
Adam Master,Apostolos Kontzias,Liqun Huang,Wei Huang,Anna Tsioulias,Samaneh Zarabi,Michael Wolek,Brian M. Wollocko,Robert Honkanen,Basil Rigas +9 more
TL;DR: In this article, the pathophysiology of dry eye disease (DED) remains largely unknown, accounting in part for the lack of successful treatments, and a rabbit model of chronic DED induced with 3 weekly injections of Concanavalin A into the periorbital lacrimal glands was explored.
Proceedings ArticleDOI
Single-cell Clustering Based on Word Embedding and Nonparametric Methods
Tianyu Wang,Sheida Nabavi +1 more
TL;DR: A new method that is based on a nonparametric Earth Mover's Distance and leveraging a novel word embedding approach to cluster cells and results indicate that GMD outperformed the methods in clustering single cells in terms of Adjusted Random Index and Fowlkes Mallows Index.
Journal ArticleDOI
Gene Expression Analysis through Parallel Non-Negative Matrix Factorization
TL;DR: This work proposes a clustering algorithm based on Non-negative Matrix Factorization and K-means to reduce data dimensionality but whilst preserving the biological context and prioritizing gene selection, and it is implemented within parallel GPU-based environments through the CUDA library.
References
More filters
Journal ArticleDOI
Maximum likelihood from incomplete data via the EM algorithm
Journal Article
Scikit-learn: Machine Learning in Python
Fabian Pedregosa,Gaël Varoquaux,Alexandre Gramfort,Vincent Michel,Bertrand Thirion,Olivier Grisel,Mathieu Blondel,Peter Prettenhofer,Ron Weiss,Vincent Dubourg,Jake Vanderplas,Alexandre Passos,David Cournapeau,Matthieu Brucher,Matthieu Perrot,Edouard Duchesnay +15 more
TL;DR: Scikit-learn is a Python module integrating a wide range of state-of-the-art machine learning algorithms for medium-scale supervised and unsupervised problems, focusing on bringing machine learning to non-specialists using a general-purpose high-level language.
Posted Content
Scikit-learn: Machine Learning in Python
Fabian Pedregosa,Gaël Varoquaux,Alexandre Gramfort,Vincent Michel,Bertrand Thirion,Olivier Grisel,Mathieu Blondel,Andreas Müller,Joel Nothman,Gilles Louppe,Peter Prettenhofer,Ron Weiss,Vincent Dubourg,Jake Vanderplas,Alexandre Passos,David Cournapeau,Matthieu Brucher,Matthieu Perrot,Edouard Duchesnay +18 more
TL;DR: Scikit-learn as mentioned in this paper is a Python module integrating a wide range of state-of-the-art machine learning algorithms for medium-scale supervised and unsupervised problems.
Some methods for classification and analysis of multivariate observations
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Proceedings Article
A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise
TL;DR: In this paper, a density-based notion of clusters is proposed to discover clusters of arbitrary shape, which can be used for class identification in large spatial databases and is shown to be more efficient than the well-known algorithm CLAR-ANS.