A modified hyperplane clustering algorithm allows for efficient and accurate clustering of extremely large datasets
TL;DR: A new two-stage algorithm which partitions the high-dimensional space associated with microarray data using hyperplanes and reduces the memory requirements allowing us to cluster 44 460 genes without failure and significantly decreases the time to complete when compared with popular k-means programs.
read more
Abstract: Motivation: As the number of publically available microarray experiments increases, the ability to analyze extremely large datasets across multiple experiments becomes critical. There is a requirement to develop algorithms which are fast and can cluster extremely large datasets without affecting the cluster quality. Clustering is an unsupervised exploratory technique applied to microarray data to find similar data structures or expression patterns. Because of the high input/output costs involved and large distance matrices calculated, most of the algomerative clustering algorithms fail on large datasets (30 000 + genes/200 + arrays). In this article, we propose a new two-stage algorithm which partitions the high-dimensional space associated with microarray data using hyperplanes. The first stage is based on the Balanced Iterative Reducing and Clustering using Hierarchies algorithm with the second stage being a conventional k-means clustering technique. This algorithm has been implemented in a software tool (HPCluster) designed to cluster gene expression data. We compared the clustering results using the two-stage hyperplane algorithm with the conventional k-means algorithm from other available programs. Because, the first stage traverses the data in a single scan, the performance and speed increases substantially. The data reduction accomplished in the first stage of the algorithm reduces the memory requirements allowing us to cluster 44 460 genes without failure and significantly decreases the time to complete when compared with popular k-means programs. The software was written in C# (.NET 1.1).
Availability: The program is freely available and can be downloaded from http://www.amdcc.org/bioinformatics/bioinformatics.aspx.
Contact: rmcindoe@mail.mcg.edu
Supplementary information:Supplementary data are available at Bioinformatics online.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Clustering of high throughput gene expression data
TL;DR: This paper presents a review of the current clustering algorithms designed especially for analyzing gene expression data and is intended to introduce one of the main problems in bioinformatics - clustering gene expressionData to the operations research community.
130
Prediction in Photovoltaic Power by Neural Networks
TL;DR: This paper presents three techniques based on neural and fuzzy neural networks, namely the radial basis function, the adaptive neuro-fuzzy inference system and the higher-order neuro-magnifying lens inference system, which are well suited to predict data sequences stemming from real-world applications.
57
Differential gene expression in the salivary gland during development and onset of xerostomia in Sjögren's syndrome-like disease of the C57BL/6.NOD- Aec1Aec2 mouse
TL;DR: Taking advantage of known functions of these genes, investigators can construct interactive gene pathways, leading to modeling of possible underlying events inducing salivary gland dysfunction, and identify multiple sets of genes of interest whose expressions and expression profiles may correlate with molecular mechanisms, signaling pathways, and/or immunological processes involved in the development and onset of SjS.
Sparsity-Based Clustering for Large Hyperspectral Remote Sensing Images
TL;DR: Two novel sparsity-based clustering algorithms are proposed for large HSIs, named sparse coding- based clustering (SCC) and joint SCC (JSCC), which are the first to use the sparse representation recovery residual to cluster HSIs and introduce the super-pixel neighborhood.
35
A hierarchical procedure for the synthesis of ANFIS networks
TL;DR: A computationally efficient optimization ofANFIS networks is proposed, based on a hierarchical constructive procedure, by which the number of rules is progressively increased and the optimal one is automatically determined on the basis of learning theory in order to maximize the generalization capability of the resulting ANFIS network.
References
Cluster analysis and display of genome-wide expression patterns
TL;DR: A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression, finding in the budding yeast Saccharomyces cerevisiae that clustering gene expression data groups together efficiently genes of known similar function.
Objective Criteria for the Evaluation of Clustering Methods
TL;DR: This article proposes several criteria which isolate specific aspects of the performance of a method, such as its retrieval of inherent structure, its sensitivity to resampling and the stability of its results in the light of new data.
BIRCH: an efficient data clustering method for very large databases
Tian Zhang,Raghu Ramakrishnan,Miron Livny +2 more
- 01 Jun 1996
TL;DR: Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) as discussed by the authors is a data clustering method that is especially suitable for very large databases.
Computational cluster validation in post-genomic data analysis
TL;DR: In this article, the authors present a review of clustering validation techniques for post-genomic data analysis, with a particular focus on their application to postgenomic analysis of biological data.
993
Evaluation and comparison of gene clustering methods in microarray analysis
TL;DR: The results show that tight clustering and model-based clustering consistently outperform other clustering methods both in simulated and real data while hierarchical clusters and SOM perform among the worst.