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
Posted Content
Weighted Cox regression for the prediction of heterogeneous patient subgroups
Katrin Madjar,Jörg Rahnenführer +1 more
TL;DR: A penalized Cox regression model with a weighted version of the Cox partial likelihood that includes patients of all subgroups but assigns them individual weights based on their subgroup affiliation is proposed.
Journal ArticleDOI
Enhancing semantic belief function to handle decision conflicts in SoS using k-means clustering.
Eman K. Elsayed,Eman K. Elsayed,Ahmed Sharaf Eldin Ahmed,Ahmed Sharaf Eldin Ahmed,Hebatullah Rashed Younes +4 more
TL;DR: The k-means clustering technique is adopted to enhance the detection and solving of conflict resulting while co-integrating new systems into an existing SoS, an enhancement of the Ontology Belief Function System of Systems (OBFSoS).
Journal ArticleDOI
Landslide Susceptibility Mapping Using DIvisive ANAlysis (DIANA) and RObust Clustering Using linKs (ROCK) Algorithms, and Comparison of Their Performance
TL;DR: Wang et al. as mentioned in this paper applied and compared the performance of DIvisive ANAlysis (DIANA) and RObust Clustering using linKs (ROCK) algorithms for landslide susceptibility mapping in the Baota District, China.
Book ChapterDOI
UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning
TL;DR: In this paper, the authors proposed a general Expectation-Maximization ensemble framework called UCSL (Unsupervised Clustering driven by Supervised Learning), which can integrate any clustering method and can be driven by binary classification and regression.
Journal ArticleDOI
Logical analysis of built-in DBSCAN Functions in Popular Data Science Programming Languages
TL;DR: A scientific way to assess the results of DBSCAN built-in function, as well as output inconsistencies are proposed, which reveals various differences and advises caution when working with built- in functionality.
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.