<!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>To ee { Semantic Media Search Using Topic Modeling and Relevance Feedback</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mikko Koho</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erkki Heino</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arttu Oksanen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eero Hyvonen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Helsinki Centre for Digital Humanities, University of Helsinki</institution>
          ,
          <country country="FI">Finland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Semantic Computing Research Group (SeCo), Aalto University</institution>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper considers relevance feedback [1, Ch. 5] search on the Web. Here the information need and query cannot be formulated in the outset|a typical situation in many search situations|but gets re ned through making a series of queries and by evaluating the results in between. As an instance of such search the following problem setting is considered: since 1981, The Finnish engineering trade unions TEK and TFiF have given the yearly Finnish Engineering Award3 to a \notable engineering or architectural work which has remarkably advanced technical competence in Finland". Would it be possible to devise a search system that could help the award committee members in nding out award winning candidates from the news and other materials on the Web? This paper presents and demonstrates the rst results of our research on creating such a search service. The novel idea in the proposed approach is to combine implicit and explicit feedback methods [6] by using topic modeling [2] for extracting topics from the search results. Extracted topics and user feedback are used to generate new search keywords, which then guides the iterative search process. The developed search prototype To ee is designed to work especially with Finnish language content, but can handle documents in any language.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>To illustrate the idea, Fig. 1 shows the user interface of To ee, with a search
made to nd news related to technology innovations from a web corpus created
by the National Broadcasting Company YLE4. The initial search was based on
the words \innovaatio" (innovation) and \teknologia" (technology). After this,
the search has been repeated with feedback that emphasized news articles about
the clean technology industry. The actual nine search words are shown below
the search eld, and the list of results below that. The main topics of each result
are shown on the left of the result title and short description. The colored circles
indicate di erent topics and the circle sizes depict the importance of the topic,
with a tooltip showing the most important words of a topic.
3 https://www.tek.fi/en/technology-future/finnish-engineering-award
4 http://www.yle.fi</p>
      <p>
        To ee source codes are available online5 as a multi-container Docker
application. The search logic is based on the following steps (cf. Fig. 2):
1. A broad initial search is conducted with some keywords that are hypothesized
to produce at least some results of interest.
2. Query expansion [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is applied by looking up broader and similar entities
from the Holistic Collaborative Finnish Ontology KOKO [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] via SPARQL
using the ARPA annotation tool [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The related entities are found by
matching entity labels to search keywords and following SKOS relations to other
entities.
3. The query is sent to the search service API (currently either Google or
Elasticsearch) and a maximum of 50 results are received. In case of web search,
the resulting web pages are scraped for text contents. With Elasticsearch,
the document contents are returned from the search.
4. All the words in the document contents are then reduced to their base forms
using the SeCo Lexical Analysis Service [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
5. Topic modeling is applied to the result set using Latent Dirichlet
Allocation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In the case of Elasticsearch, the topics of the whole corpus have
been pre-calculated initially. In the case of web search, topics are computed
on-the- y, with a low amount of iterations.
6. All results are returned to the user interface and the user can mark each
individual result as interesting or not interesting. The user can then resend
the query with the feedback, and the feedback is used to reformulate the
query, and the search process continues from step 2.
5 https://github.com/SemanticComputing/toffee
Search
keywords
Select top words
for new query
      </p>
      <p>Calculate word
scores based
on feedback</p>
      <p>Get weighted Feedback
topic words</p>
      <p>Topic
modeling
Results
(1)
(2)</p>
      <p>The user can mark any of the returned results as relevant or non-relevant, or
leave it undecided. Any of the generated search words of the previous iteration
can be removed, as the search process could produce unwanted keywords.</p>
      <p>The system reformulates a new iteration of the query, based on the user
feedback. An initial weight S0 is given to each word present in the previous
query terms Q or in the words of the previous search results R according to
formula 1, where V = Q [ R.</p>
      <p>S0(w) =
1 if w 2 Q
0 if w 2= Q ; 8w 2 V</p>
      <p>The initial weights are then modi ed based on the possible feedback of each
result according to formula 2, where D is the set of result documents from
previous search, d;k is the probability of topic k occurring in document d. 'k;w
is the probability of word w occurring in topic k, and fd is the user feedback
for document d, which can be positive, negative or zero (meaning no feedback is
given about the result), with the system using a xed magnitude to both positive
and negative feedback. K is the number of topics.</p>
      <p>K
S(w) = S0(w) + X X</p>
      <p>d;k 'k;w fd
d2D k=1</p>
      <p>The words with the highest weight are then used for the next iteration of
the query, with some limit in the maximum number of query words. The user
can iteratively give feedback on the results, receive new results, and direct the
search to the topics of interest.
3</p>
      <p>
        Related Work and Discussion
Various methods exist for relevance feedback search [
        <xref ref-type="bibr" rid="ref1 ref6">1,6</xref>
        ]. Teevan et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] enrich
web search with relevance feedback based on a constructed user pro le. Peltonen
et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] combine visual intent modeling with exploratory relevance feedback
search. Tang et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] have used topic modeling in academic literature search.
Song et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] employed topic modeling with relevance search, based on implicit
feedback from the topics of the user web search history. However, the idea of
combining topic modeling of the query results with relevance search, as described
in this paper, is to the best of our knowledge new.
      </p>
      <p>To ee is still in an early stage of development. No formal evaluation about its
usability from the user's view point has been made and there are also challenges
in measuring precision and recall in an application like this. However, based on
our rst tests, the idea of providing the user with suggestions for re ning the
next search seems promising, and if the suggestions seem inappropriate, she is
not forced to use them. The system contains plenty of variables to tune, like the
number of topics, the number of topic modeling iterations, feedback strength,
and query expansion details, which impact the system performance, and the full
potential of the approach has not been reached yet. In the future, the system
will be evaluated based on the original research problem.</p>
      <p>Acknowledgements This research was partially funded by Business
Finland and The Media Industry Research Foundation of Finland.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          : Modern Information Retrieval (2nd Ed.).
          <source>Addison-Wesley Longman Publishing Co., Inc</source>
          . (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Blei</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          :
          <article-title>Probabilistic topic models</article-title>
          .
          <source>Commun. ACM</source>
          <volume>55</volume>
          (
          <issue>4</issue>
          ),
          <volume>77</volume>
          {84 (Apr
          <year>2012</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/2133806.2133826
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Makela, E.:
          <article-title>Combining a REST lexical analysis web service with SPARQL for mashup semantic annotation from text</article-title>
          .
          <source>In: Proceedings of the ESWC 2014 demonstration track</source>
          , Springer-Verlag (May
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Makela, E.:
          <article-title>LAS: an integrated language analysis tool for multiple languages</article-title>
          .
          <source>The Journal of Open Source Software</source>
          <volume>1</volume>
          (
          <issue>6</issue>
          ) (oct
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Peltonen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strahl</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Floreen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Negative relevance feedback for exploratory search with visual interactive intent modeling</article-title>
          .
          <source>In: Proceedings of the 22nd International Conference on Intelligent User Interfaces</source>
          . pp.
          <volume>149</volume>
          {
          <fpage>159</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Salton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buckley</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Improving retrieval performance by relevance feedback</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          <volume>41</volume>
          (
          <issue>4</issue>
          ),
          <volume>288</volume>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Bridging topic modeling and personalized search</article-title>
          .
          <source>In: Proceedings of the 23rd International Conference on Computational Linguistics: Posters</source>
          . pp.
          <volume>1167</volume>
          {
          <fpage>1175</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Zhang, J.:
          <article-title>A topic modeling approach and its integration into the random walk framework for academic search</article-title>
          .
          <source>In: Data Mining</source>
          ,
          <year>2008</year>
          . ICDM'08. Eighth IEEE International Conference on. pp.
          <volume>1055</volume>
          {
          <fpage>1060</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Teevan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horvitz</surname>
          </string-name>
          , E.:
          <article-title>Personalizing search via automated analysis of interests and activities</article-title>
          .
          <source>In: Proc. of the 28th Annual International ACM SIGIR Conference</source>
          . pp.
          <volume>449</volume>
          {
          <fpage>456</fpage>
          . SIGIR '05,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Viljanen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuominen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Hyvonen, E.:
          <article-title>Ontology libraries for production use: The nnish ontology library service onki</article-title>
          .
          <source>In: European Semantic Web Conference</source>
          . pp.
          <volume>781</volume>
          {
          <fpage>795</fpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Voorhees</surname>
            ,
            <given-names>E.M.:</given-names>
          </string-name>
          <article-title>Query expansion using lexical-semantic relations</article-title>
          .
          <source>In: Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          . pp.
          <volume>61</volume>
          {
          <fpage>69</fpage>
          . Springer-Verlag New York, Inc. (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>