Compact Structure of Felonious Crime Sets Using FP-Tree Comparable Algorithms Analysis

Provided by: International Journal of Computing Science and Information Technology (IJCSIT)
Topic: Big Data
Format: PDF
Discovering related offense case subsets is a crucial task for intelligence analysts in criminality investigation. It can not only deliver numerous evidences to resolve crimes but also increase efficiency to catch the lawbreakers. Mining recurrent crime sets from the large felonious database is very critical and essential duty of law enforcement agency. FP - tree similar algorithms are considered as very effective algorithms for effectively mine recurrent crime sets, in comparison to the techniques proposed in the past.

Find By Topic