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
Vue Injector 3.3
Spectrum Analyzer pro Live 2019
Devart Excel Add-in for HubSpot 2.1
RentALLScript - Airbnb clone 2.2
SuiteCRM Theme Customization 7.11.6
iScripts NetMenus 3.1
iScripts EasyIndex 2.2
iScripts EasySnaps 2.0
Australia MyPost shipping For Magento 2 1.0.0
Australia Post eParcel For Magento 1.1.1
Source Control for SQL Server 2.0
Answers phpSoftPro 3.12
Exlcart 2.0
School College ERP 1.3.2
White-label Grocery Delivery App Solution 2.0
Top Code
iScripts EasySnaps 1
iScripts EasyIndex 1
iScripts NetMenus 2.0
ATN Site Builder 3.0
Azizi search engine script PHP 4.1.10
IcrediBB Bulletin Board System 1.0
JE Guestbook 1.1
Cover Flow FX 0.2.12
Current Location 1.5.9
Guestbook PHP Script 1.1
DBForms from MSAccess to PHP+PostgreSQL 1.0.0
Simple Comments Script 0.930
Vue Injector 3.3
EV Widget Post 0.3
ATN Resume Finder 2.0
Top Rated
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
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
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
kmeans clustering 1.0
File ID: 82197






kmeans clustering 1.0
Download kmeans clustering 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 30.7 KB
Downloads: 182
Submit Rating:
kmeans clustering 1.0 Description
Description: This is a very fast implementation of the original kmeans clustering algorithm without any fancy acceleration technique, such as kd-tree indexing and triangular inequation. (actually the fastest matlab implementation as far as I can tell.)

This code is as vectorized as possible. Yet it is very compact (only 10 lines of code). It is 10~100 times faster than the kmeans function in matlab.

The package also includes a function for ploting the data with labels.

Sample code:
>> load data;scatterd(X,y)
>> f=litekmeans(X,3);scatterd(X,f)

License: Shareware

Related: times, faster, Lines, Compact, Function, Package, datascatterdxy, dlitekmeansx scatterdxf

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

File Size: 30.7 KB

Downloads: 182



More Similar Code

a kind of usefull clustering algorithm that is better than kmeans and ward hierarchical clustering algorithms in some data sets



The zip file contains a number of files developed during the webinar. The script will read from a sample jpeg image or from a camera and identify broken pills on a flat white background. The GUI wraps this functionality using GUIDE, a tool that...



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



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.



Measure percentage of Accuracy and the Rand index of clustering results
The number of class must equal to the number cluster

Output
Acc = Accuracy of clustering results
rand_index = Rand's Index, measure an agreement of...



The purpose of the development of this toolbox was to compile a continuously extensible, standard tool, which is useful for any MATLAB user for one's aim. In Chapter 1 of the downloadable related documentation one can find a theoretical...



Iris data set clustering using partitional algorithm. Concepts like loading text document and plotting of 4 Dimensional data with the fourth dimension as the intensity of colour of the plot. I used K means algorithm to update the centres from...



Efficient implementation of K-medoids clustering methods. This method is similar to K-means but more robust.
For more detail, please see
http://en.wikipedia.org/wiki/K-medoids

Input data are assumed column vectors.



Affinity propagation clustering (AP) is a clustering algorithm proposed in "Brendan J. Frey and Delbert Dueck. Clustering by Passing Messages Between Data Points. Science 315, 972 (2007)". It has some advantages: speed, general...



The High Dimensional Data Clustering (HDDC) toolbox contains an efficient unsupervised classifiers for high-dimensional data. This classifier is based on Gaussian models adapted for high-dimensional data.

Reference: C. Bouveyron, S....

User Review for kmeans clustering
- required fields
     

Please enter text on the image