Open Access Open Access  Restricted Access Subscription or Fee Access

Crime Data Analysis Using Data Mining Techniques to Improve Crimes Prevention

S. Gowtham


Crime prevention and detection become an important trend in crime and a very challenging to solve crimes. The crime data previously stored from various sources have a tendency to increase steadily. To solve the problems, data mining techniques employ many learning algorithms to extort hidden knowledge from huge volume of data. Data mining is data analyzing techniques to find patterns and trends in crimes. In this propose paper clustering is a data analyzing technique in unsupervised type. This technique is used to divide the same data into the same group and the different data into the other group. For the simple and effective clustering techniques, there are several algorithms such as K-means clustering. This approach is supervised learning scheme that used to dispense objects to one of many pre-determined categories. The algorithms of categorization have been widely applied to the numerous problems that include many various applications. Crime are characterized which change over time and increase continuously. The changing and increasing of crime direct to the issues of understanding the crime behavior, crime predicting, precise detection and managing large volumes of data obtained from various sources.


Crime, Cluster, Data Mining, Data Collection.

Full Text:



J. Han and M. Kamber, Data Mining: Concepts and Techniques, second ed. Morgan Kaufmann, 2006.

C.C. Aggarwal and P.S. Yu, “Finding Generalized Projected Clusters in High Dimensional Spaces,” Proc. 26th ACM SIGMOD Int’l Conf. Management of Data, pp. 70-81, 2000.

K. Kailing, H.-P. Kriegel, P. Kro ¨ger, and S. Wanka, “Ranking Interesting Subspaces for Clustering High Dimensional Data,” Proc.Seventh European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), pp. 241-252, 2003.

K. Kailing, H.-P. Kriegel, and P. Kro ¨ger, “Density-Connected Subspace Clustering for High-Dimensional Data,” Proc. Fourth SIAM Int’l Conf. Data Mining (SDM), pp. 246-257, 2004.

E. Mu ¨ ller, S. Gu ¨nnemann, I. Assent, and T. Seidl, “Evaluating Clustering in Subspace Projections of High Dimensional Data,” Proc. VLDB Endowment, vol. 2, pp. 1270-1281, 2009.

E. Agirre, D. Martı´nez, O.L. de Lacalle, and A. Soroa, “Two Graph-Based Algorithms for State-of-the-Art WSD,”Proc. Conf .Empirical Methods in Natural Language Processing (EMNLP), pp. 585-593, 2006.

K. Ning, H. Ng, S. Srihari, H. Leong, and A. Nesvizhskii, “Examination of the Relationship between Essential Genes in PPI Network and Hub Proteins in Reverse Nearest Neighbor Topology,”BMC Bioinformatics,vol. 11, pp. 1-14, 2010.

D. Arthur and S. Vassilvitskii, “K-Means++: The Advantages of Careful Seeding,”Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA),pp. 1027-1035, 2007.

I.S. Dhillon, Y. Guan, and B. Kulis, “Kernel k-Means: Spectral Clustering and Normalized Cuts,”Proc. 10th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining,pp. 551-556, 2004.

T.N. Tran, R. Wehrens, and L.M.C. Buydens, “Knn Density-Based Clustering for High Dimensional Multispectral Images,”Proc. Second GRSS/ISPRS Joint Workshop Remote Sensing and Data Fusion over Urban Areas,pp. 147-151, 2003..


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.