基于注意机制和密集网络模型的电子商务特色商品推荐系统研究

IF 3.6
Daocai Wang
{"title":"基于注意机制和密集网络模型的电子商务特色商品推荐系统研究","authors":"Daocai Wang","doi":"10.1016/j.sasc.2025.200216","DOIUrl":null,"url":null,"abstract":"<div><div>This paper constructs two cross-domain recommendation models based on the perspective of user sharing and non-sharing, both of which rely on intensive convolutional networks and attention mechanisms. This research introduces lightweight Dense Net and fine-grained pruning for model optimization. Lightweight Dense Net retains the core advantages by optimizing the repeat structure while reducing redundant parameters. Compared with the original network, the accuracy loss is not &gt;2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems. Compared with the original network, the accuracy loss is not &gt;2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems.</div></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"7 ","pages":"Article 200216"},"PeriodicalIF":3.6000,"publicationDate":"2025-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on e-commerce special commodity recommendation system based on attention mechanism and Dense Net model\",\"authors\":\"Daocai Wang\",\"doi\":\"10.1016/j.sasc.2025.200216\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper constructs two cross-domain recommendation models based on the perspective of user sharing and non-sharing, both of which rely on intensive convolutional networks and attention mechanisms. This research introduces lightweight Dense Net and fine-grained pruning for model optimization. Lightweight Dense Net retains the core advantages by optimizing the repeat structure while reducing redundant parameters. Compared with the original network, the accuracy loss is not &gt;2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems. Compared with the original network, the accuracy loss is not &gt;2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems.</div></div>\",\"PeriodicalId\":101205,\"journal\":{\"name\":\"Systems and Soft Computing\",\"volume\":\"7 \",\"pages\":\"Article 200216\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2025-03-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Systems and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2772941925000341\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772941925000341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文构建了基于用户共享和非共享视角的两种跨域推荐模型,这两种模型都依赖于密集卷积网络和注意机制。本研究引入了轻量级Dense Net和细粒度剪枝来进行模型优化。轻量化密集网通过优化重复结构,减少冗余参数,保留了核心优势。与原网络相比,精度损失不超过2%,参数个数减少到204.96Mb,压缩比为8.38,计算量减少0.96Gflops,便于硬件部署。针对轻量级Dense Net在进行稀疏化后在存储和计算方面没有实际优化的问题,本文创新性地提出了CSB压缩存储方法并支持稀疏卷积算法,可以有效降低推理网络的计算和存储需求,实现真正的计算加速和存储优化,克服硬件部署问题。与原网络相比,精度损失不超过2%,参数个数减少到204.96Mb,压缩比为8.38,计算量减少0.96Gflops,便于硬件部署。针对轻量级Dense Net在进行稀疏化后在存储和计算方面没有实际优化的问题,本文创新性地提出了CSB压缩存储方法并支持稀疏卷积算法,可以有效降低推理网络的计算和存储需求,实现真正的计算加速和存储优化,克服硬件部署问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on e-commerce special commodity recommendation system based on attention mechanism and Dense Net model
This paper constructs two cross-domain recommendation models based on the perspective of user sharing and non-sharing, both of which rely on intensive convolutional networks and attention mechanisms. This research introduces lightweight Dense Net and fine-grained pruning for model optimization. Lightweight Dense Net retains the core advantages by optimizing the repeat structure while reducing redundant parameters. Compared with the original network, the accuracy loss is not >2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems. Compared with the original network, the accuracy loss is not >2 %, the number of parameters is reduced to 204.96Mb, the compression ratio is 8.38, and the computational amount is reduced by 0.96Gflops, which facilitates the hardware deployment. Given the problem that lightweight Dense Net has no practical optimization in storage and computing after sparsing, this paper innovatively proposes a CSB compression storage method and supporting sparse convolution algorithm, which can effectively reduce the computing and storage requirements of inference network, realize the real computing acceleration and storage optimization, and overcome the hardware deployment problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信