Abstract

The viewing time of media content per week through TV is still dominant. Users are exposed to numerous advertisements, such as commercials, electronic home shopping, product placement (PPL), and T-Commerce while watching TV programs. Most of the advertisement systems provide a good overview of products. However, traditional advertising services do not consider user preferences, meaning it is difficult to expect anything more than mere exposure to them. We can adopt a recommendation system to predict the preference. However, existing recommendation systems find it difficult to satisfy the real-time requirements of online broadcasting because of the large overhead incurred in preference prediction processes. In this paper, we propose a real-time recommendation system to provide personalized advertisements. The proposed system generates tree models based on user historical data. To reduce the overhead of preference prediction, we introduce a sorted HashMap that enables fast tree searches. For sophisticated preference prediction, the proposed system normalizes the users' preferences by considering the characteristics of their tree model. Finally, we conduct experiments to evaluate the performance of the proposed tree-based recommendation system.

Highlights

  • Information overload seriously affects the utilization efficiency of data collected online [1]

  • We introduce a tree model that predicts user preferences in real-time based on user-content interaction data

  • We propose a new preference prediction algorithm that can meet the real-time requirements of online broadcasting

Read more

Summary

INTRODUCTION

Information overload seriously affects the utilization efficiency of data collected online [1]. In online broadcasting systems with audio/video capabilities (such as TV, tablet PCs, and smartphones), advertisement services provide information about a product to a user in many ways. The recommendation system is a high-quality technology that predicts a user's preference based on various factors, such as search history, evaluation score, and frequency of use [5]. It can be implemented in the advertisement domain. The existing recommendation mechanisms have large computation overhead and highly complex operations For this reason, it is not appropriate to introduce them in online broadcasting. We propose a personalized advertisement recommendation system considering user preferences in online broadcasting.

RELATED WORK
TREE MODEL FORMULATION
DATASETS The experiments are conducted using large-scale real-world datasets
Findings
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call