A Novel Benchmark K-Means Clustering on Continuous Data

Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 8

Abstract

Cluster analysis is one of the prominent techniques in the field of data mining and k-means is one of the most well known popular and partitioned based clustering algorithms. K-means clustering algorithm is widely used in clustering. The performance of k-means algorithm will affect when clustering the continuous data. In this paper, a novel approach for performing k-means clustering on continuous data is proposed. It organizes all the continuous data sets in a sorted structure such that one can find all the data sets which are closest to a given centroid efficiently. The key institution behind this approach is calculating the distance from origin to each data point in the data set. The data sets are portioned into k-equal number of cluster with initial centroids and these are updated all at a time with closest one according to newly calculated distances from the data set. The experimental results demonstrate that proposed approach can improves the computational speed of the direct k-means algorithm in the total number of distance calculations and the overall time of computations particularly in handling continuous data.

Authors and Affiliations

K. Prasanna , M. Sankara Prasanna Kumar , G. Surya Narayana

Keywords

Related Articles

An Automated Microcontroller Based Liquid Mixing System

This paper introduces a systematic approach to design and realize a temp and volume based liquid mixing system using three low cost micro controllers. The primary function of this system is to mix different liquids of re...

A Research paper: An ASCII value based data encryption algorithm and its comparison with other symmetric data encryption algorithms

Encryption is the process of transforming plaintext into the ciphertext where plaintext is the input to the encryption process and ciphertext is the output of the encryption process. Decryption is the process of transfor...

Development of Behavioral Based System from Sports Video

A system for detecting and analyzing behavior of a sports person from their facial expression extracted from a sports video from the basis of this project. Shot Segmentation, Object Frame Selection, Image Segmentation, F...

WebParF:A Web Partitioning Framework for Parallel Crawler

With the ever proliferating size and scale of the WWW [1], efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this “era of tera”...

A Novel Approach for Controlling a Size of a Test Suite with Simple Technique

Software testing is an important activity in the software evelopment life cycle. and also expensive phase when ompared to all other phases of the software development life cycle. Software testing purpose is to etect,s...

Download PDF file
  • EP ID EP134716
  • DOI -
  • Views 142
  • Downloads 0

How To Cite

K. Prasanna, M. Sankara Prasanna Kumar, G. Surya Narayana (2011). A Novel Benchmark K-Means Clustering on Continuous Data. International Journal on Computer Science and Engineering, 3(8), 2974-2977. https://europub.co.uk/articles/-A-134716