Crime Busting Model Based on Dynamic Ranking Algorithms

الملخص EN

This paper proposed a crime busting model with two dynamic ranking algorithms to detect the likelihood of a suspect and the possibility of a leader in a complex social network.

Signally, in order to obtain the priority list of suspects, an advanced network mining approach with a dynamic cumulative nominating algorithm is adopted to rapidly reduce computational expensiveness than most other topology-based approaches.

Our method can also greatly increase the accuracy of solution with the enhancement of semantic learning filtering at the same time.

Moreover, another dynamic algorithm of node contraction is also presented to help identify the leader among conspirators.

Test results are given to verify the theoretical results, which show the great performance for either small or large datasets.