返回
Matrix factorization of large scale data using multistage matrix factorization
DOI:10.1007/s10489-020-01957-0.png)
摘要
En 中文
Matrix Factorization (MF) is a resource intensive task that consumes significant memory and computational effort and is not scalable with the quantum of data. When the size of the input matrix and the latent feature matrices are higher than the available memory, both on a Central Processing Unit (CPU) as well as a Graphical Processing Unit (GPU), loading all the required matrices on to CPU/GPU memory may not be possible. Such scenarios call for alternative techniques that not only allow parallelism but also address memory limitations and plays a crucial role in industrial applications. In this paper we propose a divide and conquer technique based on a two stage factorization process. In the first step, we divide the data set into different groups and factorize each group. In the second step, we use factorization based learning model to combine the latent features derived in the first step. Our motivation is to develop a method that can achieve both parallelism and scalability as well as address factorization of incrementally growing data. Our contribution is a novel multi-stage matrix factorization (MsMF) approach. The experimental results demonstrate improvements in RMSE as well as computational efficiency.
Keyword:
Multistage matrix factorization
Two-stage matrix factorization
Hierarchical matrix factorization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Abnormal changes in functional connectivity between the amygdala and frontal regions are associated with depression in Alzheimer’s disease杏仁核和额叶区域之间功能连接的异常变化与阿尔茨海默氏病的抑郁有关
Establishing Correlation Between Structural and Spectral Property in K-Shell StructureK壳结构中结构与光谱特性相关性的建立

