Investigation on basic k-means clustering algorithm to speed up the running time

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

Investigation on basic k-means clustering algorithm to speed up the running time

Pelapelapon, Hebert Hendrik - Personal Name; Setio, Basuki - Personal Name;

The most common way used to cluster a data from a data set is to use k-means clustering algorithm. It categorized as one of the fastest algorithm. In fact, it performs slower once it has to process huge amount of data, because it calculate distance between all data point to every centroids in a data set for all iteration that happened in the whole process, although there are some unnecessary computation. The main contribution of this work is an optimized version of basic k-means clustering algorithm which reduces the execution running time.

Availability

B00733 (wh) Available

Detail Information

Series Title: -
Call Number: 733
Publisher: : Swiss German University., 2010
Collation: -
Language: English
ISBN/ISSN: -
Classification: NONE
Content Type: -
Media Type: -
Carrier Type: -
Edition: -
Subject(s): IT
Specific Detail Info: -
Statement of Responsibility: -

Other version/related

No other version available

File Attachment

No Data

Comments

You must be logged in to post a comment