A Major challenge in gene expression analysis is effective data organization and visualization. One of the most popular tools for this task is hierarchical clustering. Hierarchical clustering allows a user to view relationships in scales ranging from single genes to large sets of genes, while at the same time providing a global view of the expression data. However, hierarchical clustering is very sensitive to noise, it usually lacks of a method to actually identify distinct clusters, and produces a large number of possible leaf orderings of the hierarchical clustering tree. In this paper we propose a new hierarchical clustering algorithm which reduces susceptibility to noise, permits up to k siblings to be directly related, and provides a single optimal order for the resulting tree. Our algorithm constructs a k-ary tree, where each node can have up to k children, and then optimally orders the leaves of that tree. By combining k clusters at each step our algorithm becomes more robust against noise. By optimally ordering the leaves of the tree we maintain the pairwise relationships that appear in the original method. Our k-ary construction algorithm runs in O(n~3) regardless of k and our ordering algorithm runs in O(4~(k+o(k))n~3). We present several examples that show that our k-ary clustering algorithm achieves results that are superior to the binary tree results.
展开▼
