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

A Novel approach for identifying greedy nodes in wireless sensor network by using EEGN algorithm

WSN have attracted a great deal of research attention due to then wide range of applications. The life span of the sensor network is limited to its residual power. In order to increase the energy of the nodes it is neces...

Simulation and Analysis of Digital Video Watermarking Using MPEG-2

Quantization Index Modulation (QIM) is an important method for embedding digital watermark signal with information. This technique achieves very efficient tradeoffs among watermark embedding rate, the amount of embedding...

Justified Cross-Site Scripting Attacks Prevention from Client-Side

Web apps are fetching towards the overriding way to offer access to web services. In parallel, vulnerabilities of web application are being revealed and unveiled at an frightening rate. Web apps frequently make JavaScrip...

IMPLEMENTATION OF REPUTATION EXCHANGE PROTOCOL IN PEER-TO-PEER SYSTEM

The motivation behind basing applications on peer-to-peer architectures derives to a large extent from their ability to function, scale and self-organize in the presence of a highly transient population of nodes, network...

FCE: A QUALITY METRIC FOR COTS BASED SOFTWARE DESIGN

The software that is based on component is aimed at veloping large software systems thorough combining the xisting software components. Before integrate different omponents, first one need to identify whether functio...

Download PDF file
  • EP ID EP134716
  • DOI -
  • Views 141
  • 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