Aug 2026· Japanese Journal of Statistics and Data Science· 0 citations· 8 references
TL;DR
NMF-LAB provides a unified, probabilistic, and scalable framework for classification based on nonnegative matrix factorization, which gives rise to two complementary designs that emphasize feature-level interpretability and competitive predictive accuracy.
Abstract
Non-negative matrix factorization (NMF) is widely used for representation learning and interpretable analysis in high-dimensional nonnegative data, but standard formulations are unsupervised and do not directly address classification. Existing supervised extensions typically incorporate labels only through penalties or graph constraints and often require an external classifier. We propose
NMF-LAB
(Non-negative Matrix Factorization for Label Matrix), a classification framework that directly factorizes the label matrix
Y
while treating covariates
A
as explanatory variables. By modeling class labels as the target of factorization, NMF-LAB yields a direct probabilistic mapping from covariates to labels without an additional classifier. The proposed framework gives rise to two complementary designs.
NMF-LAB Direct
emphasizes feature-level interpretability through its nonnegative and additive structure, whereas
NMF-LAB Kernel
incorporates nonlinear covariates to improve predictive performance and generalization. Kernel-based similarities are integrated via Gaussian-kernel covariates, and the kernel design scales to large datasets through Nyström approximation. Extensive experiments on diverse datasets, ranging from small- and medium-scale benchmarks to the large-scale MNIST dataset, demonstrate the interpretability of the Direct design through sparse, nonnegative coefficient estimation, and the competitive predictive accuracy of the Kernel design. Overall, NMF-LAB provides a unified, probabilistic, and scalable framework for classification based on nonnegative matrix factorization.
A novel multi-view clustering model based on non-negative tensor factorization (NTF), which employs multi-level fusion (both data-level and decision-level) to achieve view-consistent labels for multi-view data is proposed.
Quan-Xue Gao, Rui Wang, Jing Li et al.· IEEE Transactions on Pattern...· 0 citations
This work develops efficient algorithms based on the difference-of-convex function algorithm (DCA) and the alternating direction method of multipliers (ADMM) to enhance sparsity and identifiability of the learned factors in separable nonnegative matrix factorization.
An innovative MVC method utilizing orthogonal non-negative anchor tensor factorization, termed ATFMC, which employs a shared-nearest-neighbor density peaks clustering algorithm, which integrates cross-view features to select high-quality anchors and achieves superior clustering performance.
Jia-Yi Wang, Ming Yang, Jing-Yu Wang et al.· ACM Transactions on Intellig...· 0 citations
Matrix-valued observations arise in multiplex networks, neuroimaging, and other domains where population-level patterns are often low-rank and subjects may express several latent patterns simultaneously. Existing tensor PCA methods provide continuous subject scores but their loading matrices can be difficult to interpr...
David P. Snider, Zhongyuan Lyu, Jian Kang et al.· 0 citations
Semi-supervised learning (SSL) aims to effectively utilize a small amount of labeled data together with a large volume of unlabeled data to improve learning performance. Among various SSL strategies, label propagation has been widely adopted due to its ability to diffuse label information across data points via graph s...
Hongmin Cai, Jiali Sun, Fei Qi et al.· IEEE Transactions on Neural...· 0 citations
Matrix factorization (MF) is a widely used backbone for modeling large relational data due to its simplicity, scalability, and interpretability. However, classical MF uses a single shared latent basis, which can be overly restrictive for heterogeneous matrices. In this paper, we propose Masked Mixture Factorization (MM...
Yong-chan Park, Jeongyoung Lee, Seungjoo Lee et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.