An Inherently Nonnegative Latent Factor Model for High-Dimensional and Sparse Matrices from Industrial Applications

Xin Luo, MengChu Zhou, Shuai Li, Mingsheng Shang

IEEE Transactions on Industrial Informatics · 2017 · 202 citations · 72 references

Concepts

TL;DR

High‑dimensional, sparse matrices arise in many industrial and big‑data settings, and while nonnegative matrix factorization is effective for extracting patterns, existing methods are inefficient and constrained. This study proposes an inherently nonnegative latent factor (INLF) model to extract nonnegative latent factors from HiDS matrices. The INLF model links output factors and decision variables through a single‑element‑dependent mapping, enabling unconstrained parameter training while preserving nonnegativity. Experiments on six industrial HiDS matrices show that INLF learns latent factors more efficiently than any existing method.

Abstract

High-dimensional and sparse (HiDS) matrices are commonly encountered in many big-data-related and industrial applications like recommender systems. When acquiring useful patterns from them, nonnegative matrix factorization (NMF) models have proven to be highly effective owing to their fine representativeness of the nonnegative data. However, current NMF techniques suffer from: 1) inefficiency in addressing HiDS matrices; and 2) constraints in their training schemes. To address these issues, this paper proposes to extract nonnegative latent factors (NLFs) from HiDS matrices via a novel inherently NLF (INLF) model. It bridges the output factors and decision variables via a single-element-dependent mapping function, thereby making the parameter training unconstrained and compatible with general training schemes on the premise of maintaining the nonnegativity constraints. Experimental results on six HiDS matrices arising from industrial applications indicate that INLF is able to acquire NLFs from them more efficiently than any existing method does.

References

72