Unlock instant, AI-driven research and patent intelligence for your innovation.

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.

Pending Publication Date: 2021-07-23
XI AN JIAOTONG UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a feature selection method and equipment based on adaptive graph structure constrained subspace learning to solve the problem of inaccurate processing and unstable performance of the unsupervised feature selection method in the prior art, which ensures While maintaining the subspace of the original high-dimensional feature space, the learned subspace maintains the structural characteristics of the original high-dimensional feature space

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Feature selection method and device based on adaptive graph structure constraint subspace learning
  • Feature selection method and device based on adaptive graph structure constraint subspace learning
  • Feature selection method and device based on adaptive graph structure constraint subspace learning

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a feature selection method and device based on adaptive graph structure constraint subspace learning, and the method comprises the following steps: selecting a plurality of features from an original high-dimensional feature space to form a subspace through the subspace learning based on matrix decomposition; through adaptive graph structure learning, constraining the obtained subspace having the same structural features as the original high-dimensional feature space. The invention further provides a feature selection system based on adaptive graph structure constraint subspace learning, terminal equipment and a computer readable storage medium. Adaptive graph structure learning is applied to feature selection, and it is ensured that a feature subspace obtained through feature selection has a similar data structure with an original feature space. According to the method and device, the subspace learning process based on matrix decomposition and the adaptive graph structure learning process are jointly optimized, and the performance of the processing method is improved.

Description

technical field [0001] The invention belongs to the field of machine learning, and in particular relates to a feature selection method and equipment based on self-adaptive graph structure constrained subspace learning. Background technique [0002] With the development of various sensor technologies, the ability of modern sensor systems to collect data is getting stronger and stronger. At the same time, a large amount of high-dimensional data is also generated. These high-dimensional data usually contain some redundant data, irrelevant data and noise data, and these data often have adverse effects on subsequent learning algorithms. At present, feature selection methods are widely used to preprocess these data. Feature selection is based on selecting a subset of features to approximate all features for dimensionality reduction. Feature selection can be supervised, unsupervised or semi-supervised. In practical applications, it is usually difficult to obtain labeled data, s...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06N20/00G06K9/62
CPCG06N20/00G06F18/23213G06F18/213Y02T10/40
Inventor 郭宇张文轩赵露婷王一唯王飞
Owner XI AN JIAOTONG UNIV