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
- EP ID EP134716
- DOI -
- Views 139
- Downloads 0
Human Gait Recognition Using Bezier Curves
Gait recognition refers to automatic identification of an individual based on the style of walking. It is a new biometrics recognition technology. It has accomplished a series of achievements in scientific research in re...
Modeling of the Systems of Piloting In Training Institutions
From a globalization and complex environment .point of view the evaluation of the educational system turns out to be an imperative .The performance indicators allow to characterize the evolution of the educational system...
RGB & GRAY SCALE COMPONENT ON MPQ-BTC IN IMAGE COMPRESSION
Block Truncation Coding (BTC) is novel digital technique in image processing using which images can be coded efficiently. BTC has played an important role in the sense that many coding techniques have been developed base...
Improving the Performance of K-Means Clustering For High Dimensional Data Set
Clustering high dimensional data is the cluster analysis of data with anywhere from a few dozen to many thousands of dimensions. Multiple dimensions are hard to think in, impossible to visualize, and, due to the exponent...
A Relative Study on Retinal Vessel Segmentation
Retinal image processing is a standard medical repetition and offers number of profitable products for physicians. In the field of retinal image processing retinal vessel segmentation is the crucial task for detection of...