遇见数据集

Comparison of time complexity (per iteration) and memory usage of our proposed S3CMTF and other CMTF algorithms.

收藏
Figshare2019-06-28 更新2026-04-29 收录
官方服务:

资源简介:

S3CMTF-opt shows the lowest time complexity and S3CMTF-base shows the lowest memory usage. For simplicity, we assume that all modes are of size I, of rank J, and an I × K matrix is coupled to one mode. P is the number of parallel cores. (* indicates the lowest time or memory).

创建时间:
2019-06-28
二维码
社区交流群
二维码
科研交流群
商业服务