arXiv:2106.02213
공식 코드 · Papers with Code
Analysis of the robustness of NMF algorithms
원문 초록
We examine three non-negative matrix factorization techniques; L2-norm, L1-norm, and L2,1-norm. Our aim is to establish the performance of these different approaches, and their robustness in real-world applications such as feature selection while managing computational complexity, sensitivity to noise and more. We thoroughly examine each approach from a theoretical perspective, and examine the performance of each using a series of experiments drawing on both the ORL and YaleB datasets. We examine the Relative Reconstruction Errors (RRE), Average Accuracy and Normalized Mutual Information (NMI) as criteria under a range of simulated noise scenarios.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Generative Latent Kernel Modeling for Blind Motion Deblurring
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Simple is what you need for efficient and accurate medical image segmentation
Differentially Private Relational Learning with Entity-level Privacy Guarantees
EtiCor++: Towards Understanding Etiquettical Bias in LLMs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.