Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
AnyChart JS Charts and Dashboards 8.4.2
OrgChart JS 3.8.0
dbForge Compare Bundle for MySQL 8.1
dbForge Search for SQL Server 2.3
Database Workbench Pro 5.5.0
Luxand FaceSDK 7.0
SSIS Data Flow Components 1.10
Entity Developer Professional 6.3
dbForge Index Manager for SQL Server 1.9
dbForge Data Generator For MySQL 2.2
Magento Australia Post eParcel Extension 1.0
Top Code
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
PHP MLM Software 2.0.1
Faculty Evaluation System 1.1
Database Workbench Pro 5.5.0
Sportsbook software by BOOKIE Software 3.01
School Management Script 1.0.4
Image retrieval - Query by Example Demo 1.0
Shopping System for Shopping Carts 1.1
Billing System 1.0.1
SCHOOL MANAGEMENT SOFTWARE 1.2
WordStat 2.0
Real Time Changing Clock v1.0
GnuWin64 64
Skeletonz 1.0b
dbForge Fusion for SQL Server 1.8
Top Rated
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
The Spherical K-means algorithm 1.0
File ID: 84171






The Spherical K-means algorithm 1.0
Download The Spherical K-means algorithm 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 173
Submit Rating:
The Spherical K-means 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 K-means 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 K-means 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 K-means algorithm (SPK-means).

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 k-means 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 K-means algorithm.



A toolbox for the non-local means algorithm.
by Gabriel PeyrdoTe, 2007.

The non-local 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 n-by-p matrix X
into k (or, rarely, fewer) clusters by applying the well known batch
K-means algorithm. Rows of X correspond to points, columns correspond to
variables. The...



This is an implementation of the paper
k-means++: 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 K-means 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...



k-clique 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, 814d-deOCt818 (2005)



Hard and soft k-means implemented simply in python (with numpy). Quick and dirty, tested and works on large (10k+ observations, 2-10 features) real-world data.



An implementation of "k-Means 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 K-means algorithm
- required fields
     

Please enter text on the image