Open AccessDetection of Crimes Using Unsupervised Learning Techniques
Author(s) -
R. Buli Babu,
G. Snehal,
Aditya Satya Kiran
Publication year - 2020
Publication title -
aptikom journal on computer science and information technologies
Language(s) - English
Resource type - Journals
eISSN - 2528-2425
pISSN - 2528-2417
DOI - 10.34306/csit.v2i1.62
Subject(s) - cluster analysis , computer science , partition (number theory) , data mining , expectation–maximization algorithm , canopy clustering algorithm , partition problem , similarity (geometry) , pattern recognition (psychology) , artificial intelligence , correlation clustering , image (mathematics) , mathematics , maximum likelihood , statistics , combinatorics
Data mining can be used to detect model crime problems. This paper is about the importance of datamining about its techniques and how we can easily solve the crime. Crime data will be stored in criminal’s database.To analyze the data easily we have data mining technique that is clustering. Clustering is a method to group identicalcharacteristics in which the similarity is maximized or minimized. In clustering techniques also we have different typeof algorithm, but in this paper we are using the k-means algorithm and expectation-maximization algorithm. We areusing these techniques because these two techniques come under the partition algorithm. Partition algorithm is oneof the best methods to solve crimes and to find the similar data and group it. K-means algorithm is used to partitionthe grouped object based on their means. Expectation-maximization algorithm is the extension of k-means algorithmhere we partition the data based on their parameters.