Feature selection method and device based on adaptive graph structure constraint subspace learning
A feature selection method and subspace learning technology, applied in the field of machine learning, can solve the problems of inaccurate processing and unstable performance of the feature selection method, and achieve the effect of avoiding sub-optimization problems, improving performance, and improving stability.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0071] Step 1: Load the data set, get the original high-dimensional feature matrix X, and get the category vector Y of all samples. Set parameters α, γ is usually set to 10 8 . Set the number of neighbors m.
[0072] Step 2: Randomly initialize the indicator matrix W and the coefficient matrix H.
[0073] Step 3: Using X, initialize S through the closed-form solution of the similarity matrix S.
[0074] Step 3: Initialize the Laplacian matrix L according to L=D-S.
[0075] Step 4: Use the CAN algorithm to iteratively update S and L until S and L converge.
[0076] Step 5: According to the Laplacian matrix L, optimize W and H by using Lagrange operator.
[0077] Step 6: Repeat steps 3 to 5 until S, L, W, and H converge.
[0078] Step 7: Express W as (w 1 ,w 2 ,...,w d ) T ,calculate And sort them from large to small, and select the first k corresponding index values to form an index vector A.
[0079] Step 8: Select the original feature vector according to the in...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


