mloss | Projects that are tagged with l1 minimization.

Linear SVM with general regularization 1.0

by rflamary - October 5, 2012, 15:34:21 CET [ ] 874 views, 238 downloads, 1 subscription

About: This package is an implementation of a linear svm solver with a wide class of regularizations on the svm weight vector (l1, l2, mixed norm l1-lq, adaptive lasso). We provide solvers for the classical single task svm problem and for multi-task with joint feature selection or similarity promoting term.

Changes:

Initial Announcement on mloss.org.

Authors: Remi Flamary, Alain Rakotomamonjy
License: Gnu Gpl V2
Programming Language: Matlab

Operating System: Agnostic
Data Formats: Any Format Supported By Matlab
Tags: Large Scale, Kernelmachine, Svm, Bci, Classification, Support Vector Machines, Feature Selection, Linear Svm, Convex Optimization, Gradient Based Learning, Manifold Learning, Optimization, Algorithms, Feature Weighting, Trace Norm, Toolbox, Group Lasso, Lasso, Sparse Learning, Quadratic Programming, Weighting, L1 Regularization, Large Datasets, Regularization, Pattern Recognition, Discriminant Analysis, Linear Model, Generalized Linear Models, Multiclass Support Vector Machine, L1 Minimization, Sparse Representation, L1 Norm, L21 Norm, Dimension Reduction, Multi Task

Sparse representation L1 minimization via half quadratic minimization 1.0

by openpr_nlpr - June 5, 2012, 11:33:58 CET [ ] 1083 views, 229 downloads, 1 subscription

About: Ran He, Wei-Shi Zheng,Tieniu Tan, and Zhenan Sun. Half-quadratic based Iterative Minimization for Robust Sparse Representation. Submitted to IEEE Trans. on Pattern Analysis and Machine Intelligence.

Changes:

Initial Announcement on mloss.org.

Authors: Ran He
License: Bsd
Programming Language: Scilab

Operating System: Windows
Data Formats: None
Tags: Half Quadratic Minimization, L1 Minimization, Sparse Representation

Search

Manage

Sort by

Filter by

Latest Thoughts

RSS Feed - Blog

RSS Feed - New Software

Linear SVM with general regularization 1.0

Sparse representation L1 minimization via half quadratic minimization 1.0