Hypergraph regularized sparse feature learning

Mingxia Liu

doi:10.1016/j.neucom.2016.10.031

Return

Hypergraph regularized sparse feature learning

2017-05-01

PRE

DOI：10.1016/j.neucom.2016.10.031

Original

Original request for help

Save

Abstract

En 中文

As an important pre-processing stage in many machine learning and pattern recognition domains, feature selection deems to identify the most discriminate features for a compact data representation. As typical feature selection methods, Lasso and its variants using the l(1)-norm based regularization have received much attention in recent years. However, most of existing l(1)-norm based sparse feature selection methods ignore the structure information of data or only consider the pairwise relationships among samples. In this paper, we propose a hypergraph regularized sparse feature learning method, where the high-order relationships among samples are modeled and incorporated into the learning process. Specifically, we first construct a hypergraph with multiple hyperedges to capture the high-order relationships among samples, followed by the computation of a hypergraph Laplacian matrix. Then, we propose a hypergraph regularization term, and a hypergraph regularized Lasso model. We conduct a series of experiments on a number of data sets from UCI machine learning repository, and two real-world neuroimaging based classification tasks. Experimental results demonstrate that the proposed method achieves promising classification results, compared with several well known feature selection approaches.

Keywords:

Feature selection

Hypergraph

Sparse

Classification

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.