Dipannita Biswas, K. M. Azharul Hasan, Zaima Zarnaz
{"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}
引用次数: 0
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.