<!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 />
    <article-meta>
      <title-group>
        <article-title>DCU Linking Runs at MediaEval 2013: Search and Hyperlinking Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shu Chen</string-name>
          <email>shu.chen4@mail.dcu.ie</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gareth J. F. Jones</string-name>
          <email>gjones@computing.dcu.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Noel E. O'Connor</string-name>
          <email>Noel.OConnor@dcu.ie</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CNGL, School of Computing, Dublin City University</institution>
          ,
          <addr-line>Dublin 9</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>INSIGHT Centre for Data, Analytics / CNGL, Dublin City University</institution>
          ,
          <addr-line>Dublin 9</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>INSIGHT Centre for Data, Analytics, Dublin City University</institution>
          ,
          <addr-line>Dublin 9</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>18</fpage>
      <lpage>19</lpage>
      <abstract>
        <p>We describe Dublin City University (DCU)'s participation in the Hyperlinking sub-task of the Search and Hyperlinking of Television Content task at MediaEval 2013. Two methods of video hyperlinking construction are reported: i) using spoken data annotation results to achieve the ranked hyperlink list, ii) linking and merging meaningful named entities in video segments to create hyperlinks. The details of algorithm design and evaluation are presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>This paper presents Dublin City University (DCU)'s
participation in the Hyperlinking sub-task of Search and
Hyperlinking of Television Content task at MediaEval 2013. The
paper is organized as follows: Section 2 describes our
automatic hyperlinking strategies, Section 3 gives experimental
results, and Section 4 concludes the paper.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>HYPERLINKING STRATEGIES</title>
    </sec>
    <sec id="sec-3">
      <title>Hyperlimking Principles</title>
      <p>
        In this subsection we describe the principles underlying
our approach to the hyperlinking task. The elements
involved in the hyperlinking framework correspond to the query
anchor, the target segment, and the hyperlink. The query
anchors, as the input to the hyperlinking framework, are
de ned in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A target segment is a subset of a video to
which a query anchor is supposed to be linked. For our
approach, a xed window whose duration is 120 seconds and
the overlap is 30 seconds is used to determine the target
segments. The spoken data in the video is available in three
transcripts: automatic speech recognition (ASR)
transcripts from LIUM Research [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], LIMSI/Vocapia [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and manual
subtitles provided by the BBC [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Hyperlinks are
constructed from the query anchor to a set of target segments using
di erent hyperlinking strategies as described in the following
subsections.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Hyperlinking using Text Annotation</title>
      <p>
        This strategy determines the hyperlinks based on two
quality measures: the video-level and the segment-level. The
video-level measure aims to determine the relevance between
the video containing the query anchor and other videos
containing potential target segments based on the text
transcripts. DBpedia Spotlight1, implementing text annotation
by supervised learning through DBpedia Ontology2, was
used to extract a set of terms to represent the textual
content of each video. The method used to annotate terms in
DBpedia Spotlight is based on a TF*ICF model [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], where
TF (Term Frequency) represents the relevance of a term in
the spoken video, and ICF (Inverse Candidate Frequency) is
determined by the relevance of a term in DBpedia Ontology
resources [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Given the video represented by a set of terms,
the similarity score is calculated using a TF-IDF algorithm.
      </p>
      <p>
        The segment-level similarity uses Apache Lucene 3.6.23
to determine the relevance between the query anchor and
the potential target segments. The Lucene standard
analyzer was used with the default stop word list4 to index
ASR transcripts and manual subtitles. The search input
query contained all the spoken data contained in the query
anchor. The score calculation mechanism uses a
combination of a Boolean AND function lter and ranking using the
Vector Space Model [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The nal score used to rank the
hyperlinks was calculated by merging the two results as shown
in Equation 1 and Equation 2.
      </p>
      <p>Score = w1Sv + w2Sl</p>
      <p>Score = SvSl
(1)
(2)
where Sv is the video-level similarity score, while Sl is the
segment-level similarity score. We use a simple linear fusion
mechanism to merge the two scores, where the weights w1
and w2 are set to 0.5 respectively.
2.3</p>
    </sec>
    <sec id="sec-5">
      <title>Hyperlinking using Named Entities</title>
      <p>This strategy links named entities contained in query
anchors and the potential target segments, and then merges
these entities to construct hyperlinks. Apache OpenNLP5
1https://github.com/dbpedia-spotlight
2http://dbpedia.org/Ontology
3http://lucene.apache.org/
4https://lucene.apache.org/core/3 6 2/api/core/
org/apache/lucene/analysis/StopAnalyzer.html
5http://opennlp.apache.org/</p>
      <p>1
0.2944
0.7000
0.6567
0.5450</p>
      <p>
        2
0.2935
0.7067
0.6633
0.5383
was used to tag words in the ASR transcripts and
subtitles. All noun words tagged as NN, NP, and NNP were
selected as named entities. To describe and link the named
entities, a vector space model was constructed by
predicting the surrounding words given the current word. We use
word2vec6 to implement a supervised learning mechanism
using a Neural Net Language Model to create the vector
model of named entities. We use the ASR transcripts of
videos gathered from the blip10000 collection [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] as
training data. The word2vec receives each named entity as input
and outputs a vector V = fw1; w2; :::wkg where wi is a
surrounding word of the current entity learned by training data
and the vector dimensionality k is set to 50, based on the
experiment described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Equation 3 is used to calculate
the score between di erent word vectors.
      </p>
      <p>S =
2(Vi T Vj )
jVij + jVj j
where Vi T Vj are the total number of words contained in
both Vi and Vj . jVij is the length of the word vector i. All
named entities located at the potential target segments are
merged using Equation 4 to generate the nal score to obtain
the ranked hyperlink list.</p>
      <p>Score =</p>
      <p>P0&lt;i&lt;k Si</p>
      <p>N
where Si is the score of an entity in a potential target
segment, and N is the total number of named entities in the
current segment.</p>
    </sec>
    <sec id="sec-6">
      <title>EXPERIMENTAL RESULTS</title>
      <p>A total of four formal runs were submitted to the Search
and Hyperlinking task in MediaEval 2013, described in
Table 2. Table 3 shows the Mean Average Precision (MAP)
(4)
value of each run. This indicates that our hyperlinking
strategy based on spoken data annotation performs better.
Table 1 shows P@N and MAP value of Run 3. MAP and
P@N benchmark have received a good result in most
runs except Topic (Anchor) 27, which describes Shakespeare
and Global Theatre. A total of two other videos are related
to Shakespeare and Global Theatre, while the content is
presented in terms of a cartoon. The lack of visual elements
leads to hyperlinks to cartoon segments, while real users will
notice the unrelatedness between TV shows and cartoons.
4.</p>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSIONS</title>
      <p>This paper presented details of DCU's participation in
the TV Data Hyperlinking task of MediaEval 2013. The
evaluation shows that annotating spoken data to construct
hyperlinks achieves better results. In our future work, we
will examine the use of visual cues to improve hyperlinking
performance.
5.</p>
    </sec>
    <sec id="sec-8">
      <title>ACKNOWLEDGEMENT</title>
      <p>This work is funded by the European Commission's
Seventh Framework Programme (FP7) as part of the AXES
project (ICT-269980).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          .
          <article-title>Search and Hyperlinking Task at MediaEval 2013</article-title>
          . In MediaEval 2013 Workshop, Barcelona, Spain,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Lamel</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Gauvain</surname>
          </string-name>
          .
          <article-title>Speech Processing for Audio Indexing</article-title>
          .
          <source>In Advances in Natural Language Processing (LNCS 5221)</source>
          , pages
          <fpage>4</fpage>
          {
          <fpage>15</fpage>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[3] Lucene 3.6.2 Document</source>
          . Apache Lucene - Scoring. https://lucene.apache.org/core/3 6 2/scoring.html, Dec.
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jakob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garc</surname>
          </string-name>
          a-Silva, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          . Dbpedia Spotlight:
          <article-title>Shedding Light on the Web of Documents</article-title>
          .
          <source>In Proceedings of the 7th International Conference on Semantic Systems</source>
          , USA,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <article-title>E cient Estimation of Word Representations in Vector Space</article-title>
          .
          <source>In Proceedings of Workshop at ICLR</source>
          , volume abs/1301.3781,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rousseau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bougares</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dellsglise</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schwenk</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Estssv</surname>
          </string-name>
          .
          <article-title>LIUM's systems for the IWSLT 2011 Speech Translation Tasks</article-title>
          .
          <source>In Proceedings of IWSLT 2011I</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Schmiedeke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ferrane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Ko er, M. A</article-title>
          .
          <string-name>
            <surname>Larson</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Esteve</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Lamel</surname>
            ,
            <given-names>G. J. F.</given-names>
          </string-name>
          <string-name>
            <surname>Jones</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Sikora</surname>
          </string-name>
          .
          <article-title>Blip10000: A Social Video Dataset Containing SPUG Content for Tagging and Retrieval</article-title>
          .
          <source>In Multimedia Systems Conference</source>
          <year>2013</year>
          , (
          <issue>MMSys</issue>
          '13), pages
          <fpage>96</fpage>
          {
          <fpage>101</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>