Regularized sparse feature selection with constraints embedded in graph Laplacian matrix


Feature selection is an important pre-processing stage in many machine learning and pattern recognition tasks, which eliminates irrelevant and redundant features and improves learning performance. Regularized sparse feature selection methods like Lasso and its variants using ℓ1-norm regularization term in their optimization problem have received much… (More)

2 Figures and Tables


  • Presentations referencing similar topics