<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Workshop,
Glasgow, Scotland</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Towards Boosting Video Popularity via Tag Selection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elizeu Santos-Neto</string-name>
          <email>elizeus@ece.ubc.ca</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jussara Almeida</string-name>
          <email>jussara@dcc.ufmg.br</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tatiana Pontes</string-name>
          <email>tpontes@dcc.ufmg.br</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matei Ripeanu</string-name>
          <email>matei@ece.ubc.ca</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Univ. Federal de Minas Gerais</institution>
          ,
          <addr-line>Belo Horizonte, MG</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of British Columbia</institution>
          ,
          <addr-line>Vancouver, BC</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <volume>0</volume>
      <fpage>1</fpage>
      <lpage>04</lpage>
      <abstract>
        <p>Video content abounds on the Web. Although viewers may reach items via referrals, a large portion of the audience comes from keywordbased search. Consequently, the textual features of multimedia content (e.g., title, description, tags) will directly impact the view count of a particular item, and ultimately the advertisement-generated revenue.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>This study makes progress on the problem
of automating tag selection for online videos
with the goal of increasing viewership. It
brings two major insights: rst, it describes
a methodology to construct a ground truth
to evaluate methods that aim to improve
social content popularity; second, it provides
evidence that the tags on existing YouTube
videos can be improved by an automated tag
recommendation process even for a sample
of well curated videos; nally, it suggests a
roadmap to explore low-cost techniques either
based on crowdsourcing or on tag
recommendation algorithms to improve the quality of
tags for online video content.</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <p>Given the sheer volume content owners generate (e.g.,
YouTube receives 100 hours of video every minute1), it
is common they o oad online publication and
monetization tasks to specialized content management
companies. Content managers publish, monitor, and
promote the owner's content, and revenues are generally
shared with the owner. As revenue is directly
related to the number of ad prints each piece of content
receives, this incentivizes managers to boost content
popularity.</p>
      <p>Although viewers may reach a content item
starting from many leads (e.g., an e-mail from a friend or
a promotion campaign in an online social network), a
large portion of viewers relies on keyword-based search
and/or tag-based navigation to nd videos. An
argument supporting this assertion is the fact that, as of
2/Dec/2013, 14% of the unique visitors on YouTube
come from Google.com searches 2. The integration of
Google and YouTube search will likely increase the
volume of search tra c that leads to views on YouTube.
Moreover, YouTube itself is the third most popular site
on the web.</p>
      <p>
        Consequently, the textual features of a video (e.g.,
title, description, tags, and comments) have a
major impact on the view count of each particular item
and, ultimately, on the advertisement-generated
revenues [
        <xref ref-type="bibr" rid="ref11 ref5">5, 11</xref>
        ]. Similarly, in other contexts, it has been
shown that even simple textual features produce
positive results: for example, title suggestions on eBay
have bene tted both sellers, who increased revenue,
and buyers, who found relevant products faster [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
1See: http://www.youtube.com/yt/press/statistics.html
2http://www.alexa.com/siteinfo/youtube.com#keywords
Experts can produce the textual features associated
with video content via manual inspection (and our
industry contacts con rm this is a still current
practice 3). This solution, however, is manpower intensive
and limits the scale at which content managers can
operate. Therefore, mechanisms to support this process
(e.g., automating tag suggestion) are desirable.
      </p>
      <p>This study starts from the observation that, with
the ever-increasing volume of user-generated textual
content available on the Web, there is a plethora of
sources from which an automated mechanism that
suggests textual features, in general, and tags, in
particular, could extract candidate terms that can
improve multimedia content popularity. For example,
Wikipedia (a peer-produced encyclopedia), MovieLens
and Rotten Tomatoes (social networks where movie
enthusiasts collaboratively catalog, rate, and
annotate movies), New York Times movie review section
(which includes over 28,000 movies) or even YouTube
comments are potential sources of candidate keywords
to annotate multimedia content such as videos. It
is important to note that techniques to suggest
textual features to improve multimedia content
popularity are not restricted to movies. In fact, other types
of content such as superbowl ads could bene t from
a combination of information sources such as humans
from a crowdsourcing service (e.g., Amazon
Mechanical Turk).</p>
      <p>To make progress on understanding whether textual
information, tags in particular, associated with video
content can be improved through an automated
process, and on understanding what information sources
provide the most valuable textual features (i.e., terms
that can potentially improve videos popularity), this
work focuses on the following research questions:
Q1 What are the challenges in building a ground truth
to evaluate popularity boosting of videos on
social media via textual features optimization such
as tagging with terms that can potentially improve
the discoverability of the video via search? How
can one leverage crowdsourcing channels such as
Amazon Mechanical Turk for such purpose?
Q2 To what extent the tags currently associated with
existing video content on social video-sharing
websites, such as YouTube, are optimized to attract
search tra c? Is there room for improvement
possibly using automated tag recommendation
solutions?</p>
      <p>
        It is worth highlighting that, to tackle these
questions, this work uses tag recommender algorithms in a
3This work is motivated by our collaboration with a company
specialized in promoting video content. An NDA prevents the
disclosure of details.
di erent context than most previous studies: our goal
is not to design novel and more e cient tag
recommendation algorithms, but to study whether textual
features of social content can be further optimize to
improve the value of alternative data sources in
providing tags to boost video popularity. In this sense,
the mainstream recommender algorithms we use here
provide a lower bound on the achievable quality. More
complex algorithms, e.g., as proposed in [
        <xref ref-type="bibr" rid="ref1 ref3 ref6 ref8">1, 3, 6, 8</xref>
        ], can
be tested and tuned using the methodology we propose
here to further improve tag quality.
      </p>
      <p>In particular, this study concentrates on the
challenges related to constructing a ground truth to
enable the evaluation information sources. Therefore,
we adopt the following two-part methodology:
Construct a ground truth by recruiting turkers
from Amazon Mechanical Turk, asking them to
watch YouTube videos, and to provide the
keywords they would use to search for each of them,
as opposed to simply describe the video (see
Section 3);
Prototype an automated tag recommendation
pipeline, incorporate various recommender
algorithms, and couple it with di erent input data
sources (see Sections 2 and 4.1);
Evaluate the tag quality of existing YouTube
videos by comparing them with the ground truth
(see Section 5);
In summary, the contributions of this work are:
The production of a ground truth released to the
community.</p>
      <p>Evidence that the tags associated with a sample
of trailers of popular movies currently available
on YouTube can be further optimized by an
automated low-cost process. This process can
either incorporate human computing engines (e.g.,
recruited through Amazon Mechanical Turk) at
a much lower cost than using dedicated channel
managers (the current industry practice), or, at
an even lower cost, can use tag recommender
algorithms to harness textual information from a
multitude of data sources that are related to the
video content.
2</p>
    </sec>
    <sec id="sec-3">
      <title>Context of Our Assessment</title>
      <p>
        This section describes the context for our
investigation. Our main assumption is that annotating a video
with the tags that match the terms users would use
to search for it increases the chance that users view
the video. This view is supported by previous
studies [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and by the observation that a large portion
of the tra c landing on a video comes from textual
searches. As a result, textual sources that are related
to the video and whose content can be automatically
retrieved (e.g., movie reviews, comments, wiki pages,
news items, blogs) can be used as inputs for
recommenders to suggest tags for these video content items.
      </p>
      <p>
        A recommendation pipeline that implements this
idea is schematically presented in Figure 1: data
sources feed the pipeline with textual input data.
Next, the textual data is pre-processed by lters to
both clean and augment it (e.g., remove stopwords,
detect named entities). This rst processing step
provides candidate keywords for the recommenders.
The recommendation step uses the candidate keywords
(and their related statistics, such as frequency and
cooccurrence) to produce a ranked list according to a
scoring function implemented by a given recommender
algorithm. Finally, as the space available for tags
provided by video sharing websites, such as YouTube or
Vimeo, is limited, the selection of most valuable
candidate keywords is constrained by a budget, often
dened by the number of words or characters.
Therefore, the nal step consists of solving an instance of
the 0-1-knapsack problem [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] that selects a set of
recommended tags from the ranked-list produced by the
recommender.
      </p>
      <p>In summary, the recommendation pipeline is
composed of four main elements: data sources, lters,
recommenders, and knapsack solver. The next
paragraphs discuss each of these elements.</p>
      <p>Data sources. This component provides the input
textual data used by the tag recommenders. In
particular, we are interested in peer-produced data sources
such as Wikipedia and social tagging systems like
MovieLens, as well as expert-produced data sources
such as NYTimes movie reviews. We discuss in detail
each of the data sources used in Section 4.1.</p>
      <p>Filters. The raw textual data extracted from a data
source is ltered to both clean and augment the input
data, minimizing noise. We consider simple lters:
stopword and punctuation removal, lowercasing, and
named entity detection4.</p>
      <p>Recommenders. A recommender scores the
candidate keywords based on their relevant statistics (e.g.,
4We use OpenCalais.com for entity detection.
single word frequency, word co-occurrence frequency).
Note that there are many ways of de ning scoring
functions; and, it is not our goal to advocate a speci c one,
as we focus on the value provided by various
information sources. We discuss the recommenders used in
this work in Section 4.2.</p>
      <p>Knapsack Solver. Finally, after ranking candidate
keywords, the nal step is selecting the ones that best
t the budget. In this paper, the budget is expressed
in terms of the number of characters, as done in video
sharing systems such as YouTube, where one can use a
limited number of characters (500) for tags. This step
is formulated as a 0-1-knapsack problem.</p>
      <p>
        Let v be a video and C =&lt; ki &gt;, i = 1; :::; n,
be a list of candidate keywords provided by a data
source when used as input to a tag recommendation
algorithm. Additionally, let us denote the length of a
keyword ki as wi in bytes. Therefore, the problem of
selecting the best tags to improve viewership of v is
equivalent to solving the following optimization [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]:
maximize
subject to
n
X f (ki; v)xi
i=1
n
X wixi B
i=1
where B is the budget in terms of number of characters
allowed in the tags eld, xi 2 f0; 1g is an indicator
variable, and f (ki; v) is a scoring function provided by
the recommender for the keyword ki with respect to
video v.
      </p>
      <p>
        Considering that the cost5 (i.e., the keyword length)
and the scores are both nonnegative, we use a
wellknown dynamic programming algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] to solve
this optimization problem.
      </p>
      <p>Our goal is primarily to understand whether
videos currently published on a popular social video
sharing website have their tags optimized to attract
search tra c. If tags can still be further optimized,
one could evaluate how the choice of the data source
used as input for a recommendation pipeline impacts
the quality of the recommended tag-set. Next, we
discuss how to build a ground truth that enables
testing whether the tags assigned to a sample of videos
available on a popular video sharing website are
optimized. Additionally, such ground truth, in a future
work, could enable the evaluation of potential data
sources that provide candidate tags.
3</p>
    </sec>
    <sec id="sec-4">
      <title>Building the Ground Truth</title>
      <p>Our main assumption is that annotating a video with
the tags that match the terms users would use to
5Our study can be easily extended to consider the budget as
the number of tags (as in Vimeo).
search for it increases the chance that users watch the
video. As a result, textual sources that are related
to the video and whose content can be automatically
retrieved (e.g., movie reviews, comments, wiki-pages,
news items, blogs) can be used as inputs for
recommenders to suggest tags for these video content items.</p>
      <p>The ideal method to collect the ground truth would
consist of experiments that vary the set of tags
associated to videos, and capture their impact on the
number of views attracted. However, collecting this
requires the publishing rights for the videos and implies
executing experiments over a considerable duration.</p>
      <p>We decided for an alternative solution: we built a
ground truth by setting up a survey using the
Amazon Mechanical Turk (AMT)6. The survey asks
participants to watch a video and answer the question:
What query terms would you use to search for this
video? The rationale is that these terms would, if used
as tags to annotate the video, maximize its retrieval by
the YouTube search engine, and indirectly maximize
viewership.</p>
      <p>Content Selection. Our study focuses on movie
trailers7. The reason is that they are often short
(about 5 minutes or less), and this makes the
evaluation process more dynamic, encouraging turkers (i.e.,
the AMT workers who accept to participate in the
survey) to watch more trailers and associate more
keywords to them. The dataset consists of 382 videos
selected to meet the following constraints: they must
be publicly available on YouTube and have available
content in the data sources used to extract candidate
keywords (e.g., a page on Wikipedia, a NYTimes
review page).</p>
      <p>Survey. First, we conducted a pilot survey by
recruiting participants via our internal mailing lists and
online social networks. Their task was to watch the
trailers and provide terms they would use to search
for those videos. This pilot highlighted two major
issues: (i) relying only on volunteerism to mobilize
participants was insu cient; and, (ii) quality control of
answers (e.g., typos in the keywords) is much more
di cult - all videos in the survey are in English and
there was no automatic way to recruit only
participants that are uent in English.</p>
      <p>
        Thus, we published an AMT task8 requiring the
turkers to watch trailers, and provide the query terms
(3 to 10 keywords to each video, as queries are
typically of that length [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) they would use to search for
the videos they had watched. Following AMT pay
guidelines, each participant was paid $0.30 per task
assignment, which had an average completion time of
6http://www.mturk.com
7As long as there are data sources to extract candidate tags
from, other content types can bene t from our methodology.
8Links to data and code can be provided upon request.
6 minutes (total cost to conduct the survey: $345).
This leads to $3 per hour, which is much cheaper than
the wage paid to dedicated channel managers.
      </p>
      <p>We also performed simple quality control by
inspecting each answer to avoid accepting spam (which is
expected to be rare, due to the reputation mechanism
adopted by AMT). In fact, only one submission was
rejected as unrelated URLs were assigned as answers
instead of keywords.</p>
      <p>A brief characterization of the ground truth. In
total, 33 turkers submitted solutions. Figure 2 shows the
number of videos evaluated per turker: as we can
observe, 19 turkers (58%) evaluated more than 5 videos,
with the maximum reaching 333 videos. Figure 3
shows a histogram presenting the number of di erent
keywords each video received. Even though we asked
the turkers to associate at least 3 keywords to each
video, 82% of the evaluations provided more than the
required minimum, which resulted in 96% of the videos
with 10 or more di erent keywords.</p>
      <p>Figure 4 presents the total number of characters in
the set of unique keywords associated to each video.
The length of the ground truth varies from 51 (min)
to 264 (max) characters; in fact, 32% of the videos
have tags summing up to 100 characters. These values
guided the budget parameter in our experiments, as
we explain in Section 4.3.</p>
      <p>To gain an understanding on what types of
keywords would drive search tra c to these videos, we
look at the set of most popular terms (overall) in
the ground truth. Among the top 10% most
frequent search terms provided by turkers, 68% of them
are named entities (e.g., actor, director, and producer
names). Another category of terms with strong
presence is genre-describing terms. This suggests that a
strategy that aim to boost popularity of videos by
optimizing the tags associated with the content should
use sources that provide named entities related to the
video.</p>
      <p>It is important to note that we found some
evidence that this happens to videos other than movie
trailer. In a smaller sample of Super Bowl ads videos,
we observed that terms users provide as keywords they
would use to search for the ads are also dominated by
named entities like the brand names.
4</p>
    </sec>
    <sec id="sec-5">
      <title>Experimental Setup</title>
      <p>This section presents the instances of data sources
and tag recommenders, as well as the success metrics
used in our evaluation on whether the existing tags on
YouTube videos are optimized.
4.1</p>
      <sec id="sec-5-1">
        <title>Data Sources</title>
        <p>To understand whether the tags assigned to existing
online video content are optimized to attract search
tra c, it is necessary to compare the current tags to a
set of tags recommended by using other data sources
as input.</p>
        <p>Therefore, we use a combination of data sources as
inputs to recommender algorithms to produce a
comparison basis for the existing tags on the videos in our
sample. Next, we describe each of these data sources:</p>
        <p>MovieLens9 is a web system where users
collaboratively build and maintain a catalog of movies and
their ratings. Users can create and update movie
entries, annotate movies with tags, review and rate them.
Based on previous user activities, MovieLens suggests
9http://www.movielens.org
movies a user may like to watch. For our evaluation,
we use some of the data available in MovieLens: only
the tags users produce while collaboratively
annotating and bookmarking movies. This data is a publicly
available trace of tag assignments10.</p>
        <p>Wikipedia is a peer-produced encyclopedia where
users collaboratively write articles about a multitude
of topics. Users in Wikipedia also edit and maintain
pages for speci c movies11. We leverage these pages
as the sources of candidate keywords for
recommending tags for their respective movie trailers from our
sample.</p>
        <p>NYTimes reviews are written by movie critics
considered experts on the subject. Similar to the data
provided by Wikipedia, we leverage the review page of
a movie as the source of candidate keywords for the
tag recommendation task. The reviews are collected
via the query interfaces12 provided by the NYTimes
API.</p>
        <p>Rotten Tomatoes is a portal where users can rate
and review movies. Moreover, users have access to
critics' reviews and all credits information: actors and
roles, directors, soundtrack, synopsis, etc. The portal
links to critics' reviews as well. The information about
the credits of a movie and the critics' reviews can be
considered as produced by experts (likely the lm
credits are obtained from the movie producers, while the
critics' reviews are similar to those from NYTimes).
While users can review the movies as well (and this
quali es as peer-produced information), these reviews
are available on the website, but not accessible via the
API at the time of our investigation. The rest of the
information about the movies together with links to
the experts' reviews is available via the Rotten
Tomatoes API13.</p>
        <p>YouTube is a video-sharing website, here used to
test whether the tags already assigned to videos can
be further optimized. To this end, we collect the tags
assigned to the YouTube videos in our sample from the
HTML source of each video's page (API requests in
this sense are only accessible by the video publisher).
The reason for using page scraping rather than API
requests is that videos' tags are accessible via the API
only to the video publisher, even though these tags are
still used by the search engine to match queries and are
available in the HTML of the video page. YouTube
data source gures in the expert-produced end of the
spectrum since only the publisher can assign tags to
the video (it is reasonable to assume that a publisher
is an expert on the own video and aims to optimize its
textual features to attract more views).</p>
        <p>
          10http://www.grouplens.org/taxonomy/term/14
11http://en.wikipedia.org/wiki/Pulp Fiction (Film)
12http://developers.nytimes.com
13http://developer.rottentomatoes.com/
The experiments use two tag recommendation
algorithms that process the input provided by the data
sources: Frequency and RandomWalk. We
selected them primarily because they harness some
fundamental aspects of the tag recommendation problem
that more sophisticated methods (e.g., [
          <xref ref-type="bibr" rid="ref1 ref6 ref9">1, 6, 9</xref>
          ]) also
use: tag frequency, and tag co-occurrence patterns.
Moreover, our goal is to understand the relative
inuence of the data sources on the quality of the
recommended tags. We note that the methodology we
describe and the ground truth can be used to evaluate
other, more sophisticated, recommender algorithms as
well.
        </p>
        <p>The Frequency recommender scores the
candidate keywords based on how often each keyword
appears in the data source. Given the movie title, our
pipeline nds the documents in the data source that
match the title and extract a list of candidate
keywords. For example, in Wikipedia, the candidate
keywords for recommendation to a given movie are
extracted from the Wikipedia page about the movie, and
its frequency are the number of times each one appears
in that page. Similarly, in MovieLens, the frequency
is the number of times a tag is assigned to a movie.</p>
        <p>The RandomWalk recommender harnesses both
the frequency and the co-occurrence between
keywords. The co-occurrence is detected di erently
depending on the data source. In MovieLens, two
keywords co-occur if they are assigned to the movie by
the same user, while in NYTimes, Rotten Tomatoes,
and Wikipedia two keywords co-occur if they appear
in the same page related to the movie (i.e., review,
movie record, and movie page, respectively). The
RandomWalk recommender builds a graph based on
keyword co-occurrence, where each keyword is a node.
4.3</p>
      </sec>
      <sec id="sec-5-2">
        <title>Budget Adjustment</title>
        <p>To make the comparison fair, for each movie trailer, we
adjust the budget to the size of the tag set of that video
in the ground truth. The knapsack solver uses this
budget to select the recommended tags for a particular
video. The reason for setting a budget per video is
that a number of recommended tags greater than the
ground truth size penalizes some evaluation metrics,
such as the F3-measure (see de nition below).
4.4</p>
      </sec>
      <sec id="sec-5-3">
        <title>Success Metrics</title>
        <p>The nal step in the experiment is to estimate, for each
video and for various input data sources and
recommender algorithms, the quality of the recommended
tag-set against the ground truth. To this end, we use
F3-measure. Let Tv and Sv be the set of distinct
keywords in the ground truth and in the recommended
tag set, respectively, for video v. The metric is de ned
as follows:</p>
        <p>F3-metric. F3(v) = 910PP(v()v+)RR((vv)) , where P (v) =
jTv\Svj and R(v) = Tv\Sv are the precision and recall</p>
        <p>Sv Tv
of tag recommendation for video v, respectively.
5</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Experimental Results</title>
      <p>This section presents our experimental results to
address the following research questions:</p>
      <p>To what extent the tags currently associated with
existing YouTube content are optimized to attract search
tra c? Is there room for improvement using
automated tag recommendation solutions?</p>
      <p>To address these questions, we perform an
experiment to assess the quality of tags already assigned to
existing YouTube videos and whether there is room
for improvement. By improvement we mean
extending/modifying the tags to better match the ground
truth. To this end, we compare the tags to the ground
truth for each video and observe a wide gap. The
dotted (blue) line on the left in Figure 5 presents
the Complementary Cumulative Distribution Function
(CCDF) for the F3-measure. A point in the curve
indicates the percentage of videos (on y-axis) for which
the F3-measure is larger than the corresponding value
on x-axis, thus, the closer the line is to the top-right
corner, the better.</p>
      <p>To explore whether the gap than can be covered, at
least partially, by automated tag recommendations, we
explore the performance of the tag recommendations
using as inputs all data sources combined (MovieLens,
Rotten Tomatoes, Wikipedia, and NY Times). The
results are presented in Figure 5 as the solid (red) line.</p>
      <p>The Kolmogorov-Smirnov test of signi cance
indicates that the performance of using All data sources is
signi cantly higher than that achieved by the YouTube
tags (Frequency: D = 0:44, p-value = 3:9 1016;
RandomWalk: D = 0:43, p-value = 5:5 10 15)
implying that the tags recommended by both
methods are better than those currently assigned to the
videos on YouTube. Therefore, the tags currently
assigned to the YouTube videos can still be improved by
automated methods to attract more search tra c, and,
hence, boost video popularity.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Related</title>
    </sec>
    <sec id="sec-8">
      <title>Work</title>
      <p>The quest to improve visibility of one's content (e.g.,
a website, a video) is not new { the whole Search
Engine Optimization segment has seen uninterrupted
attention. Multiple avenues are available, ranging from
some that are viewed as abusive (e.g., link-farms) to
perfectly legitimate ones (e.g., better content
organization, good summaries in the titlebar of web pages).
Our exploration falls into this latter category.</p>
      <p>
        The related literature falls into two broad
categories: automated content annotation and tag value
assessment. The majority of related work on
automated content annotation (or tag recommendation)
focuses on suggesting tags to annotate content items
such that they maximize the relevance of the tag given
the content [
        <xref ref-type="bibr" rid="ref1 ref5 ref7 ref9">1, 5, 7, 9</xref>
        ], with a few exceptions where
authors propose to leverage other aspects such as
diversity [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>Although nding relevant tags to a given content
item is an important component of improving the tags
assigned to this item, previous studies fail to account
for the potential improvement on the view count of
the annotated content { an aspect which is valuable
to content managers and publishers, as they monetize
based on the audience that is able to nd their content.</p>
      <p>
        The study presented by Zhou et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is, to
the best of our knowledge, the closest to our work.
However, contrary to our study that focus on testing
whether tags can be further optimized to attract
trafc, Zhou et al. propose to boost video popularity by
suggesting ways to connect a video to other in
uential videos (e.g., making title and description similar
to those of in uential videos) as a way to leverage the
related video recommendations.
      </p>
      <p>Our study is di erent from these previous e orts, as
it focuses on testing the hypothesis that textual
features of social content, such as online videos, can be
further optimized to potentially attract search
trafc. This motivates our future work on evaluating the
impact of data source choice to produce
recommendations.
7</p>
    </sec>
    <sec id="sec-9">
      <title>Summary and Future Work</title>
      <p>A large portion of tra c received by video content on
the web originates from keyword-based search and/or
tag-based navigation. Consequently, the textual
features of this content will directly impact the popularity
of a particular content item, and ultimately the
advertisement generated revenue. Therefore, understanding
the performance of automatic tag recommenders is
important to optimize the view count of content items.</p>
      <p>First, we discuss the challenges on building a ground
truth to evaluate data sources and techniques that aim
to boost the popularity of multimedia content on the
web. Next, this study provides evidence that tags
currently assigned to a sample of YouTube videos can be
further improved to attract more search tra c. To
this end, we show an experiment that compares how
close the tags currently assigned to the videos in the
sample and tags harnessed from a combination of data
sources are to the ground truth. The results show that
using simple recommenders and a combination of data
sources can improve the tags.</p>
      <p>These preliminary results suggest a few directions
of future research. Initially, one may perform
comparisons between data sources individually and/or
grouped by type (peer- and expert-produced,
structured vs. unstructured) with the goal of
understanding their relative value as inputs for tag recommenders.
For example, are combinations of peer-produced data
sources relatively more valuable than expert-based
ones in the context of boosting multimedia content
popularity?</p>
      <p>Additionally, more experiments could provide
deeper explanations on the performance of
peerproduced data sources. For instance, does the value of
tags extracted from peer-produced sources (for
boosting content popularity), such as Wikipedia or
MovieLens, increase with the number of contributors? All
these questions are part of our future e orts.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Belem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Martins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Almeida</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Goncalves</surname>
          </string-name>
          .
          <article-title>Exploiting Novelty and Diversity in Tag Recommendation</article-title>
          . In P. Serdyukov,
          <string-name>
            <given-names>P.</given-names>
            <surname>Braslavski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          , S. Ruger, E. Agichtein,
          <string-name>
            <surname>I. Segalovich</surname>
          </string-name>
          , and E. Yilmaz, editors,
          <source>Advances in Information Retrieval SE - 32</source>
          , volume
          <volume>7814</volume>
          of Lecture Notes in Computer Science, pages
          <volume>380</volume>
          {
          <fpage>391</fpage>
          . Springer Berlin Heidelberg,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. H.</given-names>
            <surname>Cormen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. E.</given-names>
            <surname>Leiserson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Stein</surname>
          </string-name>
          . Introduction to Algorithms. The MIT Press,
          <article-title>third edit edition</article-title>
          ,
          <year>July 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Mei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Personalized tag recommendation using graphbased ranking on multi-type interrelated objects</article-title>
          .
          <source>SIGIR '09</source>
          , pages
          <fpage>540</fpage>
          {
          <fpage>547</fpage>
          , Boston, MA, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Ounis.</surname>
          </string-name>
          <article-title>Query performance prediction</article-title>
          .
          <source>Information Systems</source>
          ,
          <volume>31</volume>
          (
          <issue>7</issue>
          ):
          <volume>585</volume>
          {
          <fpage>594</fpage>
          ,
          <string-name>
            <surname>Nov</surname>
          </string-name>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Bolivar</surname>
          </string-name>
          .
          <article-title>The e ect of title term suggestion on e-commerce sites</article-title>
          .
          <source>WIDM '08</source>
          , pages
          <fpage>31</fpage>
          {
          <fpage>38</fpage>
          ,
          <string-name>
            <surname>Napa</surname>
            <given-names>Valley</given-names>
          </string-name>
          , California, USA,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Krestel</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Fankhauser</surname>
          </string-name>
          .
          <article-title>Language Models and Topic Models for Personalizing Tag Recommendation</article-title>
          .
          <source>In 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology</source>
          , pages
          <volume>82</volume>
          {
          <fpage>89</fpage>
          , Toronto, AB, Canada, Aug.
          <year>2010</year>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. S.</given-names>
            <surname>Hua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <surname>H. J. Zhang.</surname>
          </string-name>
          <article-title>Tag ranking</article-title>
          .
          <source>WWW '09</source>
          , pages
          <fpage>351</fpage>
          {
          <fpage>360</fpage>
          , Madrid, Spain,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Schmidt-Thieme</surname>
          </string-name>
          .
          <article-title>Pairwise interaction tensor factorization for personalized tag recommendation</article-title>
          .
          <source>In Proceedings of the third ACM international conference on Web search and data mining - WSDM '10</source>
          ,
          <string-name>
            <surname>page</surname>
            <given-names>81</given-names>
          </string-name>
          , New York, New York, USA,
          <year>2010</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Jing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <surname>H. J. Zhang.</surname>
          </string-name>
          <article-title>Image annotation re nement using random walk with restarts</article-title>
          .
          <source>MULTIMEDIA '06</source>
          , pages
          <fpage>647</fpage>
          {
          <fpage>650</fpage>
          ,
          <string-name>
            <surname>Santa</surname>
            <given-names>Barbara</given-names>
          </string-name>
          , CA, USA,
          <year>2006</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zha</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Giles</surname>
          </string-name>
          .
          <article-title>Exploring social annotations for information retrieval</article-title>
          .
          <source>In 17th International World Wide Web Conference</source>
          , pages
          <volume>715</volume>
          {
          <fpage>724</fpage>
          , Beijing, China,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khemmarat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Boosting video popularity through recommendation systems</article-title>
          .
          <source>In Databases and Social Networks on - DBSocial '11</source>
          , pages
          <fpage>13</fpage>
          {
          <fpage>18</fpage>
          , New York, New York, USA,
          <year>June 2011</year>
          . ACM Press.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>