Research Article
Fabricating Proficient Drive along by Employing K-Means Clustering Algorithm
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 179 - Issue 14 |
| Published: Jan 2018 |
| Authors: Saurabh Anand, Pallavi Singh, Pooja N. Desai |
10.5120/ijca2018916199
|
Saurabh Anand, Pallavi Singh, Pooja N. Desai . Fabricating Proficient Drive along by Employing K-Means Clustering Algorithm. International Journal of Computer Applications. 179, 14 (Jan 2018), 17-21. DOI=10.5120/ijca2018916199
@article{ 10.5120/ijca2018916199,
author = { Saurabh Anand,Pallavi Singh,Pooja N. Desai },
title = { Fabricating Proficient Drive along by Employing K-Means Clustering Algorithm },
journal = { International Journal of Computer Applications },
year = { 2018 },
volume = { 179 },
number = { 14 },
pages = { 17-21 },
doi = { 10.5120/ijca2018916199 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2018
%A Saurabh Anand
%A Pallavi Singh
%A Pooja N. Desai
%T Fabricating Proficient Drive along by Employing K-Means Clustering Algorithm%T
%J International Journal of Computer Applications
%V 179
%N 14
%P 17-21
%R 10.5120/ijca2018916199
%I Foundation of Computer Science (FCS), NY, USA
Abstract
During data analysis, often data needs to be grouped together based on similar looking or behaving. As the real world data features modulate with the Big data, where the data is unlabeled, the task of dividing the population or data points into a number of groups with similar points is of prime necessity. This method of identifying similar groups of data in a data set is called clustering. In simple words, the aim is to segregate groups with similar traits and assign them into clusters. This paper presents the importance of the K-means Clustering algorithm to understand the inner structure of the data to obtain the areas wherein based on the number of car rides booked in an area, optimum pickup point can be found using K-Means Clustering Algorithm.
References
- Han, J. &Kamber, M. (2012). Data Mining: Concepts and Techniques. 3rd.ed. Boston: Morgan Kaufmann Publishers.
- Sudhir Singh, Dr. Nasib Singh Gill, Comparative Study Of Different Data Mining Techniques: A Review, www. ijltemas.in, Volume II, Issue IV, APRIL 2013 IJLTEMAS ISSN 2278 – 2540.
- M. Ester, H. Kriegel, J. Sander, and X. Xu. A Density- Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proc. of the 2nd Int’l Conf. on Knowledge Discovery and Data Mining, August 1996.
- PERFORMANCE ANALYSIS OF PARTITIONAL AND INCREMENTAL CLUSTERING, Seminar National Aplikasi Teknologi Informasi 2005 (SNATI 2005) ISBN: 979-756-061-6 Yogyakarta, 18 June 2005.
- Data Mining and Statistics for Decision Making, Page no. 251, Stephane Tuffey, Wiley Publication.
- Performance Evaluation of Incremental K-means Clustering Algorithm, IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011.
- R C Dubes, A K Jain, “Algorithms for Clustering Data,” Prentice Hall, 1988.
- M H Dunham, “Data Mining: Introductory and Advanced Topics,” Prentice Hall, 2002.
Index Terms
Keywords