Crime Busting Model Based on Dynamic Ranking Algorithms

Table 1

Symbol.

Symbols	Meaning
deg(𝑣)	Degree of a node
𝐶𝐷(𝑖)	Degree centrality
𝐶𝐵(𝑖)	Betweenness centrality
𝜔𝑗,𝑘	The shortest path between two nodes passing node 𝑖
𝑙	Number of topics in one conversation
𝐾(𝑒𝑖𝑗)	The number of conversations with same person
𝑞𝑖^𝑛+1	The nomination score of the node 𝑣𝑖 after (𝑛+1) iteration
𝑞^𝑛𝑖	The normalized nomination score of the node 𝑣𝑖 after 𝑛 iteration
𝑎𝑖𝑗	The element in the adjacent matrix of the effect network
𝑤𝑡	Empirical weight of topic’s effect, in our case 𝑤𝑡=15
𝑇(𝑣ij)	Unified topic’s suspicion degree, from 𝑣𝑗 to 𝑣𝑖