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

Betel Leaf Area Measurement Using Image Processing

The deep green heart shaped leaves of betel vine are popularly known as a Paan in India. It is used in a number of traditional remedies. Now a day’s customer’s lifestyles and needs have gone through tremendous changes. T...

Cost Effective Cloud Environment Setup to Secure Corporate Data

In recent years ad-hoc parallel processing has emerged to be one among the killer applications for Infrastructure-as-a-Service (IaaS) clouds. Major Cloud computing firms have began to integrate frameworks for parallel pr...

Comparison a Performance of Data Mining Algorithms (CPDMA) in Prediction Of Diabetes Disease

Detection of knowledge patterns in clinicial data through data mining. Data mining algorithms can be trained from past examples in clinical data and model the frequent times non-linear relationships between the independe...

INTENSIFICATION OF EDUCATIONAL CLOUD COMPUTING AND CRISIS OF DATA SECURITY IN PUBLIC CLOUDS

Cloud computing is an emerging technology that access emote servers through Internet to maintain data and pplications. It incorporates the advantages of grid and utility omputing. This paper expresses the mportance o...

Comparison and Study of AOMDV and DSDV Routing Protocols in MANET Using NS-2

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes communicating with each other using multi-hop wireless. One of the main challenges of MANET is the design of robust routing algorithms that adapt t...

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