Regularized greedy column subset selection

DOI10.1016/j.ins.2019.02.039zbMath1451.68250arXiv1804.04421OpenAlexW2964296421MaRDI QIDQ2215118

Jesús García López de Lacalle, Alberto Mozo, Bruno Ordozgoiti

Publication date: 10 December 2020

Published in: Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

unsupervised learningfeature selectioncolumn subset selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection

Uses Software

• MNIST
• PMTK
• COIL-20

Cites Work

• CUR matrix decompositions for improved data analysis
• Rang revealing QR factorizations
• Column subset selection via sparse approximation of SVD
• Support-vector networks
• Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
• Column subset selection problem is UG-hard
• Tikhonov Regularization and Total Least Squares
• 10.1162/153244303322753616
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Fast monte-carlo algorithms for finding low-rank approximations
• Near-Optimal Column-Based Matrix Reconstruction
• Ridge Regression: Biased Estimation for Nonorthogonal Problems
• Optimal Column-Based Low-Rank Matrix Reconstruction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item