增量张量分解的渐进式推荐

Dipannita Biswas, K. M. Azharul Hasan, Zaima Zarnaz
{"title":"增量张量分解的渐进式推荐","authors":"Dipannita Biswas, K. M. Azharul Hasan, Zaima Zarnaz","doi":"10.1109/ICCIT57492.2022.10054697","DOIUrl":null,"url":null,"abstract":"There are several circumstances in which constantly updated multidimensional tensor data must be analyzed in real-time in order to yield quick recommendation in our fast-changing data world. Methods for incremental tensor decompositions are powerful tools for analyzing and predicting fast-growing multidimensional datasets. In this research, we provide a robust model that overcomes the limitations of the most popular incremental tensor decomposition methods and yields high-accuracy prediction results for enormous datasets with fast execution time. Testing our model on datasets, we discovered that it was able to create a tensor summary that could reflect both the new and old datasets properly and performed better than traditional static methods.","PeriodicalId":255498,"journal":{"name":"2022 25th International Conference on Computer and Information Technology (ICCIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Progressive Recommendation by Incremental Tensor Factorization\",\"authors\":\"Dipannita Biswas, K. M. Azharul Hasan, Zaima Zarnaz\",\"doi\":\"10.1109/ICCIT57492.2022.10054697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are several circumstances in which constantly updated multidimensional tensor data must be analyzed in real-time in order to yield quick recommendation in our fast-changing data world. Methods for incremental tensor decompositions are powerful tools for analyzing and predicting fast-growing multidimensional datasets. In this research, we provide a robust model that overcomes the limitations of the most popular incremental tensor decomposition methods and yields high-accuracy prediction results for enormous datasets with fast execution time. Testing our model on datasets, we discovered that it was able to create a tensor summary that could reflect both the new and old datasets properly and performed better than traditional static methods.\",\"PeriodicalId\":255498,\"journal\":{\"name\":\"2022 25th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 25th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIT57492.2022.10054697\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 25th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT57492.2022.10054697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在一些情况下,必须实时分析不断更新的多维张量数据,以便在快速变化的数据世界中产生快速推荐。增量张量分解方法是分析和预测快速增长的多维数据集的有力工具。在本研究中,我们提供了一个鲁棒模型,克服了最流行的增量张量分解方法的局限性,并在快速执行的情况下对大量数据集产生高精度的预测结果。在数据集上测试我们的模型,我们发现它能够创建一个张量摘要,可以正确地反映新的和旧的数据集,并且比传统的静态方法执行得更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Progressive Recommendation by Incremental Tensor Factorization
There are several circumstances in which constantly updated multidimensional tensor data must be analyzed in real-time in order to yield quick recommendation in our fast-changing data world. Methods for incremental tensor decompositions are powerful tools for analyzing and predicting fast-growing multidimensional datasets. In this research, we provide a robust model that overcomes the limitations of the most popular incremental tensor decomposition methods and yields high-accuracy prediction results for enormous datasets with fast execution time. Testing our model on datasets, we discovered that it was able to create a tensor summary that could reflect both the new and old datasets properly and performed better than traditional static methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信