返回
A consistent and flexible framework for deep matrix factorizations
DOI:10.1016/j.patcog.2022.109102.png)
摘要
En 中文
Deep matrix factorizations (deep MFs) are recent unsupervised data mining techniques inspired by con-strained low-rank approximations. They aim to extract complex hierarchies of features within high -dimensional datasets. Most of the loss functions proposed in the literature to evaluate the quality of deep MF models and the underlying optimization frameworks are not consistent because different losses are used at different layers. In this paper, we introduce two meaningful loss functions for deep MF and present a generic framework to solve the corresponding optimization problems. We illustrate the effec-tiveness of this approach through the integration of various constraints and regularizations, such as spar-sity, nonnegativity and minimum-volume. The models are successfully applied on both synthetic and real data, namely for hyperspectral unmixing and extraction of facial features.(c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Deep matrix factorization
Loss functions
Constrained optimization
First -order methods
Hyperspectral unmixing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Small Silencing RNAs in Plants Are Mobile and Direct Epigenetic Modification in Recipient Cells
Science
IF0
Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估
Hyperspectral Unmixing Using Sparsity-Constrained Deep Nonnegative Matrix Factorization With Total Variation基于全变分稀疏约束深度非负矩阵分解的高光谱解混

