A Dimension Decomposition-Based Density Clustering Classification Pattern Recognition Method
A pattern recognition and density clustering technology, applied in the field of pattern recognition, can solve problems such as high computational overhead, underfitting, and overfitting, and achieve the effect of small algorithmic overhead and significant computational advantages
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0046] A kind of density clustering class mark pattern recognition method based on dimension decomposition, comprises the following steps:
[0047] Step 1, input the clustered UAV training data X=x 1 ,x 2 ,...,x m , where m is the total number of training data, and the dimension of the training data is n, that is, x 1 ,x 2 ,...,x m The dimension is n.
[0048] Input the training data class label corresponding to the training data X where x 1 ~x m For m training data, For each training data x 1 ~x m Corresponding to the clustering class standard, m is the total number of training data, and the dimension of training data is n,
[0049] Such as figure 1 shown. Input the cluster core point index set C, the neighborhood radius Eps of DBSCAN cluster analysis.
[0050] Input the test data T=t of the drone 1 ,t 2 ,...,t p , where t 1 ~t p is p test data, p is the total number of test data, and n is the dimension of the test data is the same as the dimension of the...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


