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
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
PostgreSQL Data Access Components 4.4
Database Workbench Pro 5.6.4
Availability Booking Calendar PHP 1.0
Online Course Booking Script 3.04
Flat File Database Manager 1.1
Spylog 2.0 (awt Counter/tracke) Freeware 2.0
LDAP-Express I.40
YASLI-Yet another simple LDAP Interface 0.1
Frood LDAP Browser 1.5.1
ActiveRBAC 1.2
Merge multiple (potentially infinite) sorted inputs into a single sorted output
A Practical Comparison of ADO and ADO.NET - Part II
A Practical Comparison of XSLT and ASP.NET
A Quick Comparison of ADO and ADO.NET - Part I
An introduction to XML, XSL, and ASP.NET
Top Rated
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
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
Invoice Manager by PHPJabbers 3.0
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
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: 176
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: 176



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