Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Cluster plays a vital and very important in data mining. Cluster is a main and absolute part of real time applications. Grouping an object with its own class is known as Cluster. It has two different segments, Similar and Dissimilar objects. K Mean (KM) is one of the exclusive clustering algorithms. K Mean algorithm is introduced by cluster, which forms an easier and simpler way of classifying a given set of data. This paper is clearly based on Gravitational Search Algorithm (GSA) and KM algorithm. The main advantage of GSA and KM algorithm is to escape local optima and make convergence motions in rapid progression. A main five data sets in an UCI repository is used to bring the results and solutions in an excellent way using these algorithms. This paper aims to bring an exclusive and efficient result from both the algorithms compared to other algorithm and also gives perfect solution for the existing set of data.

Keywords

GSA, K Mean, UCI Repository
User