A video recommendation algorithm based on the combination of video content and social network

Abstract

Summary Recently, social network has been one of the biggest information exchange platforms of the Internet. Moreover, the users in social network used to watch videos through social network application. To provide a proper recommended video list, the video recommendation algorithm for social network is becoming a hot research issue. On one hand, more and more researchers introduce the concept of trust into video recommendation algorithms. However, most of them only select the trust friends based on the similarity and neglect the characteristics of social network. On the other hand, most previous video recommendation algorithms are only based on the number that a video is viewed to evaluate a video's quality. They do not make good use of the social relationship in social network and the video's reputation. This paper mainly focuses on the challenge that the effectiveness and performance of current video recommendation algorithm in social network cannot satisfy the users. In this paper, we propose a novel video recommendation algorithm based on the combination of video content and social network. Our proposed algorithm consists of the trust friends computing model and video's quality evaluation model. The trust friends computing method takes into account similarity between users, interaction between users, and the active degree of a user. In our video's quality evaluation model, we combine the acceptance ratio of a video with a video's reputation. The video can be given an appropriate rating score through this model. We design corresponding trust friends computing algorithm and video recommendation algorithm respectively for two proposed models. Our integral video recommendation algorithm consists of these two algorithms. The experimental results indicate that the performance and effectiveness of our algorithm are better than those of two classical video recommendation algorithms (i.e., user‐based collaborative filtering algorithm and TBR‐d algorithm), in terms of precision, recall and F1‐measure. Copyright © 2016 John Wiley & Sons, Ltd.

A Markovian analytical framework for public‐safety video sharing by device‐to‐device communications

“…[11][12][13][16][17][18] The mobility-based link-switching to consistent content transmission for mobile users has not been fully investigated in D2D enabled networks. [11][12][13][16][17][18] The mobility-based link-switching to consistent content transmission for mobile users has not been fully investigated in D2D enabled networks.…”

“…Most of the existing works on multimedia traffic transmission in both traditional cellular networks and D2D enabled cellular networks, consider single-camera stream with the optimization of throughput, delay, jitter, and Quality-of-Experience (QoE). [11][12][13][16][17][18] However, under a large number of requests and flexible view-switching, multi-camera streams bring a new massive view-based link-switching problem for D2D enabled cellular networks, which remains an open issue.…”

Special issue on Big Data Security and Intelligent Data in Clouds (BDS‐IDC)

“…This special issue also addresses the aspect of combining video with social networks. Cui et al proposed novel video recommendation algorithm based on the combination of video content and social network. The proposed algorithm consisted of the trust friends computing model and video's quality evaluation model.…”

Targeted content dissemination in mobile social networks taking account of resource limitation

“…Content-based dissemination in the infrastructure network is performed by constructing an overlay network, whose role is to forward content from source to all interested destinations and nodes' interests are extracted from some kind of social networks. 16,51,52 But this approach hits a major barrier to be applied in MSNs, which is the lack of end-to-end connectivity between nodes that prevents building any network-wide overlay. 15 So reported methods unveil innovative approaches for content-based dissemination which in turn face new challenges.…”