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 VCL for Delphi 1.0.0.0
ASP. NET C# PDF Software 4.5
LinqConnect Professional 4.8
CAD VCL: 2D/3D CAD in Delphi/C++Builder 14
wolfSSL 3.15.7
CAD DLL 14
AnyStock Stock and Financial JS Charts 8.4.2
ODBC Driver for SQLite 2.4
dotConnect for SugarCRM 1.7
dbForge SQL Complete 5.9
dbForge Studio for MySQL 8.0
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
Top Code
RED SNAKE GAME 1.1
PDF Focus .Net 4.0.1
Ticket Booking System 1.0
Network-Integrated Multimedia Middleware 2.2.0
Simple Webinterface Shopsystem for Shopping Carts 0.4
College Management System Script 1.0.4
Zip Zag 1.4
VisualEffectMotion Script 1.1
.NET Interop for Visual FoxPro Applications
Vapor compression cycle component models 1.0
Helpdeskphp - PHP Help Desk Software 1.0
Simple Skin segmentation 1.0
Visual FoxPro Functions/Class Libary 100
Dream Inspector 4.01
Help Desk Reloaded Free MySql PHP help desk software II.80
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
K-means algorithm demo 1.0
File ID: 77669






K-means algorithm demo 1.0
Download K-means algorithm demo 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 712
User Rating:3 Stars  (1 rating)
Submit Rating:
K-means algorithm demo 1.0 Description
Description: 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).

License: Freeware

Related: assign, Sample, Samples, prototypes, Define, arbitrary, nearest, prototype, repeat, means, recalculate, arithmetic, steps, Basic, Speech, Processing, Applications, Number

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 712



More Similar Code

PBKM is simple and effective which can outperform the K-means algorithm.



[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...



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...



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.



K-means image segmentation based on histogram to reduce memory usage which is constant for any image size.



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)



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...



Description DC is simple and effective which can outperform the K-means and AP algorithm.

User Review for K-means algorithm demo
- required fields
     

Please enter text on the image