Viterbi optimization for crime detection and identification

8Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we introduce two types of hybridization. The first contribution is the hybridization between the Viterbi algorithm and Baum Welch in order to predict crime locations. While the second contribution considers the optimization based on decision tree (DT) in combination with the Viterbi algorithm for criminal identification using Iraq and India crime dataset. This work is based on our previous work [1]. The main goal is to enhance the results of the model in both consuming times and to get a more accurate model. The obtained results proved the achievement of both goals in an efficient way.

Cite

CITATION STYLE

APA

Hussein, R. R. A., Al-Qaraawi, S. M., & Croock, M. S. (2020). Viterbi optimization for crime detection and identification. Telkomnika (Telecommunication Computing Electronics and Control), 18(5), 2378–2384. https://doi.org/10.12928/TELKOMNIKA.V18I5.13398

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free