.png){kind=icon}
返回
Graph based fuzzy clustering algorithm for crime report labelling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2023.110261.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Globalization influences the frequency and severity of localized traditional patterns of crime in addition to creating conditions for new types of crime. The scope and makeup of traditional crime have been significantly impacted by the world's compression. This makes it impossible for law enforcement officials to examine crime reports for the purpose of conducting investigations and taking the necessary preventive measures. Clustering facilitates investigations by grouping crime reports into different categories based on the crime types. In the proposed work, the crime reports are preprocessed and embedded with the help of the BERT model to capture the contextual meaning of the reports. An undirected graph is constructed considering each crime report vector as a node where an edge exists between a pair of nodes only if the cosine similarity between them is more than a threshold value. The constructed graph is partitioned based on the concepts of node betweenness, edge connectivity, and two proposed concepts, namely, cut of a node, and safe node, introduced in the paper. Based on the edge connectivity of the graph, we decide whether the graph needs to be further partitioned or not. If edge connectivity is high, we consider the graph as a cluster; otherwise, we partition the graph with the help of a node, say v, with the highest node betweenness. During partition, we find the cut of v to determine whether v is safe or not. If v is safe, the algorithm provides two overlapping subgraphs of the graph; on the other hand, if it is not safe, then the algorithm provides a modified graph with a replica of node v. The algorithm is iterative in nature and terminates when all subgraphs are of higher edge connectivity. As the generated subgraphs are overlapped in nature, a novel graph theory-based fuzzification technique is utilized to measure the membership value of each node in different subgraphs, which allows investigators to focus on the most serious crimes in the reports. The proposed method is assessed using crime report datasets as well as other text datasets and compared with several state-of-the-art methods by utilizing a variety of performance metrics to reflect the effectiveness of the method in different domains. & COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Graph centrality measures
Graph partitioning algorithm
Crime Report clustering
Sentence BERT Embedding
Graph-based fuzzification
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏Preparation and Corrosion Resistance of ETEO Modified Graphene Oxide/Epoxy Resin Coating.png)
Coatings
OAAI
CoatingsIF0
OAAI分享收藏分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled TrialPLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容