Clustering of India States using Optimized K Means Algorithm

Authors : Nisha K, Basavaraj B Vaddatti.

Volume/Issue : Volume 4 - 2019, Issue 5 - May

Google Scholar :

Scribd :

In today’s world we have a positive trend of better infrastructure with huge amount of roads expansion and variety of vehicles moving around the globe. As the number of vehicles is increasing, more number of commuters involved there is a probability of increased number of accidents which can happen. In this paper Canopy K Means algorithm is implemented on the data provided by government of India and then states are classified into Low, Medium and High Accident Zones. Unlike normal k means algorithm the proposed method select the optimized centers so that better classification results are obtained. During the clustering process instead of working on all the attributes of accident data sets top level attributes are found out based on standard deviation.

Keywords : K Means, Eigen Value, Clustering.


Paper Submission Last Date
29 - February - 2024

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.