期刊
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
卷 14, 期 5, 页码 2011-2022出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2017.2766528
关键词
Big data; high-dimensional and sparse matrix; learning algorithms; missing-data estimation; nonnegative latent factor analysis; optimization methods recommender system
类别
资金
- National Key Research and Development Program of China [2017YFC0804002]
- Royal Society of the UK [61611130209]
- National Natural Science Foundation of China [61611130209, 61772493, 91646114, 51609229]
- FDCT (Fundo para o Desenvolvimento das Ciencias e da Tecnologia) [119/2014/A3]
- Pioneer Hundred Talents Program of Chinese Academy of Sciences
- Young Scientist Foundation of Chongqing [cstc2014kjrc-qnrc40005]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据