- Home
- Publications
- Publication Search
- Publication Details
Title
Survey on Probabilistic Models of Low-Rank Matrix Factorizations
Authors
Keywords
-
Journal
Entropy
Volume 19, Issue 8, Pages 424
Publisher
MDPI AG
Online
2017-08-21
DOI
10.3390/e19080424
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Bayesian Robust Tensor Factorization for Incomplete Multiway Data
- (2016) Qibin Zhao et al. IEEE Transactions on Neural Networks and Learning Systems
- Neighborhood Regularized Logistic Matrix Factorization for Drug-Target Interaction Prediction
- (2016) Yong Liu et al. PLoS Computational Biology
- Bayesian Nonparametric Models for Multiway Data Analysis
- (2015) Zenglin Xu et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
- (2015) Qibin Zhao et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Variational Bayesian Matrix Factorization for Bounded Support Data
- (2015) Zhanyu Ma et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Independent Doubly Adaptive Rejection Metropolis Sampling Within Gibbs Sampling
- (2015) Luca Martino et al. IEEE TRANSACTIONS ON SIGNAL PROCESSING
- $L_{1}$ -Norm Low-Rank Matrix Factorization by Variational Bayesian Method
- (2015) Qian Zhao et al. IEEE Transactions on Neural Networks and Learning Systems
- Rényi Divergence and Kullback-Leibler Divergence
- (2014) Tim van Erven et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Variational Bayesian Methods For Multimedia Problems
- (2014) Zhaofu Chen et al. IEEE TRANSACTIONS ON MULTIMEDIA
- On the flexibility of the design of multiple try Metropolis schemes
- (2013) Luca Martino et al. COMPUTATIONAL STATISTICS
- Variational Bayesian sparse additive matrix factorization
- (2013) Shinichi Nakajima et al. MACHINE LEARNING
- An Introduction to Hierarchical (H-) Rank and TT-Rank of Tensors with Examples
- (2013) Lars Grasedyck et al. Computational Methods in Applied Mathematics
- Sparse Bayesian Methods for Low-Rank Matrix Estimation
- (2012) S. Derin Babacan et al. IEEE TRANSACTIONS ON SIGNAL PROCESSING
- Bayesian Robust PCA of Incomplete Data
- (2012) Jaakko Luttinen et al. NEURAL PROCESSING LETTERS
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
- (2012) Sebastian Holtz et al. SIAM JOURNAL ON SCIENTIFIC COMPUTING
- Bayesian Robust Principal Component Analysis
- (2011) Xinghao Ding et al. IEEE TRANSACTIONS ON IMAGE PROCESSING
- Robust principal component analysis?
- (2011) Emmanuel J. Candès et al. JOURNAL OF THE ACM
- Tensor-Train Decomposition
- (2011) I. V. Oseledets SIAM JOURNAL ON SCIENTIFIC COMPUTING
- A generalization of the adaptive rejection sampling algorithm
- (2010) Luca Martino et al. STATISTICS AND COMPUTING
- Exact Matrix Completion via Convex Optimization
- (2009) Emmanuel J. Candès et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- The variational approximation for Bayesian inference
- (2009) Dimitris G. Tzikas et al. IEEE SIGNAL PROCESSING MAGAZINE
- A New Scheme for the Tensor Representation
- (2009) W. Hackbusch et al. JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- (2009) I. V. Oseledets et al. SIAM JOURNAL ON SCIENTIFIC COMPUTING
- Tensor Decompositions and Applications
- (2009) Tamara G. Kolda et al. SIAM REVIEW
- Bayesian Inference for Nonnegative Matrix Factorisation Models
- (2009) Ali Taylan Cemgil Computational Intelligence and Neuroscience
- Principal Component Analysis Based on L1-Norm Maximization
- (2008) N. Kwak IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Robust L1 Principal Component Analysis and Its Bayesian Variational Inference
- (2007) Junbin Gao NEURAL COMPUTATION
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More