scientific article; zbMATH DE number 6765491

zbMATH Open1368.94060arXiv1511.00152MaRDI QIDQ5347964FDOQ5347964

Authors: F. Pourkamali-Anaraki, S. Becker 

Publication date: 25 August 2017

Full work available at URL: https://arxiv.org/abs/1511.00152

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 7625166
• PCA Sparsified
• The sparse principal component analysis problem: optimality conditions and algorithms
• Fast, deterministic and sparse dimensionality reduction
• Sparse PCA: convex relaxations, algorithms and applications
• Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics
• Data-Parallel Sparse Factorization
• Sparse generalized principal component analysis for large-scale applications beyond Gaussianity

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Cited In (4)

• Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
• Spectral estimation from simulations via sketching
• An adaptive primal-dual framework for nonsmooth convex minimization
• Matrix completion for cost reduction in finite element simulations under hybrid uncertainties

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347964)