Intelligent crowd sensing pickpocketing group identification using remote sensing data for secure smart cities

Abstract

<abstract><p>As a public infrastructure service, remote sensing data provided by smart cities will go deep into the safety field and realize the comprehensive improvement of urban management and services. However, it is challenging to detect criminal individuals with abnormal features from massive sensing data and identify groups composed of criminal individuals with similar behavioral characteristics. To address this issue, we study two research aspects: pickpocketing individual detection and pickpocketing group identification. First, we propose an IForest-FD pickpocketing individual detection algorithm. The IForest algorithm filters the abnormal individuals of each feature extracted from ticketing and geographic information data. Through the filtered results, the factorization machines (FM) and deep neural network (DNN) (FD) algorithm learns the combination relationship between low-order and high-order features to improve the accuracy of identifying pickpockets composed of factorization machines and deep neural networks. Second, we propose a community relationship strength (CRS)-Louvain pickpocketing group identification algorithm. Based on crowdsensing, we measure the similarity of temporal, spatial, social and identity features among pickpocketing individuals. We then use the weighted combination similarity as an edge weight to construct the pickpocketing association graph. Furthermore, the CRS-Louvain algorithm improves the modularity of the Louvain algorithm to overcome the limitation that small-scale communities cannot be identified. The experimental results indicate that the IForest-FD algorithm has better detection results in Precision, Recall and F1score than similar algorithms. In addition, the normalized mutual information results of the group division effect obtained by the CRS-Louvain pickpocketing group identification algorithm are better than those of other representative methods.</p></abstract>