<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06075791</id>
  <dt>j</dt>
  <an>06075791</an>
  <augroup>
    <au>Sun, Fuming</au>
    <au>Wang, Meng</au>
    <au>Wang, Dongxia</au>
    <au>Wang, Xueming</au>
  </augroup>
  <ti>Optimizing social image search with multiple criteria: relevance, diversity, and typicality.</ti>
  <so>Neurocomputing 95, 40-47 (2012).</so>
  <py>2012</py>
  <pu>Elsevier Science Publishers B.V., Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>social image search</ut>
    <ut>tag</ut>
    <ut>diversity</ut>
    <ut>typicality</ut>
    <ut>relevance</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.neucom.2011.05.040</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The explosive growth and wide-spread accessibility of community-contributed multimedia contents on the Internet have led to a surging research activity in social image search. However, the existing tag-based search methods frequently return irrelevant or redundant results. To quickly target user's intention in the result returned by an ambiguous query, we first put forward that the top-ranked search results should meet some criteria, i.e., relevance, typicality and diversity. With the three criteria, a novel ranking scheme for social image search is proposed which incorporates both semantic similarity and visual similarity. The ranking list with relevance, typicality and diversity is returned by optimizing a measure named Average Diverse Precision. The typicality score of samples is estimated via the probability density in the space of visual features. The diversity among the top-ranked list is achieved by fusing both semantic and visual similarities of images. A comprehensive approach for calculating visual similarity is considered by fusing the similarity values according to different features. To further benefit ranking performance, a data-driven method is implemented to refine the tags of social image. Comprehensive experiments demonstrate the effectiveness of the approach proposed in this paper.</ab>
    <rv></rv>
  </abgroup>
</item>