Predicting popularity of online videos
using Support Vector Regression
In this work, we propose a regression method to predict the popularity of an online video measured by its number of views. Our method uses Support Vector Regression with Gaussian Radial Basis Functions. We show that predicting popularity patterns with this approach provides more precise and more stable prediction results, mainly thanks to the non-linear character of the proposed method as well as its robustness. We prove the superiority of our method against the state of the art using datasets containing almost 24,000 videos from YouTube and Facebook. We also show that using visual features, such as the outputs of deep neural networks or scene dynamics’ metrics, can be useful for popularity prediction before content publication. Furthermore, we show that popularity prediction accuracy can be improved by combining early distribution patterns with social and visual features and that social features represent a much stronger signal in terms of video popularity prediction than the visual ones.
Recent years have brought an enormous increase in the popularity of online platforms, such as YouTube, Facebook, Twitter or Instagram, where users can easily share various content with other people. YouTube is the biggest video sharing website with over 1 billion users that watch hundreds of millions of hours and generate billions of views . The most popular social network with almost 1.5 billion registered users is Facebook , followed by Instagram with over 400 million users  and Twitter with over 300 million active users sending 500 million tweets (short messages) per day . Although not every social network user is equally active in creating and publishing content, it is estimated that 85% of Facebook users actually do engage in the content creation process . Among different types of content generated by the users, photos and videos become more and more popular, mainly thanks to the proliferation of mobile devices with embedded high-quality cameras, but also as a result of studies indicating that visual content leads to higher user engagement . Since the amount of visual content accessible online is so high, one should expect that only a small portion of this data gains significant popularity, while the rest remains seen only by a small audience . This phenomenon has led to the inception of the term viral video which describes a movie uploaded online that is gaining audience in an exponential manner, often reaching millions of views within a few days of publishing.
In this context, the ability to predict the number of views of a given video can serve multiple causes, from load balancing the throughput of the data centers and servers to adjusting marketing efforts of the media houses that publish advertisements online. The latter application becomes increasingly significant, as marketing agencies spend 13% more money on digital marketing each year, with an estimated $52.8 billion spent in 2015 . A typical approach to optimize those spendings is to use A/B testing of the content and adjust the content served to the consumers accordingly. Netflix reported that using A/B testing of the thumbnail images of the videos can lead up to a 30% increase in video view counts . Similar increase was also reported for A/B testing of opening video scenes on Facebook . This method, however, requires proper space sampling and can easily be biased if the selected group of testers is not large enough. Moreover, social networks such as Facebook, allow the marketing agencies to promote their content by increasing the reach of their videos. In this context, estimating the future popularity of a video can improve the allocation of the promotional funds. For instance, if a video of a given publisher is expected to reach 1 million organic views and its predicted view count exceeds this number, the promotional funds can be spent on other less popular videos instead.
Predicting the popularity of videos published online is a challenging problem. First of all, the external context of the content plays an important role in the distribution patterns of the video, i.e. if the subject of a video is trending in other media (television, radio, newspapers), its popularity online is also expected to be high. Secondly, the structure of the network built around the publisher such as the number of its friends and followers, and their respective friends and followers, has a substantial impact on the distribution of the content and therefore its future popularity. Last but not least, factors such as the relevance of the video to the final viewer and the relationship between real world events and the content are complex and difficult to capture, increasing the difficulty of popularity prediction.
Nevertheless, in the recent years several attempts have been made to address the problem of online content popularity prediction [11, 12, 13, 14, 15, 16]. Researchers analysed several types of online content, including news articles , Twitter messages [17, 18], images [15, 19] and videos [12, 14, 20, 21]. Proposed prediction methods rely either on intrinsic features of the content, such as visual or textual cues [13, 15, 19], or on social features describing the structure of the social network  or on early distribution patterns [11, 14]. To our knowledge, not too much attention was paid to the problem of combining different cues to predict the popularity of the online content in the context of videos.
In this work, we propose a regression method based on Support Vector Regression with Gaussian Radial Basis Functions to predict the popularity of online videos. We use visual cues as video features that can be computed before the video is published as well as early popularity patterns of the video once it is released online, including view counts and social interactions’ data. We evaluate our method on datasets containing almost 24,000 online videos uploaded to YouTube and Facebook. The contributions of this paper are the following:
We introduce a new popularity prediction method, named Popularity-SVR, for online video content that relies on Support Vector Regression (SVR) with Gaussian Radial Basis Function (RBF) kernel and show that it outperforms the state of the art.
We collect and open to the public a new dataset of over 1,800 online videos uploaded to the largest social network along with the corresponding temporal and visual features.
The remainder of this paper is organized in the following manner. In Section II we give an overview of the state of the art. In Section III we discuss the features used to predict the popularity of online videos using methods described in Section IV. Section V presents the results and we conclude this work in Section VI.
Ii Related work
Due to the enormous growth of the number of Internet users and online data available, popularity prediction of online content has received a lot of attention from the research community. Early works have focused on user web-access patterns  and more specifically on the distribution of the video content , as it accounted for a significant portion of the Internet traffic and the findings could be used to determine the benefits of caching. Once the general access patterns were understood, the attention of the research community shifted to the actual popularity prediction of various content types.
Textual content, such as Twitter messages, Digg stories or online news, is typically distributed very fast and catches users’ attention for a relatively short period of time . Its popularity, measured in number of user actions such as comments, re-tweets or likes, is therefore highly skewed and can be modelled, e.g. with log-normal distribution . Video content exhibits similar heavy-tailed distribution, while its popularity is typically measured by the number of views . The availability of the video content and related popularity data via the YouTube platform, where every minute over 100 hours of video is uploaded , researchers were able to investigate other aspects related to the video content distribution. The most representative topics include prediction of the peak popularity time of the video  or identifying popularity evolution patterns . However, most if not all methods used to predict the popularity of a given video rely on its early evolution pattern [11, 12, 14] or its social context . Contrary to the method proposed in this paper, they do not exploit additional visual cues to improve their prediction accuracy.
In particular, Szabo and Huberman  observe a log-linear relationship between the views of the YouTube videos at early stages after the publication and later times. The reported Pearson correlation coefficient between the log-transformed number of views after seven and thirty days after publication exceeds 0.9, which suggests that the more popular submission is at the beginning, the more popular it will become later.
Building up on the log-linear model of ,  proposed to extend their approach with Multivariate Linear (ML) model that uses multiple inputs from previous stages (values of views received by a video in the early times after publication) to predict the future popularity of the video. On top of the Ordinary Least Squares regressor, they also experimented with the Ridge regressor using Radial Basis Functions (RBF) which reduces the prediction error by 20% on average with respect to the method of . In this paper, we follow this lead and propose to use Gaussian RBF as a Support Vector Regression kernel .
To improve the prediction accuracy, Xu et al.  propose to add information about the structure of publisher’s social network, including the proportion of the users who viewed and shared a video as well as the number of their followers. Their so-called Social-Forecast method aims to maximize the forecast reward defined as a trade-off between prediction accuracy and the timing of the prediction. Although the method shows improved accuracy in terms of forecast reward, it requires fairly detailed data concerning social network structure, which is not always available. For instance, Facebook, the social network with the highest number of registered users, does not allow to browse users’ history of viewed videos and its followers’ counts by public entities. Therefore, the Social-Forecast method, evaluated on the Chinese RenRen social network database where those metrics are publicly available, has to be adapted to other platforms if needed.
Although it is not the focus of this paper, a few approaches have been taken to predict the popularity of online content based on several information sources [24, 30]. For instance,  use data from Twitter to detect YouTube videos that will receive a significant growth in popularity. The model is based on the extraction of popular and trending topics on Twitter and linking them to the corresponding YouTube videos. This results in 70% higher accuracy of significant popularity growth prediction compared to the single-domain models that only use data from YouTube.
All the above mentioned works propose to predict future popularity of online content after the content is published. It is much more interesting, although more challenging as well, to attempt to predict the popularity of a given piece of content before it is published. Khosla et al.  address this problem in the context of images. More precisely, the proposed method analyses visual and social features of the images published on Flickr to predict their relative popularity after the publication. Using a dataset of over 2 million images, the authors demonstrate that features such as image color or number of friends of the publisher play a significant role in determining the future popularity of a given photo. Moreover, using those cues, they are able to predict the normalized view count of images. This work was later extended by Gelli et al.  to use visual sentiment and context features.
Several recent works [21, 20] have also tackled the problem of image popularity in social media from a temporal perspective. Exploiting the popularity patterns and trends, Wu et al. proposed estimating popularity based on multi-scale analysis of the dependencies between user, time and item represented in Flickr pictures.
We build on these works by proposing a popularity prediction method for social media videos. We use computer vision algorithms to calculate visual features and verify if combining it with early evolution data can improve prediction accuracy for videos published online. Although recent works have also addressed the problem of online video analysis  and popularity prediction  from a multi-modal perspective, their focus is on micro-videos that last not more than a few seconds, while we consider longer videos. To the best of our knowledge, this is one of the first attempts to use this kind of features in the context of online video popularity prediction.
In this section we discuss features of the videos used to predict their popularity. We start with the description of visual features that can be extracted before a video is published online. We then follow with an overview of temporal features recorded after the video was published. In our terminology, the temporal features refer to the information that changes in a timely fashion, e.g. number of aggregated video views that increases with time or number of likes a given video receives that also changes in time.
Iii-a Visual features
Features presented here are computed using several computer vision algorithms applied on raw video data. The resulting features are then used to provide additional cues for the prediction methods.
Video characteristics: We use simple video features describing video length, number of frames, video resolution and frame dimensions.
Color: We first cluster the color space into 10 distinct classes depending on their coordinates in the Hue-Saturation-Value colorspace: black, white, blue, cyan, green, yellow, orange, red, magenta and other. Then, for each frame of a video, we assign a pixel to a single color and identify the dominant color of every frame. We aggregate the results of the color classification and represent color feature of a video as a histogram of dominant colors across the frames as well as dominant video color.
Face: Using a face detector based on a cascade classifier , we detect the region of a frame with a face. We then count the number of detected faces per frame, number of frames with faces present and the size of the face regions with respect to the frame size. The results are averaged across all video frames and stored.
Text: With a combination of edge detection and morphological filters, we identify the regions of the image with imprinted subtitles and apply Tesseract-OCR engine111https://code.google.com/p/tesseract-ocr/ to validate the detection. We then report the following textual characteristics of a video: a portion of the frames with imprinted text in the video and an average ratio of the text region size with respect to the frame size.
Scene dynamics: To quantify scene dynamics of a video, we first employ Edge Change Ration algorithm  and determine shot boundaries. We then analyse the boundaries distribution and extract the number of shots and an average shot length in seconds. We also classify the shots as hard or soft cuts and save the corresponding histogram of shots.
Clutter: We use a Canny edge detector  to quantify the clutter present in the video. We report the ratio of the edge pixels detected and all pixels in a frame, averaged across all frames in a video.
Rigidity: To evaluate the scene rigidity we estimate the homography between two consecutive frames using a combination of FAST feature point detector  and BRIEF descriptor . We then save an average number of frames where a valid homography between current and previous frames can be found.
Deep features: To complement the set of visual features we use a recently proposed ResNet-152  - a deep convolutional neural network with 152 layers which recently won the place in the ImageNet classification, detection and localization challenges. For each video, we first extract a set of thumbnails representing each scene. We propagate them through the ResNet-152 network and average the resulting 1000-dimensional probability output vector over all the thumbnails of a given video. Finally, we normalize the vector so that all its elements sum up to one.
Fig. 1 shows a sample result of the computer vision analysis of two video frames.
Iii-B Temporal features
Once a video is made available online we are able to collect data related to its popularity that is the number of views as well as other social interactions aggregates. We can therefore introduce the following features:
Views: an aggregated number of times a given video is watched that increases with time,
Social: aggregated number of likes, shares and comments on a given video that also change in time.
Figure 2 shows a set of hourly increments in views, likes, comments and shares for a sample Facebook video. The evolution patterns of the video statistics provide an important cue for the popularity prediction methods, as  reported high correlation between log-transformed view counts early after the publication and later on. These results are also confirmed by the experiments presented in Section V.
In this paper, following the works of [11, 14] we cast the problem of popularity prediction as a regression task. More precisely, our goal is to predict the number of views of a video at time , given features available from the first days after publication (where ). In this section, we discuss the regression methods used for the prediction in Section V. We start by discussing the state-of-the-art methods in Section IV-A. We then follow with the description of our proposed method called Popularity-SVR in Section IV-B.
Iv-a State-of-the-art methods
First, we discuss a set of state-of-the-art techniques, such as Univariate Linear (UL) Regression, Multivariate Linear (ML) Regression and Multivariate Radial Basis Function (MRBF) Regression.
Univariate Linear (UL) Regression
Based on the high correlation observed between log-transformed early and late popularity counts of online content,  proposed to use a simple regressor to predict the future popularity of a given video . According to this model, the number of views of a video can be calculated at time as:
where defines natural exponential function, defines predicted number of views for video at time when prediction is made at time . is a weight learnt from training videos and is the number of views at time . Weight can be computed using the ordinary least squares model.
Multivariate Linear (ML) Regression
Pinto et al.  propose to extend the UL regression model by including also the views accumulated by the video before . In other words, they increase the dimensionality of the input feature vector. Instead of using a single cumulated view count at time , they sample the timeline between publication time and reference time and use the number of views received in those sampling intervals (views’ increments or deltas) to form a feature vector. The proposed method called Multivariate Linear (ML) Regression predicts the popularity of the video at time as a linear combination of the feature values and can be expressed as:
where are model parameters learned from training data and the term corresponds to the view deltas in the -th sampling interval.
The ML Regression model is able to capture more information about the evolution pattern thanks to different weights assigned to time intervals. However, the weights learned from the training data cannot capture the intrinsic variations of the evolution patterns within the training dataset videos. Therefore,  propose to extend their ML model by introducing a similarity notion between the videos based on their evolution patterns. The so-called MRBF regression uses Radial Basis Functions (RBF) to calculate the distance between the videos and predicts the number of views based on the views increments as well as distances to a set of pre-selected training videos :
where is a Gaussian RBF with parameter and a set of videos to be selected during cross-validation. The above problem can be solved with ordinary least squares, similarly to the previously discussed methods. However, the additional set of input features increases the risk of overfitting. Therefore,  propose to use Ridge regression  instead.
It is worth mentioning that the MRBF regression uses Gaussian Radial Basis Function as a proxy for a similarity measure between the evolution patterns of a given video and a set of representative videos from a training dataset. More precisely, the MRBF method postulates selecting a uniformly distributed random set of videos as representative samples. Then, the Gaussian RBF function is used to compute the distances between an input video and a set of samples. Finally, those distances are plugged into Eq. 3 and contribute to the RBF features’ term of the prediction formula. This way the final popularity prediction of the MRBF method takes into account both the temporal popularity evolution of a given video (the ML regression term) and its similarity to previously observed popularity patterns within the training dataset (the RBF features’ term).
MRBF Regression model encompasses linear and non-linear dependencies within the popularity evolution patterns using a combination of two methods: ML regression (linear) and RBF features (non-linear). This approach allows to compute the predicted value by combining the linear regression model based on the popularity evolution of a given video as well as its similarity to a set of representative videos from the dataset computed using a non-linear RBF kernel. We claim that it is not necessary to split the prediction into two distinct parts, which increases the complexity of the model and leads to additional computational costs.
To this end, we propose a new method, dubbed Popularity-SVR, that predicts future popularity of a video using Support Vector Regression (SVR) . Inspired by the results obtained with the MRBF method, we propose to use Gaussian Radial Basis Functions as a kernel of our transformation. The selection of the right kernel can significantly influence the performance of the model, as it was shown in other domains, e.g. speaker identification  or handwriting recognition . We therefore postulate using a RBF kernel as it allows us to map feature vectors into a non-linear space where the relations between popularity evolution patterns of the videos are easier to capture. As a result, the non-linear character of the RBF kernel transformations allows for a more robust prediction based on the patterns identified by the algorithm within the training dataset, and not relying explicitly on the linear relation between early and later popularity of a given video. Therefore, Popularity-SVR simplifies the MRBF model by finding the relevant evolution patterns from within the training dataset and predicting the popularity based on the RBF-based similarity to those patterns. This approach is much different from the MRBF method, where the representative videos are selected as a uniform random sample of examples from the training dataset and the prediction is made based on the early evolution pattern and similarity to the random videos from the training dataset. Our approach also differs from similar works on modifying SVM kernel functions [42, 40, 41], since we consider using the RBF kernel as a method to generalize a more complex model proposed in . Furthermore, to the best of our knowledge, our work is one of the first attempts to select an optimal SVM kernel in the context of online content popularity prediction.
According to the proposed Popularity-SVR method the popularity of a video can be predicted as:
where is a Gaussian RBF with parameter, is a feature vector for video available at time and is a set of support vectors returned by the SVR algorithm along with a set of coefficients and intercept . Unless stated otherwise, we use a vector of log-transformed view deltas as feature vectors, as proposed in , that is . We found optimal values for the hyperparameter of the Support Vector Machine optimization and of the RBF kernel with a grid search in a preliminary set of experiments and in the remainder of this paper the following values are used: .
|Random dataset||0.8719 0.0087||0.8844 0.0087||0.8968 0.0074||0.9071 0.0043|
|Top dataset||0.8797 0.018||0.8921 0.017||0.9046 0.0152||0.9353 0.009|
In this section we compare the state-of-the-art methods described in section IV, namely the UL, ML and MRBF against the proposed Popularity-SVR method. To that end, we employ 3 datasets containing almost 24,000 videos. For ML and MRBF methods we use implementations obtained from their authors. For UL and Popularity-SVR we use our own Python implementation based on the Scikit-learn package333http://scikit-learn.org/. To find the optimal parameters of the MRBF and Popularity-SVR methods, we used Python scikit’s sklearn.grid_search.GridSearchCV method, that finds the optimal parameters in terms of prediction accuracy using grid a search approach, while the UL and ML implementations do not have any parameters to optimize. We first evaluate all the methods using only the temporal evolution of the views (without visual or social features) on two publicly available datasets of YouTube videos: Top and Random . We then show how we can improve the prediction precision with additional visual and social features obtained using a new dataset of Facebook videos.
Top and Random datasets  contain data gathered for YouTube videos, such as time evolution of the number of views, comments, favorites and ratings. The Top dataset is a compilation of those results for a total of 27,212 videos taken from the top-100 most popular videos of each country in the world. The Random dataset contains the same type of data gathered for 24,484 unique randomly selected videos. Similarly to , we also preprocess both YouTube datasets and remove the videos with incomplete statistics and with less than 30 days of data. The final preprocessed datasets generated this way have 16,132 (Random) and 5,811 (Top) videos.
To evaluate the prediction methods in the context of social media, we also collected data for 1,820 videos uploaded to Facebook between August , 2015 until October , 2015. The videos were uploaded by several Facebook publishers, including the AJ+444www.facebook.com/ajplusenglish and BuzzFeedVideo555www.facebook.com/BuzzFeedVideo. We implemented a crawler that uses Facebook Graph API666https://developers.facebook.com/docs/graph-api to browse Facebook publishers’ pages and retrieve publicly available information regarding the number of interactions with a given video, that is the number of shares, likes and comments. Since the number of views of a video is not publicly available through the Graph API, we retrieve this data using simple URL scraper of a video page. We release this dataset to the public to enable further research on the topic of popularity prediction of social media content777http://ii.pw.edu.pl/~ttrzcins/facebook_dataset_2015.csv.
V-B Evaluation protocol
To evaluate the performance of prediction methods, we follow the approach of  and use 10-fold cross validation. For every dataset used, we randomly split all the samples into 10 equal-sized folds. We then use 9 folds for training and one for testing. We repeat the process 10 times, every time testing the methods on a distinct fold and training them with the remaining 9 folds. We report here the average results across all the 10 test sets along with the corresponding 95% confidence interval. As a metric to evaluate the prediction accuracy we use the Spearman rank correlation, as in .
V-C YouTube datasets
We first evaluate the popularity prediction methods on two sets of YouTube videos: Random and Top datasets. Figure 3 shows the results in terms of rank correlation for reference time days and target time . The performance of our proposed Popularity-SVR method is higher than the competitors for both datasets and across the reference time values. The improvement over the state-of-the-art methods is more significant for the Top dataset and for , which indicates that our proposed method works especially well for the popular videos just after they are published. The performance of all methods converges as gets closer to the target time . This is not a surprise, as the more time passes, the easier the prediction is. Out of the competitors, MRBF performs the best which confirms the results of . For the quantitative analysis, we also show the average results along with the 95% confidence interval for in Table I. Not only does the Popularity-SVR method perform best, but its 95% confidence interval is also up to 40% smaller than the other methods, which means that Popularity-SVR provides a more stable prediction accuracy across different videos.
V-D Facebook dataset
Secondly, we evaluate the performance using the Facebook dataset. In the first experiment we evaluated the Spearman rank correlation obtained when using various visual features proposed in Section III. The results are shown in Table II. Our results show that the popularity of a video can be predicted with the highest accuracy using deep learning features, which confirms the observations made in  for images. Other important metrics that can be useful for the prediction of video popularity include clutter present in the video, scene dynamics and thumbnail popularity rank . Interestingly, the negative correlation results obtained for text and rigidity features suggest that videos with too much text (e.g. subtitles) or those with too much rigidity are bound to be less popular, although the magnitude of the correlation is fairly small. Finally, combining all the visual features together provides the Spearman correlation result of over 0.23.
|Deep features||0.1361 0.0155|
|Scene dynamics||0.0822 0.0091|
|Video characteristics||0.0678 0.0168|
We then compared the performance of the proposed Popularity-SVR method and state of the art using visual features, social features, such as the number of comments, likes and shares, and view counts as the inputs. Figure 4 and Table III show the obtained results. The results show that the highest prediction accuracy can be obtained using the combination of view counts, social features and visual features as inputs. When using those input sets separately, the best performance is observed for the view counts followed closely by social features. Although the correlation is not as high for the visual features, one must remember that visual features can be computed before the publication, while the others cannot be obtained until the video is published and it is too late to modify its contents. Therefore, we claim that the proposed visual features can be useful for the publishers to adjust the content and maximise its probability to become popular.
Another conclusion we can draw from the results presented in Table III is that social signals are much stronger in predicting popularity of online videos in social media than the visual signal. This confirms the findings of  for images shared online. One can consider the results of our experiment as an the empirical evidence that adding social features as an input of the online video popularity prediction methods leads to much higher improvement in terms of accuracy than adding visual features.
The performance of all the methods can be improved by combining different feature subsets, although the improvement is modest as using only view counts provides a fairly high prediction accuracy. Moreover, the social features and view counts are highly correlated, as the more popular the content is, the more attention from other users it attracts. In fact, the Spearman correlation between the number of views and comments, shares and likes is equal to: 0.86, 0.88 and 0.93, respectively. This phenomenon, also known as multicollinearity, results in a relatively small information gain provided by those social features and explains the minor improvement over the views evolution data.
Finally, the results confirm that our proposed Popularity-SVR method performs better than the competitors for all input configurations and across all values. As the improvement of Popularity-SVR over MRBF for the input configuration with all features is approximately 1%, we perform an additional set of experiments to verify the statistical significance of the results. To that end, we compute the Student-T test results for prediction outputs of all baselines methods and Popularity-SVR method using view counts. Figure 5 shows the resulting p-values averaged across test folds. Although with the increasing time the results become more similar (with average p-value increasing), they remain statistically different with mean p-values below 0.02.
|visual||0.0957 0.0184||0.1634 0.0153||0.1496 0.0133||0.2344 0.0166|
|social||0.8658 0.0386||0.8736 0.0298||0.8728 0.0305||0.8974 0.0205|
|views||0.9061 0.0366||0.9130 0.0382||0.9173 0.0379||0.9301 0.0191|
|views + visual||0.9107 0.0315||0.9152 0.0301||0.9193 0.0197||0.9311 0.0125|
|temporal (views + social)||0.9126 0.0295||0.9187 0.0234||0.9197 0.0237||0.9356 0.0160|
|temporal (views + social) + visual||0.9148 0.032||0.925 0.032||0.9203 0.0366||0.9413 0.0127|
V-E Runtime evaluation
For a novel prediction method to be used in practice, it needs to have low runtime (both in terms of training and prediction), as well as high scalability. To verify that our proposed approach fulfils this requirement, we measured execution times of all the methods for subsets of different sizes from the YouTube Random dataset presented in Section V-A and compared the results. The measurements were averaged over 10 runs and performed on a MacBook Pro with 2.5GHz Intel Core i7 with 16GB RAM memory. Fig. 6 shows the results of this comparison. Training time of our proposed SVR-Popularity method is lower than the other methods, except for the Univariate Linear (UL) Regression, while the prediction time is lower than the competing MRBF method. We believe that it is the result of a simplified prediction model that uses only a set of support vectors along with the RBF kernel during prediction, while the MRBF method aditionally uses the ML regression term, as defined in Eq. 3. Furthermore, our model can be trained faster than the competing MRBF approach, since it takes advantage of the so-called kernel trick . Employing the kernel trick allows us to avoid an explicit transformation of feature vectors into multi-dimensional RBF space and therefore reduces memory and computational costs. Moreover, increasing training size leads to increased training time for all the methods, while the prediction time remains fairly stable, proving the scalability of the evaluated methods.
In this paper, we propose to use Support Vector Regression with Gaussian Radial Basis Functions to predict the popularity of online video content measured as the number of views. Our method was evaluated on three datasets containing a total of almost 24,000 videos and the results show its superiority with respect to the state of the art. Moreover, the results suggest that using only visual features computed before the publication of the video can be helpful to predict future video popularity. Nevertheless, if a higher prediction accuracy is required, temporal features, such as view counts or social features should be added. The best results obtained for the combination of visual features, social features and early view counts allow to predict the popularity of the video published on Facebook with a Spearman correlation rank of up to 0.94 only 6 hours after publication. In our future work we plan to extend the set of features used for prediction by adding more semantic cues, such as video topic or the sentiment of the social interactions, to better understand what impacts the popularity of the videos in social networks.
This work was partially funded by the grant of the Dean of the Faculty of Electronics and Information Technology at Warsaw University of Technology (project II/2015/GD/1).
-  YouTube, “Press statistics,” https://www.youtube.com/yt/press/statistics.html, 2015, [Online; accessed 19-ÂÂOctober-2015].
-  Facebook, “Company info,” http://newsroom.fb.com/company-info/, 2015, [Online; accessed 06-ÂÂOctober-2015].
-  Instagram, “Press,” https://instagram.com/press/, 2015, [Online; accessed 06-ÂÂOctober-2015].
-  Twitter, “Company info,” https://about.twitter.com/company, 2015, [Online; accessed 06-ÂÂOctober-2015].
-  Adage.com, “Facebook 85 users creating content,” http://adage.com/article/digital/facebook-85-users-creating-content/236358/, 2015, [Online; accessed 06-ÂÂOctober-2015].
-  Twitter, “What fuels a tweet engagement,” https://blog.twitter.com/2014/what-fuels-a-tweets-engagement/, 2015, [Online; accessed 16-ÂÂOctober-2015].
-  M. Cha, H. Kwak, P. Rodriguez, Y. Ahn, and S. Moon, “I tube, you tube, everybody tubes: analyzing the world’s largest user generated content video system,” in Proceedings of ACM SIGCOMM Conference on Internet Measurement, 2007.
-  TechCrunch, “2015 ad spend rises to $187b, digital inches closer to one third of it,” http://techcrunch.com/2015/01/20/2015-ad-spend-rises-to-187b-digital-inches-closer-to-one-third-of-it/, 2015, [Online; accessed 19-ÂÂOctober-2015].
-  N. Techblog, “Itâs all a/bout testing: The netflix experimentation platform,” http://techblog.netflix.com/2016/04/its-all-about-testing-netflix.html, 2016, [Online; accessed 10-ÂÂMarch-2016].
-  Intelligence, “Using dark posts to a/b test videos on facebook,” http://intelligence.r29.com/post/130204487611/using-dark-posts-to-ab-test-videos-on-facebook, 2016, [Online; accessed 10-ÂÂMarch-2017].
-  G. Szabo and B. A. Huberman, “Predicting the popularity of online content,” Communications of the ACM, vol. 53, no. 8, pp. 80–88, Aug. 2010.
-  Y. Borghol, S. Mitra, S. Ardon, N. Carlsson, D. L. Eager, and A. Mahanti, “Characterizing and modelling popularity of user-generated videos.” Performance Evaluation, vol. 68, no. 11, pp. 1037–1055, 2011.
-  R. Bandari, S. Asur, and B. A. Huberman, “The Pulse of News in Social Media: Forecasting Popularity,” CoRR, vol. abs/1202.0332, 2012. [Online]. Available: http://arxiv.org/abs/1202.0332
-  H. Pinto, J. M. Almeida, and M. A. Gonçalves, “Using early view patterns to predict the popularity of youtube videos,” in Proceedings of ACM International Conference on Web Search and Data Mining, 2013, pp. 365–374.
-  A. Khosla, A. D. Sarma, and R. Hamid, “What makes an image popular?” in Proceedings of International World Wide Web Conference (WWW), 2014.
-  J. Xu, M. van der Schaar, J. Liu, and H. Li, “Forecasting popularity of videos using social media,” CoRR, vol. abs/1403.5603, 2014.
-  M. Osborne and V. Lavrenko, “V.: Rt to win! predicting message propagation in twitter,” in Proceedings of International Conference on Web and Social Media (ICWSM), 2011.
-  L. Hong, O. Dan, and B. D. Davison, “Predicting popular messages in twitter,” in Proceedings of International Conference Companion on World Wide Web, 2011.
-  F. Gelli, T. Uricchio, M. Bertini, A. D. Bimbo, and S.-F. Chang, “Image popularity prediction in social media using sentiment and context features,” in Proceedings of the 23rd ACM International Conference on Multimedia, ser. MM ’15, 2015.
-  B. Wu, W.-H. Cheng, Y. Zhang, and T. Mei, “Time matters: Multi-scale temporalization of social media popularity,” in Proceedings of the 2016 ACM on Multimedia Conference, ser. MM ’16, 2016.
-  B. Wu, T. Mei, , and W.-H. C. Y. Zhang, “Unfolding temporal dynamics: Predicting social media popularity using multi-scale temporal decomposition,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, ser. AAAI’16, 2016.
-  V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira, “Characterizing Reference Locality in the WWW,” in Proceedings of Conference on Parallel and Distributed Information Systems, 1996.
-  M. Chesire, A. Wolman, G. M. Voelker, and H. M. Levy, “Measurement and analysis of a streaming-media workload,” in Proceedings of USENIX Symposium on Internet Technologies and Systems, 2001.
-  C. Castillo, M. El-Haddad, J. Pfeffer, and M. Stempeck, “Characterizing the life cycle of online news stories using social media reactions,” in Proceedings of ACM Conference on Computer Supported Cooperative Work And Social Computing, 2014.
-  M. Tsagkias, W. Weerkamp, and M. de Rijke, “News comments: Exploring, modeling, and online prediction.” in Proceedings of European Conference on Information Retrieval, 2010.
-  A. Tatar, M. D. de Amorim, S. Fdida, and P. Antoniadis, “A survey on predicting the popularity of web content,” Journal of Internet Services and Applications, vol. 5, 2014.
-  L. Jiang, Y. Miao, Y. Yang, Z. Lan, and A. G. Hauptmann, “Viral video style: A closer look at viral videos on youtube,” in Proceedings of ACM International Conference on Multimedia Retrieval, 2014.
-  R. Crane and D. Sornette, “Robust dynamic classes revealed by measuring the response function of a social system,” Proceedings of National Academy of Sciences, no. 41, pp. 15 649–15 653, 2008.
-  H. Drucker, C. J. C. Burges, L. Kaufman, A. J. Smola, and V. Vapnik, “Support vector regression machines,” in Proceedings of Neural Information Processing Systems, 1996, pp. 155–161.
-  S. D. Roy, T. Mei, W. Zeng, and S. Li, “Towards cross-domain learning for social video popularity prediction.” IEEE Transactions on Multimedia, vol. 15, no. 6, pp. 1255–1267, 2013.
-  J. Zhang, L. Nie, X. Wang, X. He, X. Huang, and T. S. Chua, “Shorter-is-better: Venue category estimation from micro-video,” in Proceedings of the 2016 ACM on Multimedia Conference, ser. MM ’16, 2016.
-  J. Chen, X. Song, L. Nie, X. Wang, H. Zhang, and T.-S. Chua, “Micro tells macro: Predicting the popularity of micro-videos via a transductive model,” in Proceedings of the 2016 ACM on Multimedia Conference, ser. MM ’16. ACM, 2016, pp. 898–907.
-  P. A. Viola and M. J. Jones, “Rapid object detection using a boosted cascade of simple features,” in CVPR, 2001, pp. 511–518.
-  A. Jacobs, A. Miene, G. T. Ioannidis, and O. Herzog, “Automatic shot boundary detection combining color, edge, and motion features of adjacent frames,” in TRECVID 2004 Workshop Notebook Papers, 2004, pp. 197–206.
-  J. Canny, “A computational approach to edge detection,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679–698, Jun. 1986.
-  E. Rosten, R. Porter, and T. Drummond, “Faster and better: A machine learning approach to corner detection,” IEEE Transations on Pattern Analysis and Machine Intelligence, vol. 32, no. 1, pp. 105–119, 2010.
-  M. Calonder, V. Lepetit, M. Özuysal, T. Trzcinski, C. Strecha, and P. Fua, “BRIEF: computing a local binary descriptor very fast,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 7, pp. 1281–1298, 2012.
-  K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” arXiv preprint arXiv:1512.03385, 2015.
-  T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, ser. Springer Series in Statistics. Springer New York Inc., 2001.
-  S. Z. Boujelbene, D. B. A. Mezghanni, and N. Ellouze, “Improving svm by modifying kernel functions for speaker identification task,” International Journal of Digital Content Technology and its Applications, vol. 4, no. 6, pp. 100–105, 2010.
-  Z. Zhang, R. Min, and A. Bonner, “Modifying kernels using label information improves svm classification performance,” in 2007 International Conference on Machine Learning and Applications, 2007.
-  S. Amari and S. Wu, “Improving support vector machine classifiers by modifying kernel functions,” Neural Networks, vol. 12, no. 6, pp. 783–789, 1999.
-  F. Figueiredo, J. M. Almeida, M. A. Gonçalves, and F. Benevenuto, “On the dynamics of social media popularity: A youtube case study,” ACM Transactions on Internet Technology, vol. 14, no. 4, pp. 24:1–24:23, Dec. 2014.
-  T. Hofmann, B. Schölkopf, and A. J. Smola, “Kernel methods in machine learning,” Annals of Statistics, vol. 36, no. 3, pp. 1171–1220, 2008.
Tomasz Trzciński is an Assistant Professor in the Division of Computer Graphics in the Institute of Computer Science at Warsaw University of Technology since 2015. His main research interests include computer vision, machine learning and social media. He obtained his Ph.D. in Computer Vision at École Polytechnique Fédérale de Lausanne in 2014. He received his M.Sc. degree in Research on Information and Communication Technologies from Universitat Politècnica de Catalunya and M.Sc. degree in Electronics Engineering from Politecnico di Torino in 2010. His professional appointments include work with Google, Qualcomm Corporate R&D and TelefÃ³nica R&D. In 2016, he was named a New Europe 100 Innovator as one of 100 outstanding challengers who are leading world-class innovation from Central and Eastern Europe. Since 2015, he holds a Chief Scientist position at Tooploox.
Przemysław Rokita, MSc (1985), PhD (1993), DSc (2000), Tenured Professor (2014); Currently Professor and Head of the Division of Computer Graphics at the Warsaw University of Technology; Member of SPIE, ACM, IEEE; Main scientific interests: computer science and information technology, digital image processing, computer graphics, image perception; Previously affiliated as visiting scientist and professor at: the Max-Planck-Institut fÃ¼r Informatik - Computer Graphics Department (Germany), The University of Aizu (Japan), Hiroshima Institute of Technology (Japan), Hiroshima Prefectural University (Japan), Imperial College of Science, Technology and Medicine (United Kingdom); Member of Program Committees and reviewer for international scientific conferences and journals, including: IEEE Computer Graphics and Applications, The Visual Computer, Real-Time Imaging, Opto-Electronics Review, Journal of Imaging Science and Technology, IEEE Transactions on Circuits and Systems for Video Technology, IEEE Transactions on Multimedia, ACM Siggraph, Eurographics, High Performance Graphics; Expert and consultant at the Polish National Centre for Research and Development, National Science Centre, Ministry of Science and Higher Education; Laureate of the Golden Chalk Awards and title of best lecturer at the Faculty of Electronics anand Information Technology of the Warsaw University of Technology (2005 and 2006).