Exclusive Feature Learning on Arbitrary Structures via -norm

D Kong, R Fujimaki, J Liu, F Nie… - Advances in neural …, 2014 - proceedings.neurips.cc
Group lasso is widely used to enforce the structural sparsity, which achieves the sparsity at
inter-group level. In this paper, we propose a new formulation called``exclusive group …

Robust flexible feature selection via exclusive L21 regularization

D Ming, C Ding - Proceedings of the 28th international joint conference …, 2019 - dl.acm.org
Recently, exclusive lasso has demonstrated its promising results in selecting discriminative
features for each class. The sparsity is enforced on each feature across all the classes via l …

Two-layer feature reduction for sparse-group lasso via decomposition of convex sets

J Wang, J Ye - Advances in Neural Information Processing …, 2014 - proceedings.neurips.cc
Abstract Sparse-Group Lasso (SGL) has been shown to be a powerful regression technique
for simultaneously discovering group and within-group sparse patterns by using a …

Pairwise constraint-guided sparse learning for feature selection

M Liu, D Zhang - IEEE transactions on cybernetics, 2015 - ieeexplore.ieee.org
Feature selection aims to identify the most informative features for a compact and accurate
data representation. As typical supervised feature selection methods, Lasso and its variants …

Unsupervised feature selection with constrained ℓ₂, ₀-Norm and optimized graph

F Nie, X Dong, L Tian, R Wang… - IEEE transactions on …, 2020 - ieeexplore.ieee.org
In this article, we propose a novel feature selection approach, named unsupervised feature
selection with constrained-norm (row-sparsity constrained) and optimized graph (RSOGFS) …

Feature selection for neural networks using group lasso regularization

H Zhang, J Wang, Z Sun, JM Zurada… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We propose an embedded/integrated feature selection method based on neural networks
with Group Lasso penalty. Group Lasso regularization is considered to produce sparsity on …

Efficient methods for overlapping group lasso

L Yuan, J Liu, J Ye - Advances in neural information …, 2011 - proceedings.neurips.cc
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-
overlapping groups of features. The non-overlapping group structure limits its applicability in …

Classification with the sparse group lasso

N Rao, R Nowak, C Cox… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Classification with a sparsity constraint on the solution plays a central role in many high
dimensional signal processing applications. In some cases, the features can be grouped …

Fused lasso for feature selection using structural information

L Cui, L Bai, Y Wang, SY Philip, ER Hancock - Pattern Recognition, 2021 - Elsevier
Most state-of-the-art feature selection methods tend to overlook the structural relationship
between a pair of samples associated with each feature dimension, which may encapsulate …

Lasso screening rules via dual polytope projection

J Wang, J Zhou, P Wonka, J Ye - Advances in neural …, 2013 - proceedings.neurips.cc
Lasso is a widely used regression technique to find sparse representations. When the
dimension of the feature space and the number of samples are extremely large, solving the …