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.
CITATION STYLE
Kang, S., Jeong, C., & Chung, K. (2020). Tree-based real-time advertisement recommendation system in online broadcasting. IEEE Access, 8, 192693–192702. https://doi.org/10.1109/ACCESS.2020.3031925
Mendeley helps you to discover research relevant for your work.