2D compressed learning: support matrix machine with bilinear random projections

DOI10.1007/S10994-019-05804-3zbMath1440.68232OpenAlexW2946114174WikidataQ127829239 ScholiaQ127829239MaRDI QIDQ2008636

Di Ma, Song-can Chen

Publication date: 26 November 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-019-05804-3

zbMATH Keywords

dimension reduction2D compressed learningbilinear random projectionKronecker compressed learningsupport matrix machine

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Cites Work

• Sparse solutions to underdetermined Kronecker product systems
• A simple proof of the restricted isometry property for random matrices
• Support-vector networks
• Three-fold structured classifier design based on matrix pattern
• A Singular Value Thresholding Algorithm for Matrix Completion
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Bounds on the Number of Measurements for Reliable Compressive Classification
• 10.1162/153244303321897690
• Regularized Matrix Regression
• Regularization and Variable Selection Via the Elastic Net
• Kronecker Compressive Sensing
• Compressed sensing
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: 2D compressed learning: support matrix machine with bilinear random projections