K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 12, Issue 5

Abstract

 Data mining refers to the process of analyzing the data from different perspectives and summarizing it into useful information that is mostly used by the different users for analyzing the data as well as for preparing data sets. A data set is collection of data that is present in the tabular form. Preparing data set  involves complex SQL queries, joining tables and aggregate functions. Traditional RDBMS manages the tables  with vertical format and returns one number per row. It means that it returns a single value output which is not  suitable for preparing a data set. This paper mainly focused on k means clustering algorithm which is used to  partition data sets after horizontal aggregations and a small description about the horizontal aggregation  methods which returns set of numbers instead of one number per row. This paper consists of three methods that is SPJ, CASE and PIVOT methods in order to evaluate horizontal aggregations. Horizontal aggregations  results in large volumes of data sets which are then partitioned into homogeneous clusters is important in the  system. This can be performed by k means clustering algorithm

Authors and Affiliations

R. Kumar

Keywords

Related Articles

A Review: Hadoop Storage and Clustering Algorithms

Abstract : In the last few years there has been voluminous increase in the storing and processing of data, which require convincing speed and also requirement of storage space. Big data is a defined as large, diverseand...

 Monitoring Selfish Nodes in MANET during Replica Allocation

 Abstract: Mobile Ad Hoc Network is a collection of mobile hosts. The mobility nature of the MANET causes the mobile host to move freely in the network, due to that network disconnections occurs frequently and this...

 Blowfish Algorithm

 Abstract: Blowfish is a popular security algorithm that was developed by Bruce Schneier in the advent of the year 1994. The algorithm works on the same line as DES and it consumes block coding with blocks of a size...

 Touchless Palmprint Verification using Shock Filter,SIFT, I-RANSAC, and LPD

Abstract: Palmprint have some basic features. These basic features are unique and unchangeable in one’s life.It is constant and not easy to fake. A palmprint contains three major lines that are called principal line, se...

 A Review on Speckle Noise Reduction Techniques

 Abstract:In medical image processing, Image denoising plays a very important role in diagnosis. Medical images are very much inconsistent. In medical imaging, Ultrasound is very popular due to its low cost, least h...

Download PDF file
  • EP ID EP104154
  • DOI -
  • Views 70
  • Downloads 0

How To Cite

R. Kumar (2013).  K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations. IOSR Journals (IOSR Journal of Computer Engineering), 12(5), 45-48. https://europub.co.uk/articles/-A-104154