A safe reinforced feature screening strategy for Lasso based on feasible solutions (Q2201661): Difference between revisions

@@ Property / DOI @@
-.1016/j.ins.2018.10.031
@@ Property / DOI: 10.1016/j.ins.2018.10.031 / rank @@
-Normal rank
@@ Property / cites work @@
+Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
+Normal rank
@@ Property / cites work @@
+From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
+Normal rank
@@ Property / cites work @@
+Atomic Decomposition by Basis Pursuit
@@ Property / cites work: Atomic Decomposition by Basis Pursuit / rank @@
+Normal rank
@@ Property / cites work @@
+Safe Feature Elimination in Sparse Supervised Learning
+Normal rank
@@ Property / cites work @@
+Double regularization methods for robust feature selection and SVM classification via DC programming
+Normal rank
@@ Property / cites work @@
+Q4864293
@@ Property / cites work: Q4864293 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Rules for Discarding Predictors in Lasso-Type Problems
+Normal rank
@@ Property / cites work @@
+Scaling up twin support vector regression with safe screening rule
+Normal rank
@@ Property / cites work @@
+Coordinate descent algorithms
@@ Property / cites work: Coordinate descent algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Regularization and Variable Selection Via the Elastic Net
+Normal rank
@@ Property / Wikidata QID @@
+Q129038357
@@ Property / Wikidata QID: Q129038357 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.INS.2018.10.031
@@ Property / DOI: 10.1016/J.INS.2018.10.031 / rank @@
+Normal rank