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

Solar Energy Prediction using LM-Back-propagation in ANN

Artificial intelligence has made its presence felt ubiquitously in different avenues of research and technology wherein the data is large and complex. In the proposed work, to forecast solar irradiation energy; whose str...

 Computer Vision: Visual Extent of an Object

 The visual extent of an object reaches beyond the object itself. It is reflected in image retrieval techniques which combine statistics from the whole image in order to identify the image within. Nevertheless, it...

 Study of P2P Botnet

 Abstract: Today, centralized botnets are still widely used. In a centralized botnet, bots are connected to several servers (called C&C servers) to obtain commands. This architecture is easy to construct and eff...

 An Attack-resistant Watermark Resynchronization Scheme using LDFT and BSP

Abstract: Image watermarking is a method that embeds a watermark in the digital image by making small changes in the host data. In watermarking applications, the robustness of the watermark to the common signal processin...

 Identification of Abnormality of Mri Images Using The Curvelets Transform Method

Abstract: This paper describes the Curvelets Transform method to get the significant results for the MRI images. To study and understanding of different kinds of MRI Images and formats like jpg, bmp, tiff, png and conver...

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