Leveraging maximum entropy and correlation on latent factors for learning representations

DOI10.1016/j.neunet.2020.07.027zbMath1475.68270DBLPjournals/nn/He0DZH20OpenAlexW3047349556WikidataQ99201041 ScholiaQ99201041MaRDI QIDQ2057737

Z. C. He, Yalou Huang, Fuzhen Zhuang, Jie Liu, Kai Dang

Publication date: 7 December 2021

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

Full work available at URL: https://doi.org/10.1016/j.neunet.2020.07.027

zbMATH Keywords

maximum entropynon-negative matrix factorizationcorrelated latent factor learning

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)

Uses Software

• NUS-WIDE
• GeoMF

Cites Work

• A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint
• A survey of multilinear subspace learning for tensor data
• Principal component analysis.
• Weakly Supervised Deep Matrix Factorization for Social Image Understanding
• 10.1162/jmlr.2003.3.4-5.993
• Learning the parts of objects by non-negative matrix factorization
• Rank Selection in Nonnegative Matrix Factorization using Minimum Description Length
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Unnamed Item

This page was built for publication: Leveraging maximum entropy and correlation on latent factors for learning representations