
The Spherical Kmeans algorithm 1.0 File ID: 84171 


 The Spherical Kmeans algorithm 1.0 License: Shareware File Size: 10.0 KB Downloads: 173
Submit Rating: 



The Spherical Kmeans algorithm 1.0 Description 

Description: Clustering is one of the most important data mining techniques used to extract useful information from microarray data. Microarray data sets can be either clustered by samples or by genes. In this research we focus on the gene clustering problem. The objective of gene clustering is to group genes with similar expression patterns together with the common belief that those genes often have similar functions, participate in a particular pathway or response to a common environmental stimulus. Although hundreds of clustering algorithms exist, the very simple Kmeans and its variants remain among the most widely used algorithms for gene clustering by biologists and practitioners. This surprising fact may be attributed to its especial ease of implementation and use. When microarray data are normalized to zero mean and unit norm, a variant of the Kmeans algorithm that works with the normalized data would be more suitable. Since the data points are on a unit hypersphere, the algorithm is called the Spherical Kmeans algorithm (SPKmeans).
License: Shareware Related: remain, variants, widely, practitioners, biologists, kmeans, Simple, stimulus, environmental O/S:BSD, Linux, Solaris, Mac OS X File Size: 10.0 KB Downloads: 173


More Similar Code 

The kmeans algorithm is widely used in a number applications like speech processing and image compression.
This script implements the algorithm in a simple but general way. It performs four basic steps.
1. Define k arbitrary prototypes from the data samples. 2. Assign each sample to the nearest prototype. 3. Recalculate prototypes as arithmetic means. 4. If a prototype changes, repeat step (2).
PBKM is simple and effective which can outperform the Kmeans algorithm.
A toolbox for the nonlocal means algorithm. by Gabriel PeyrdoTe, 2007.
The nonlocal means is an algorithm introduced by A. Buades, B. Coll, J.M Morel. The main reference for the algorithm is
A. Buades, B. Coll,...
[L, C, D] = FKMEANS(X, k) partitions the vectors in the nbyp matrix X into k (or, rarely, fewer) clusters by applying the well known batch Kmeans algorithm. Rows of X correspond to points, columns correspond to variables. The...
This is an implementation of the paper kmeans++: the advantages of careful seeding.
It converges very quickly.
Codes for fuzzy k means clustering, including k means with extragrades, Gustafson Kessel algorithm, fuzzy linear discriminant analysis. Performance measure is also calculated.
This is a tool for Kmeans clustering. After trying several different ways to program, I got the conclusion that using simple loops to perform distance calculation and comparison is most efficient and accurate because of the JIT acceleration in...
kclique algorithm as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society"  G. Palla, I. DerdoTenyi, I. Farkas, and T. Vicsek  Nature 435, 814ddeOCt818 (2005)
Hard and soft kmeans implemented simply in python (with numpy). Quick and dirty, tested and works on large (10k+ observations, 210 features) realworld data.
An implementation of "kMeans Projective Clustering" by P. K. Agarwal and N. H. Mustafa.
This method of clustering is based on finding few subspaces such that each point is close to a subspace. 
User Review for The Spherical Kmeans algorithm 
