ENHANCED K-MEANS CLUSTRING ALGORITHM TO REDUCE TIME COMPLEXITY FOR NUMERIC VALUES
| Author(s) | : | Bhoomi Bangoria, Prof. Nirali Mankad, Prof. Vimal Pambhar |
| Institution | : | PG Scholar [C.E.], Noble Engineering College, bhoomi.bangoria@gmail.com |
| Published In | : | Vol. 1, Issue 5 — May 2014 |
| Page No. | : | 152-160 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Data mining is the process of using technology to identify patterns and prospects from largeamount of information. In Data Mining, Clustering is an important research topic and wide range of unverified classification application. Clustering is technique which divides a data into meaningful groups.K-means clustering is a method of cluster analysis which aims to partition n observations into k clustersin which each observation belongs to the cluster with the nearest mean. In this paper, try to improve theperformance, to find initial centroid systematically and distribute each data point to the suitable clusters.
Bhoomi Bangoria, Prof. Nirali Mankad, Prof. Vimal Pambhar, “ENHANCED K-MEANS CLUSTRING ALGORITHM TO REDUCE TIME COMPLEXITY FOR NUMERIC VALUES”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 1, Issue 5, pp. 152-160, May 2014.
