计算机应用研究2011，Vol.28Issue(12)：4475-4477,3.DOI:10.3969/j.issn.1001-3695.2011.12.019
非负张量分解的快速算法
Fast algorithm to nonnegative tensor factorization
摘要
Abstract
Abstract: As the multi-linear extension of nonnegative matrix factorization, nonnegative tensor factorization has been success-fully applied in many fields including signal processing,computer vision, data mining and neuroscience. This paper proposed a fast algorithm to nonnegative tensor factorization. Firstly, regarded a lager tensor data as the discretization of multivariate con-tinuous function and obtained a corresponding smaller tensor data by sampling. Secondly, performed the nonnegative factoriza-tion on the small tensor and easily computed the corresponding reconstruction tensor. Then, employed for the above reconstruc-tion tensor, two-dimensional linear interpolation to reconstruct the original tensor. Finally,the experimental results show the ef-fectiveness of the proposed fast algorithm to nonnegative tensor factorization.关键词
非负张量分解/非负矩阵分解/快速算法/采样/插值/重构Key words
nonnegative tensor factorization/ nonnegative matrix factorization/ fast algorithm/ sampling/ interpolation/ recon-struction/分类
信息技术与安全科学引用本文复制引用
史加荣,杨威,姜淑艳..非负张量分解的快速算法[J].计算机应用研究,2011,28(12):4475-4477,3.基金项目
陕西省自然科学基金资助项目(JQ1003) （JQ1003）
陕西省教育厅专项科研计划资助项目(09JK545) （09JK545）
