利用深度学习预测广告的瞬时喜爱度

IF 1.2 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Dipayan Saha, S.M.Mahbubur Rahman, Mohammad Tariqul Islam, M. Omair Ahmad, M.N.S. Swamy
{"title":"利用深度学习预测广告的瞬时喜爱度","authors":"Dipayan Saha,&nbsp;S.M.Mahbubur Rahman,&nbsp;Mohammad Tariqul Islam,&nbsp;M. Omair Ahmad,&nbsp;M.N.S. Swamy","doi":"10.1049/ccs2.12022","DOIUrl":null,"url":null,"abstract":"<p>The degree to which advertisements are successful is of prime concern for vendors in highly competitive global markets. Given the astounding growth of multimedia content on the internet, online marketing has become another form of advertising. Researchers consider advertisement likeability a major predictor of effective market penetration. An algorithm is presented to predict how much an advertisement clip will be liked with the aid of an end-to-end audiovisual feature extraction process using cognitive computing technology. Specifically, the usefulness of different spatial and time-domain deep-learning architectures such as convolutional neural and long short-term memory networks is investigated to predict the frame-by-frame instantaneous and root mean square likeability of advertisement clips. A data set named the ‘BUET Advertisement Likeness Data Set’, containing annotations of frame-wise likeability scores for various categories of advertisements, is also introduced. Experiments with the developed database show that the proposed algorithm performs better than existing methods in terms of commonly used performance indices at the expense of slightly increased computational complexity.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12022","citationCount":"1","resultStr":"{\"title\":\"Prediction of instantaneous likeability of advertisements using deep learning\",\"authors\":\"Dipayan Saha,&nbsp;S.M.Mahbubur Rahman,&nbsp;Mohammad Tariqul Islam,&nbsp;M. Omair Ahmad,&nbsp;M.N.S. Swamy\",\"doi\":\"10.1049/ccs2.12022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The degree to which advertisements are successful is of prime concern for vendors in highly competitive global markets. Given the astounding growth of multimedia content on the internet, online marketing has become another form of advertising. Researchers consider advertisement likeability a major predictor of effective market penetration. An algorithm is presented to predict how much an advertisement clip will be liked with the aid of an end-to-end audiovisual feature extraction process using cognitive computing technology. Specifically, the usefulness of different spatial and time-domain deep-learning architectures such as convolutional neural and long short-term memory networks is investigated to predict the frame-by-frame instantaneous and root mean square likeability of advertisement clips. A data set named the ‘BUET Advertisement Likeness Data Set’, containing annotations of frame-wise likeability scores for various categories of advertisements, is also introduced. Experiments with the developed database show that the proposed algorithm performs better than existing methods in terms of commonly used performance indices at the expense of slightly increased computational complexity.</p>\",\"PeriodicalId\":33652,\"journal\":{\"name\":\"Cognitive Computation and Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2021-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12022\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cognitive Computation and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/ccs2.12022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cognitive Computation and Systems","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/ccs2.12022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 1

摘要

在竞争激烈的全球市场上,广告的成功程度是供应商最关心的问题。鉴于互联网上多媒体内容的惊人增长,在线营销已成为另一种形式的广告。研究人员认为,广告的受欢迎程度是有效市场渗透的主要预测因素。提出了一种基于认知计算的端到端视听特征提取算法来预测广告片段的受欢迎程度。具体而言,研究了不同空间和时域深度学习架构(如卷积神经网络和长短期记忆网络)在预测广告片段逐帧瞬时和均方根喜爱度方面的有用性。还介绍了一个名为“BUET广告相似性数据集”的数据集,该数据集包含对各种类别广告的逐帧喜爱度分数的注释。在开发的数据库上进行的实验表明,该算法在常用性能指标方面优于现有方法,但计算复杂度略有增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Prediction of instantaneous likeability of advertisements using deep learning

Prediction of instantaneous likeability of advertisements using deep learning

The degree to which advertisements are successful is of prime concern for vendors in highly competitive global markets. Given the astounding growth of multimedia content on the internet, online marketing has become another form of advertising. Researchers consider advertisement likeability a major predictor of effective market penetration. An algorithm is presented to predict how much an advertisement clip will be liked with the aid of an end-to-end audiovisual feature extraction process using cognitive computing technology. Specifically, the usefulness of different spatial and time-domain deep-learning architectures such as convolutional neural and long short-term memory networks is investigated to predict the frame-by-frame instantaneous and root mean square likeability of advertisement clips. A data set named the ‘BUET Advertisement Likeness Data Set’, containing annotations of frame-wise likeability scores for various categories of advertisements, is also introduced. Experiments with the developed database show that the proposed algorithm performs better than existing methods in terms of commonly used performance indices at the expense of slightly increased computational complexity.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Cognitive Computation and Systems
Cognitive Computation and Systems Computer Science-Computer Science Applications
CiteScore
2.50
自引率
0.00%
发文量
39
审稿时长
10 weeks
×
引用
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学术官方微信