Comparison of time complexity (per iteration) and memory usage of our proposed S3CMTF and other CMTF algorithms.
收藏Figshare2019-06-28 更新2026-04-29 收录
下载链接：
https://figshare.com/articles/dataset/Comparison_of_time_complexity_per_iteration_and_memory_usage_of_our_proposed_i_S_i_sup_3_sup_CMTF_and_other_CMTF_algorithms_/8344268
下载链接
链接失效反馈官方服务：
资源简介：
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
