Open Access
2013 Crime Busting Model Based on Dynamic Ranking Algorithms
Yang Cao, Xiaotian Xu, Zhijing Ye
Abstr. Appl. Anal. 2013(SI19): 1-10 (2013). DOI: 10.1155/2013/308675


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.


Download Citation

Yang Cao. Xiaotian Xu. Zhijing Ye. "Crime Busting Model Based on Dynamic Ranking Algorithms." Abstr. Appl. Anal. 2013 (SI19) 1 - 10, 2013.


Published: 2013
First available in Project Euclid: 26 February 2014

Digital Object Identifier: 10.1155/2013/308675

Rights: Copyright © 2013 Hindawi

Vol.2013 • No. SI19 • 2013
Back to Top