K-means algorithm-based public security crime class case research and judgment method
A technology for public security and similar cases, applied in computing, computer parts, instruments, etc., can solve the problems of manual subjective judgment, low real-time performance, and easy omission of case data, so as to reduce the workload of the police and improve the efficiency of solving cases
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052]
[0053]
[0054] The attributes of the above massive historical cases are vectorized:
[0055] It is processed as 6-dimensional feature attributes, combined with the bag of words model through the keyword similarity algorithm (algorithm steps: first calculate each case and briefly explain Case i name in ij Relative to the similarity of the S basic words in the word bag, and select the maximum similarity; then multiply the selected maximum similarity by the keyword name ij The order in the word bag (making it unique)) to calculate the vector value of each dimension, thus forming a case matrix, as follows:
[0056]
[0057] 3) K-value optimization selection in the K-Means algorithm to obtain the optimal K value:
[0058] By determining the K range [1, 100], that is, 1<=k<=100, combined with the silhouette coefficient from 1 to 100, the optimal silhouette coefficient value is calculated cyclically, so as to obtain the K value corresponding to the optimal silhou...
Embodiment 2
[0064] First, collect the information of the client’s public security case that has been solved in the latest time (at least more than 1 month), and perform data processing. After processing the data, the information is as follows: (6 dimensions of the case)
[0065]
[0066]
[0067] The attributes of the above-mentioned massive historical cases are:
[0068] It is processed into 6-dimensional feature vectors, combined with the bag of words model through the keyword similarity algorithm (algorithm steps: first calculate each case and briefly explain Case i name in ij Relative to the similarity of the S basic words in the word bag, and select the maximum similarity; then multiply the selected maximum similarity by the keyword name ij The order in the bag of words (making it unique) calculates the vector value of each dimension to form a case matrix, as follows:
[0069]
[0070] 3) K-value optimization selection in the K-Means algorithm to obtain the optimal K value...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com