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
GetOrgChart 2.5.3
AnyGantt JS Gantt Charts 8.6.0
AnyChart JS Charts and Dashboards 8.6.0
Multi Vendor Ecommerce Script & Apps 4.0
Magento 2 Inventory Management Extension 1.0
Yipit Clone Script - Daily Deals Software 1.0.2
Devart Excel Add-in for Oracle 1.7
Devart Excel Add-in for Freshdesk 1.7
Devart Excel Add-in for G Suite 1.7
C# QR Code Generator 4.0.2.2
Salesforce WordPress Customer Portal 3.2.0
Single Leg MLM 1.2.1
OzGIS 14.6
Quick Maps For Dynamics CRM 3.1
Job Board Software 4.2
Top Code
MCU 8051 IDE 1.4.7
School Management Script 1.0.4
shopping mall management system 1.0
WinPoker 2.02
SynaSer Serial Port Library 5.0
MLM Software 1.0.2
Planyo online reservation system module 6.x-1.8
SuperGeek Free Document OCR 2.5.6
sipmethod 1.0
School Management CRM 1
STDF file reader 1.0
Farnsworth 1.0
WebKit2.NET 0.10
Simple IP Calculator sub/sup networking 0.0.4
Beremiz 1.0
Top Rated
VisualNEO Web 2018.12.15
Paste phpSoftPro 1.4.1
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
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
Efficient K-Means Clustering using JIT 1.0
File ID: 82904






Efficient K-Means Clustering using JIT 1.0
Download Efficient K-Means Clustering using JIT 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 649
User Rating:2 Stars  (3 ratings)
Submit Rating:
Efficient K-Means Clustering using JIT 1.0 Description
Description: 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 MATLAB.

The code is very simple and well documented, hence is suitable for beginners to learn k-means clustering algorithm.

Numerical comparisons show that this tool could be several times faster than kmeans in Statistics Toolbox.

License: Shareware

Related: suitable, Beginners, Learn, documented, Acceleration, matlab, kmeans, Algorithm, faster

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

File Size: 10.0 KB

Downloads: 649



More Similar Code

Codes for fuzzy k means clustering, including k means with extragrades, Gustafson Kessel algorithm, fuzzy linear discriminant analysis. Performance measure is also calculated.



Usage: [means,c]=KNMCluster(k,indata)

KNMCluster is an implementation of the K-means clustering algorithm. It takes inputs k and indata. k is the initial guess of the number of clusters.

indata is the aggregate data that you...



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.



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



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.



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



KMEANSK - mex implementation (compile by mex kmeansK.cpp
Also an equivalent MATLAB implementation is present in zip file

Performs K-means clustering given a list of feature vectors and k. The argument k indicates the number of...



Statistics modules in Perl Data Language, with a quick-start guide for non-PDL people. They make the PDL shell work like R, but with PDL threading (fast automatic iteration) of procedures including t-test, linear regression, and k-means clustering.



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.



Clustering problems are solved using various techniques such as SOM and K-Means. The generic problem involves multi-attribute sample points, with variable weights. We use Genetic Algorithms to build a scalable, generic & easy to use solution.

User Review for Efficient K-Means Clustering using JIT
- required fields
     

Please enter text on the image