<!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>Description Info</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>UNED @ Retrieving Diverse Social Images Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A. García-Serrano NLP</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>IR Group</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>UNED C/ Juan del Rosal</string-name>
          <email>acastellanos@lsi.uned.es</email>
          <email>juanci@lsi.uned.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Madrid</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Spain agarcia@lsi.uned.es</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>A.Castellanos NLP &amp; IR Group, UNED C/ Juan del Rosal</institution>
          ,
          <addr-line>16 Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>J.Cigarrán NLP &amp; IR Group, UNED C/ Juan del Rosal</institution>
          ,
          <addr-line>16 Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <volume>0</volume>
      <issue>7581</issue>
      <fpage>16</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>This paper summarizes the participation of UNED at the 2014 Retrieving Diverse Social Images Task [3]. We propose a novel approach based on Formal Concept Analysis (FCA) to detect the latent topics related to the images and a later Hierarchical Agglomerative Clustering (HAC) to put together the images according to these latent topics. The diversification will be based on offering images from the different topics detected. In order to detect these latent topics, two kinds of data have been tested: only information related to the description of the images and all the textual information related to the images. The results show that our proposal is suitable for search result diversification, achieving similar results to those in the state of the art.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Diversification, in the sense proposed by this task, refers
to the creation of a diverse result list given an user query.
The rationale is that the users are not only interested in
accurate results but also in results covering different
topics or situations. From the IR-based point of view, a good
definition of the problem and a review of the state of the
art can be found at [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. To address this task we propose a
novel approach based on an image representation using the
concept/s covered by the image. For that, we use the
information related to the images to create a conceptual-based
data representation. The creation of this conceptual
representation is tackled by means of the application of Formal
Concept Analysis, a data organization technique. We expect
this representation will make explicit the latent concepts in
the images as well as the relationships between them. Based
on this FCA representation, a HAC algorithm is proposed
for grouping similar images, according to the latent concepts
detected. Our hypothesis is that the resultant groups can
represent the different topic addressed in the images. So,
the image diversification will be done by taking one image
from the different HAC-based clusters/topics.
      </p>
    </sec>
    <sec id="sec-2">
      <title>WORK PROPOSAL</title>
      <p>Our proposal is based on taking the information related to
the images so as to create a conceptual-based representation.
This representation intends to discover latent concepts in
the data and the relationships between them. For that, we
propose the application of Formal Concept Analysis as a
modelling technique. By means of FCA, the set of images
to be diversified will be organized according to their latent
concepts.</p>
      <p>After the FCA application, a hierarchy organizing the
images in formal concepts according to their shared features
will be obtained. However, it still remains the
diversification of the images according to this representation. For that,
we proposed the application of a HAC algorithm to group
together the formal concepts that could be considered as
similar (belonging to the same topic).</p>
      <p>After this grouping, each HAC cluster can be considered
as an image set covering a similar topic. Then, for each
cluster the best image in the group (the one with a higher
ranking according to the ranking provided by the task, taken
from an IR system) will be taken and offered as result. The
final result list will be a ranked list of images, ordered
according to the provided ranking. As our methodology does
not provide any score associated to the results and it was
required by the organization, a dummy score has been set
(1 for the 1st result in the ranking, 0.99 for the second, and
so on).
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Formal Concept Analysis</title>
      <p>
        Formal Concept Analysis (FCA) is a mathematical
theory of concept formation [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] derived from lattice and
ordered set theories that provide a theoretical model to
organize formal contexts. A formal context is a set structure
K := (G, M, I), where G is a set of objects, M a set of
attributes and I a binary relationship between G and M ,
(I ⊆ G × M ), denoted by gIm, which is read as: the
object g has the attribute m. An example of formal context is
shown in the Figure 1a. From the point of view of a
content representation system, the formal context can be seen
as the set of contents (images) to be represented (G) is the
set of items to be represented, the set of textual (or other
kind of) features (M ), representing the items, and the
binary relationship I can be read as item g has the feature
m.
      </p>
      <p>From the information in the formal context, a set of formal
concepts can be inferred. A formal concept is a pair (A, B) of
objects and attributes, which has the following properties:
If an object a in A is tagged with an attribute b, then b
must is included in B (B = AI includes all the attributes
shared by the objects). Conversely, if an object a is tagged
with all the attributes in B, then a must be included in A
(i.e. A = BI : includes all those objects filtered out by the
attributes). Finally, the whole sets of formal concepts can be
organized according to an order relationship, from the most
generic to the most specific. This order can be proven to
be a lattice and, consequently, to be represented as a Hasse
Diagram, as the one in the Figure 1b.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>FCA-based Modelling</title>
      <p>Following the FCA rationale, the information of each of
the 123 locations included in the test set is modelled. After
this modelling, a set of formal concepts, grouping together
the images sharing a same set of features, will be obtained.
To select the features to model the images we propose two
different kinds of data: 1) use only the description
information of the images (description, title and tags), and 2) use all
the textual information related to the images (description,
title, tags, user information and date information).</p>
      <p>
        In order to select only those most-representative features,
we applied Kullback-Leibler Divergence (KLD) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] on the
textual contents related to the images. Basically, KLD
compares the textual content related to a given image to the
textual contents of the rest of the images. In this way,
KLD allows representing each image by the textual contents
that better differentiates a given image from the other ones.
Hopefully, it will allow the improvement of the diversity of
the images selected.
2.3
      </p>
    </sec>
    <sec id="sec-5">
      <title>HAC-based grouping</title>
      <p>
        From the FCA-based modelling, a hierarchy organizing
the obtained set of formal concepts is provided. It remains
the creation of a set of diverse image groups based on this
organization. For that, we propose the application of a
HAC algorithm [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Specifically, we propose a Single
Linking based hierarchical clustering that groups together similar
formal concepts. In order to set the ”similarity” of two
formal concepts, we have applied the Zero-Induces index [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
This index measures the similarity of two formal concepts,
based on the number of features that they share.
      </p>
    </sec>
    <sec id="sec-6">
      <title>RESULTS</title>
      <p>Table 1 shows the results obtained by our approaches for
the official runs. In general the performance of our
approaches are in the same level than other approaches in
the state of the art, according the results of last year for
the same task. The inclusion of all the textual information
related to an image seems to slightly improve the
performances, both for precision and also for diversity based
results. It is reasonable to think that including different kinds
of data will improve the diversity of the results. However, as
it can be seen in the results, also the precision based results
are favoured by the inclusion of more information than only
the related to the description. However, this improvement is
not enough to definitely conclude that this information can
represent a valuable indicator for image diversity.
4.</p>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSIONS</title>
      <p>In this paper we presented a Conceptual-based modelling
(based on FCA) for improving diversity in the retrieving of
social images. With FCA we intend to infer the latent topics
addressed in the information related to the images. Once the
latent concepts has been detected, in order to put together
the most similar ones, we have applied an HAC approach.</p>
      <p>Our hypothesis is that this concept modelling could help
in the diversification of the retrieved images. For that, given
a query the system will retrieve images trying to cover all
the identified topics.</p>
      <p>In this work we have also experimented with different
kinds of information to describe the images. The obtained
results proved our proposal as suitable to offer accurate and
also diverse results. Related to the kind of information to
use, the inclusion of the most information possible about the
images seems to be the best choice. For both, precision and
diversity based results, its performance is better, although
the improvement in the diversity is not very large.
5.</p>
    </sec>
    <sec id="sec-8">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work has been partially supported by VOXPOPULI
(TIN2013-47090-C3-1-P) Spanish project.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gollapudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halverson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ieong</surname>
          </string-name>
          .
          <article-title>Diversifying search results</article-title>
          .
          <source>In Proceedings of the Second ACM International Conference on Web Search and Data Mining</source>
          , pages
          <fpage>5</fpage>
          -
          <lpage>14</lpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Alqadah</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Bhatnagar</surname>
          </string-name>
          .
          <article-title>Similarity measures in formal concept analysis</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          ,
          <volume>61</volume>
          (
          <issue>3</issue>
          ):
          <fpage>245</fpage>
          -
          <lpage>256</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Popescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lupu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Gˆınsca</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Mu</surname>
          </string-name>
          <article-title>¨ller. Retrieving diverse social images at mediaeval 2014: Challenge, dataset and evaluation</article-title>
          .
          <source>In Proceedings of MediaEval Benchmarking Initiative for Multimedia Evaluation.</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kullback</surname>
          </string-name>
          and
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Leibler</surname>
          </string-name>
          .
          <article-title>On information and sufficiency</article-title>
          .
          <source>The Annals of Mathematical Statistics</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>79</fpage>
          -
          <lpage>86</lpage>
          ,
          <year>1951</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Schu</surname>
          </string-name>
          <article-title>¨tze. Hierarchical clustering</article-title>
          . pages
          <fpage>377</fpage>
          -
          <lpage>403</lpage>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Concept lattices and conceptual knowledge systems</article-title>
          .
          <source>Computers &amp; mathematics with applications</source>
          ,
          <volume>23</volume>
          (
          <issue>6</issue>
          ):
          <fpage>493</fpage>
          -
          <lpage>515</lpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <source>Restructuring Lattice Theory: An Approach Based On Hierarchies Of Concepts</source>
          , volume
          <volume>5548</volume>
          of Lecture Notes in Computer Science. Springer Berlin Heidelberg,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>