政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/153281

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/153281

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113648/144635 (79%)
造访人次 : 51578226 在线人数 : 849

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 資訊學院 > 資訊科學系碩士在職專班 > 學位論文 > Item 140.119/153281

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/153281

题名:	數位行銷中無Cookie內容對於廣告投遞的產業推薦 Industry Recommendation for Cookieless Contents in Digital Marketing
作者:	邱盈儒 Chiu, Ying-Ju
贡献者:	李蔡彥 Li, Tsai-Yen 邱盈儒 Chiu, Ying-Ju
关键词:	Cookieless 數位廣告推薦系統點擊率預測自然語言處理關鍵字萃取 Cookieless Digital Advertising Recommendation System CTR Prediction Natural Language Processing Keyword Extraction
日期:	2024
上传时间:	2024-09-04 14:35:54 (UTC+8)
摘要:	隨著各個主流瀏覽器相繼宣布逐步淘汰第三方Cookie，數位廣告投放面臨巨大的挑戰。在遵守全球各國隱私法規的同時，如何仍能保持高精準度的廣告投放，成為數位廣告商的當務之急。本研究提出了一種在不使用任何使用者個人資料的情況下，通過解析使用者瀏覽的文本內容來進行廣告投放的潛在替代方法。我們採用了先進的深度學習技術來處理和理解文本內容。通過對使用者瀏覽的文章、新聞和其他文本內容進行語義分析，我們可以推測出使用者的潛在興趣和需求，進而實現精準的廣告推薦。為了驗證此方法的有效性，我們進行了一系列實驗，重點測試了該方法在點擊率預測任務中的表現。實驗結果顯示，儘管不使用傳統的使用者行為數據，我們的方法仍能達到令人滿意的預測精度。這表明，通過解析文本內容，可以在一定程度上替代Cookie所提供的功能，為數位廣告商提供了一種可行的解決方案。此外，我們還比較了不同深度學習模型和參數配置對預測效果的影響，找出了在不同情境下的最佳配置。本研究不僅為數位廣告投遞提供了一種新的思路，還展示了在無Cookie環境下利用文本內容進行廣告推薦的潛力。隨著數位行銷生態系統的不斷變化，我們的方法有望成為廣告商適應新形勢的重要工具，既能滿足隱私保護的需求，又能保持廣告的高效投放。 As major web browsers gradually announce the phasing out of third-party cookies, digital advertising faces significant challenges. Ensuring high-precision advertisement targeting while complying with global privacy regulations has become a critical issue for digital advertisers. This study proposes a potential alternative method for advertisement delivery without using any personal user data by analyzing the text content browsed by users. We employ advanced deep learning techniques to process and understand the text content. By semantically analyzing articles, news, and other textual content browsed by users, we can infer their potential interests and needs, thereby achieving precise advertisement recommendations. To validate the effectiveness of this method, we conducted a series of experiments, focusing on its performance in the click-through rate (CTR) prediction task. The experimental results show that our method can achieve satisfactory prediction accuracy even without traditional user behavior data. This indicates that text content analysis can partially replace the functionality provided by cookies, offering a feasible solution for digital advertisers. Additionally, we compared the effects of different deep learning models and parameter configurations on prediction performance, identifying the optimal setups under various scenarios. This study not only provides a new approach for digital advertisement delivery but also demonstrates the potential of using text content for advertisement recommendations in a cookieless environment. As the digital marketing ecosystem continues to evolve, our method is expected to become an essential tool for advertisers to adapt to new conditions, meeting privacy protection requirements while maintaining efficient advertisement delivery.
參考文獻:	[1] A. Bahirat. Contextual recommendations using nlp in digital marketing. In X.-S. Yang, S. Sherratt, N. Dey, and A. Joshi, editors, Proceedings of Sixth International Congress on Information and Communication Technology, pages 655–664, Singa- pore, 2022. Springer Singapore. [2] S.Bharati,M.R.H.Mondal,P.Podder,andV.S.Prasath.Federatedlearning:Appli- cations, challenges and future directions. International Journal of Hybrid Intelligent Systems, 18(1–2):19–35, May 2022. [3] J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for re- ordering documents and producing summaries. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’98, page 335–336, New York, NY, USA, 1998. Association for Computing Machinery. [4] H.-T. Cheng, L. Koc, J. Harmsen, T. Shaked, T. Chandra, H. Aradhye, G. Anderson, G. Corrado, W. Chai, M. Ispir, R. Anil, Z. Haque, L. Hong, V. Jain, X. Liu, and H. Shah. Wide & deep learning for recommender systems, 2016. [5] cropgpt. Confusion matrix – explanation, 2020. https://cropgpt.ai/ confusion-matrix-explanation/. [6] J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova. Bert: Pre-training of deep bidi- rectional transformers for language understanding, 2019. [7] O. Espejel. how-to-train-sentence-transformers, 2022. https://huggingface. co/blog/how-to-train-sentence-transformers. [8] Google. Building a more private web: A path towards making third party cookies obsolete, 2020. https://blog.chromium.org/2020/01/ building-more-private-web-path-towards.html. [9] Google. The next step toward phasing out third-party cook- ies in chrome, 2023. https://blog.google/products/chrome/ privacy-sandbox-tracking-protection/. [10] Google. A new path for privacy sandbox on the web, 2024. https:// privacysandbox.com/news/privacy-sandbox-update/. [11] M. Grootendorst. Keybert: Minimal keyword extraction with bert., 2020. [12] H. Guo, R. Tang, Y. Ye, Z. Li, and X. He. Deepfm: A factorization-machine based neural network for ctr prediction, 2017. [13] S. Ioffe and C. Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift, 2015. [14] A. Jain, M. Pathak, and M. Divya Prabha. Tackling cookieless domain recommen- dation for digital advertising targetting. page 111–112, 2022. [15] S.khan,Q.M.Ilyas,andW.Anwar.Contextualadvertisingusingkeywordextraction through collocation. In Proceedings of the 7th International Conference on Frontiers of Information Technology, FIT ’09, New York, NY, USA, 2009. Association for Computing Machinery. [16] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization, 2017. [17] J. Lian, X. Zhou, F. Zhang, Z. Chen, X. Xie, and G. Sun. xdeepfm: Combining explicit and implicit feature interactions for recommender systems. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '18. ACM, July 2018. [18] S. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28(2):129–137, 1982. [19] L. Long. Practice papers effective first-party data collection in a privacy-first world. Applied Marketing Analytics, 7(3):202–210, 2022. [20] MartinThoma. Receiver operating characteristic (roc) curve, 2018. https:// commons.wikimedia.org/w/index.php?curid=70212136. [21] T. Mikolov, K. Chen, G. Corrado, and J. Dean. Efficient estimation of word repre- sentations in vector space, 2013. [22] M. Pachilakis, P. Papadopoulos, E. P. Markatos, and N. Kourtellis. No more chasing waterfalls: A measurement study of the header bidding ad-ecosystem. In Proceedings of the Internet Measurement Conference, IMC ’19, page 280–293, New York, NY, USA, 2019. Association for Computing Machinery. [23] Rakesh4realg. Neighborhood based collaborative filter- ing —part 4, 2019. https://medium.com/fnplus/ neighbourhood-based-collaborative-filtering-4b7caedd2d11. [24] N. Reimers and I. Gurevych. Sentence-bert: Sentence embeddings using siamese bert-networks, 2019. [25] S. Rendle. Factorization machines. In 2010 IEEE International Conference on Data Mining, pages 995–1000, 2010. [26] W. Shen. Deepctr: Easy-to-use,modular and extendible package of deep-learning based ctr models. https://github.com/shenweichen/deepctr, 2017. [27] W.Song,C.Shi,Z.Xiao,Z.Duan,Y.Xu,M.Zhang,andJ.Tang.Autoint:Automatic feature interaction learning via self-attentive neural networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM '19. ACM, Nov. 2019. [28] R. van Meteren. Using content-based filtering for recommendation. 2000. [29] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin. Attention is all you need, 2023. [30] J.Wang,W.Zhang,andS.Yuan.Displayadvertisingwithreal-timebidding(rtb)and behavioural targeting. Foundations and Trends in Information Retrieval, 11(4-5):297 –435, 2017. Cited by: 75; All Open Access, Green Open Access. [31] L. Wang, K.-C. Lee, and Q. Lu. Improving advertisement recommendation by en- riching user browser cookie attributes. volume 24-28-October-2016, page 2401 – 2404, 2016. [32] R.Wang,B.Fu,G.Fu,andM.Wang.Deep&crossnetworkforadclickpredictions, 2017. [33] R. Wang, R. Shivanna, D. Cheng, S. Jain, D. Lin, L. Hong, and E. Chi. Dcn v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems. In Proceedings of the Web Conference 2021, WWW '21. ACM, Apr. 2021. [34] Wikipedia.Cosinesimilarity,2007.https://en.wikipedia.org/wiki/Cosine_ similarity. [35] Wikipedia. Kullback–leibler divergence, 2011. https://en.wikipedia.org/ wiki/Kullback%E2%80%93Leibler_divergence. [36] Wikipedia. Elbow method (clustering), 2016. https://en.wikipedia.org/ wiki/Elbow_method_(clustering). [37] Wikipedia. General data protection regulation, 2016. https://en.wikipedia. org/wiki/General_Data_Protection_Regulation. [38] Wikipedia. California consumer privacy act, 2018. https://en.wikipedia.org/ wiki/California_Consumer_Privacy_Act. [39] R. Zhang, Q.-d. Liu, Chun-Gui, J.-X. Wei, and Huiyi-Ma. Collaborative filtering for recommender systems. In 2014 Second International Conference on Advanced Cloud and Big Data, pages 301–308, 2014. [40] Y. Zhang. An introduction to matrix factorization and factorization machines in recommendation system, and beyond, 2022.
描述:	碩士國立政治大學資訊科學系碩士在職專班 110971015
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0110971015
数据类型:	thesis
显示于类别:	[資訊科學系碩士在職專班] 學位論文

文件中的档案:

档案	描述	大小	格式	浏览次数
101501.pdf		3019Kb	Adobe PDF	6	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈