Feature selection method based on Laplacian operator

A feature selection method and operator technology, applied in computing, computer parts, instruments, etc., can solve the problems of ignoring the interdependence between samples and samples, affecting the discriminability of selected features, and affecting the classification performance of classifiers.

Active Publication Date: 2015-03-11
ANHUI NORMAL UNIV
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] In these Lasso-based methods, one of the main shortcomings is that only the dependencies between samples and predicted values ​​(ie labels) are considered, while the interdependence between samples and samples is i

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 based on Laplacian operator
  • Feature selection method based on Laplacian operator
  • Feature selection method based on Laplacian operator

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.

[0038] Below in conjunction with embodiment technical scheme of the present invention is described in further detail:

[0039] A specific embodiment of the present invention lists evaluating the effectiveness of the proposed method on 8 UCI data sets. Table 1 lists the characteristics of these datasets.

[0040] Table 1 Datasets used in the experiments

[0041]

[0042] We first compare Lasso's feature selection methods, and compare the classic ranking-based feature selection methods, including Laplacian Score (LS) and FisherScore (FS)...

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 based on a Laplacian operator. The feature selection method not only takes the correlation between a sample and a class tag into account, but also keeps the interdependence relation among samples. Specifically, a proposed Lap-Lasso method comprises two regularization items, and the first regularization item is a sparse regularization item which ensures that only a small quantity of features can be selected. In addition, a new regularization item based on Laplacian is introduced and is used for keeping local adjacent structure information among samples of the same types. Furthermore, an APG namely an Accelerated Proximal Gradient algorithm is adopted to optimize a proposed model. An experimental result in a UCI data set verifies the validity of the Lap-lasso method.

Description

technical field [0001] The invention discloses a feature selection method based on a Laplacian operator, and relates to the technical field of machine learning algorithms. Background technique [0002] Traditional algorithms in machine learning often suffer from the well-known curse of dimensionality. In this case, reducing the dimensionality of data is beneficial to improve the efficiency and accuracy of data analysis. Feature selection is the process of selecting a subset of the most relevant features from a set of features to reduce the dimensionality of the feature space, so as to achieve the goal of improving the performance of the learning model. [0003] Researchers have proposed various feature selection methods. These methods broadly fall into two categories: (1) feature ranking methods; (2) feature subset search methods. The feature ranking method usually considers the importance of each feature separately and ranks it, so as to select a set of the most importan...

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
IPC IPC(8): G06K9/66G06K9/46
CPCG06F18/2413
Inventor 接标左开中王涛春丁新涛胡桂银罗永龙
Owner ANHUI NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products