Improve robustness of sparse PCA by \(L_{1}\)-norm maximization (Q645882): Difference between revisions

@@ Property / DOI @@
-.1016/j.patcog.2011.07.009
@@ Property / DOI: 10.1016/j.patcog.2011.07.009 / rank @@
-Normal rank
@@ Property / cites work @@
+A Direct Formulation for Sparse PCA Using Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+An augmented Lagrangian approach for sparse principal component analysis
+Normal rank
@@ Property / cites work @@
+Q3096150
@@ Property / cites work: Q3096150 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse principal component analysis via regularized low rank matrix approximation
+Normal rank
@@ Property / cites work @@
+A framework for robust subspace learning
@@ Property / cites work: A framework for robust subspace learning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4395494
@@ Property / cites work: Q4395494 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust principal component analysis?
@@ Property / cites work: Robust principal component analysis? / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.PATCOG.2011.07.009
@@ Property / DOI: 10.1016/J.PATCOG.2011.07.009 / rank @@
+Normal rank