Data representation using robust nonnegative matrix factorization for edge computing

DOI10.3934/mbe.2022100OpenAlexW4205509299MaRDI QIDQ2130286

Najla Al-Nabhan, Jun Chen, Qing Yang

Publication date: 25 April 2022

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2022100

zbMATH Keywords

clusteringconstraint propagation1-normnonnegative matrix factorization (NMF)edge computingL2

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

An efficient strategy for identifying essential proteins based on homology, subcellular location and protein-protein interaction information

Cites Work

• Unnamed Item
• Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
• Nonnegative matrix factorization and its applications in pattern recognition
• Robust principal component analysis: a factorization-based approach with linear complexity
• Algorithms for Nonnegative Matrix Factorization with the β-Divergence
• Learning the parts of objects by non-negative matrix factorization
• Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
• A Quasi-Likelihood Approach to Nonnegative Matrix Factorization
• Independent Component Analysis and Blind Signal Separation
• A statistical framework for non-negative matrix factorization based on generalized dual divergence

This page was built for publication: Data representation using robust nonnegative matrix factorization for edge computing