Large Margin Low Rank Tensor Analysis

DOI10.1162/NECO_a_00570zbMath1410.68331DBLPjournals/neco/ZhongC14arXiv1306.2663OpenAlexW1978771480WikidataQ43722398 ScholiaQ43722398MaRDI QIDQ5378344

Mohamed Cheriet, Guoqiang Zhong

Publication date: 12 June 2019

Published in: Neural Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Uses Software

• darch
• t-SNE

Cites Work

• Tensor Decompositions and Applications
• Fixed point and Bregman iterative methods for matrix rank minimization
• Sparse non-negative tensor factorization using columnwise coordinate descent
• Principal component analysis.
• Exact matrix completion via convex optimization
• Graph Implementations for Nonsmooth Convex Programs
• Reducing the Dimensionality of Data with Neural Networks
• How to Grow a Mind: Statistics, Structure, and Abstraction
• Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Learning the parts of objects by non-negative matrix factorization
• A Fast Learning Algorithm for Deep Belief Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large Margin Low Rank Tensor Analysis