To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Crime Data Analysis Using Clustering by Fast Search and Find of Density Peaks |
|
Author |
Ahmed Alghamdi |
| Citation |
Vol. 19 No. 11 pp. 174-178 |
|
Abstract |
Analyzing crime data is becoming a hot area of research because it has a direct connection to human life. This requires to discover hidden patterns in the crime data and group (or classify) them accordingly. Clustering is a discovery process that groups datasets into different categories based on their similarities. Clustering has been used in various areas like computing and IT, business, medicine, and biology. We used clustering by fast search and find of density peaks (CFSFDP) algorithm on crime data set. CFSFDP algorithm is based on two assumptions: (1) cluster center is a higher density data point as compared to other neighboring data points and (2) cluster centers lies at large distance from each other. Unlike k-mean clustering algorithm, number of clusters is automatically formed by CFSFDP algorithm however, cluster centers are manually selected by the user from decision graph. We performed experiments on crime dataset and tested different number of clusters to evaluate the performance of our approach. |
|
Keywords |
Crime data analysis Clustering Decision graph Information security. |
|
URL |
