<!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>Query Type Recognition and Result Filtering in INEX 2014 Social Book Search Track</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shih-Hung Wu</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>Pei-Kai Liao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hua-Wei Lin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Li-Jen Hsu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei-Lun Xiao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liang- Pu Chen</string-name>
          <email>chen@csie.ncu.edu.tw</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tsun Ku</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gwo-Dong Chen</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chaoyang University of Technology</institution>
          ,
          <country country="TW">Taiwan, R.O.C</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Contact author)</institution>
          ,
          <addr-line>s10027024, s10027072</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Institute for Information Industry</institution>
          ,
          <country country="TW">Taiwan, R.O.C</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>National Central University</institution>
          ,
          <country country="TW">Taiwan, R.O.C</country>
        </aff>
      </contrib-group>
      <fpage>525</fpage>
      <lpage>535</lpage>
      <abstract>
        <p>The paper reports our system in INEX 2014 Social Book Search (SBS) track. This is the second time that we attend the SBS track. Based on our social feature re-ranking system [1], we improve our system by involving some knowledge on understanding the queries. Our baseline system is built on Lucene [6], an open source information retrieval system. The new modification is a set of rules that can filter out unnecessary books from the recommendation list. The official run results show that the system performance is much improved than the 2013 system.</p>
      </abstract>
      <kwd-group>
        <kwd>Query type recognition</kwd>
        <kwd>social features</kwd>
        <kwd>social book search</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The paper reports how we build a system to attend the INEX 2014 Social Book
Search (SBS) track [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. This is the second time that we attend the SBS track [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Based on our social feature re-ranking system [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], we improve our system by
involving some knowledge on understanding the queries.
      </p>
      <p>In the book search application, we believe that the result of traditional information
retrieval technology is not enough for the users who need more personal
recommendation. Recommendation from experienced users are more appealing; it might contain
more personal feelings and cover more subtle reasons that traditional information
retrieval system cannot cover. Our system integrates the social feature into the
traditional information retrieval technology to give better recommendation on books. In
this task, user-generated metadata is used as the social feature.</p>
      <p>According to our observation on the topics in INEX 2012 SBS Track, we find that
there are some queries that are different from others. Simply treat the keywords in the
topic as search terms will not get good result. Some of them require higher level of
knowledge to deal with. System needs to understand the information need behind the
keyword, i.e. the knowledge on the types of literature. We analysis the topics and find
several types in them. Due to the time limitation, we only implement a module to
recognize one special type of topics and a filtering module to modify the
recommendation result.</p>
      <p>The structure of this paper is as follows. Section 2 is the data set description,
section 3 shows our architecture and the details of our method, section 4 is the
experiment results, and final section gives conclusions.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Dataset</title>
      <sec id="sec-2-1">
        <title>Collection</title>
        <p>
          The document collection in this task is provided by the INEX 2014 social book search
track. The documents are in XML format, about 2.8 million books, and the size is
25.9GB. These documents are collected from Amazon.com and LibraryThing. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]
book
dimensions
reviews
editorialreviews
images
creators
blurbers
dedications
epigraphs
firstwords
lastwords
quotations
series
awards
browseNodes
characters
places
subjects
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Test Topic</title>
        <p>Topics provided by INEX 2014 Social Book Search track are collected from
LibraryThing. A topic describes the information needed for a user. Figure 1 and
Figure 2 give partial view of an example, the XML tags used are：&lt;topic id&gt;, &lt;title&gt;,
&lt;mediated_query&gt;, &lt;group&gt;, &lt;narrative&gt;, &lt;catalog&gt;, &lt;book&gt;, &lt;LT_id&gt;,
&lt;entry_date&gt;, and &lt;rating&gt;.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>CYUT System Methodology</title>
      <sec id="sec-3-1">
        <title>System Architecture</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Document</title>
    </sec>
    <sec id="sec-5">
      <title>Collection</title>
    </sec>
    <sec id="sec-6">
      <title>Indexing</title>
    </sec>
    <sec id="sec-7">
      <title>Results</title>
    </sec>
    <sec id="sec-8">
      <title>Stop words filtering</title>
    </sec>
    <sec id="sec-9">
      <title>Contentbased</title>
    </sec>
    <sec id="sec-10">
      <title>Retrieval</title>
    </sec>
    <sec id="sec-11">
      <title>Stemming</title>
    </sec>
    <sec id="sec-12">
      <title>Re-Ranking</title>
      <p>
        The index and search engine in use is the Lucene system [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which is an open source
full text search engine provided by Apache software foundation. Lucene is written in
JAVA and can be called easily by JAVA program to build various applications.
      </p>
      <p>
        According to Bogers and Larsen [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], 19 tags are more useful in the social
book search, they are &lt;isbn&gt;, &lt;title&gt;, &lt;publisher&gt;, &lt;editorial&gt;, &lt;creator&gt;, &lt;series&gt;,
&lt;award&gt;, &lt;character&gt;, &lt;place&gt;, &lt;blurber&gt;, &lt;epigraph&gt;, &lt;firstwords&gt;, &lt;lastwords&gt;,
&lt;quotation&gt;, &lt;dewey&gt;, &lt;subject&gt;, &lt;browseNode&gt;, &lt;review&gt;, and &lt;tag&gt;. Our system
also focused on the 19 tags.
      </p>
      <p>
        The content in the &lt;dewey&gt; tag is restored to strings accordint to the 2003 list of
Dewey category descriptions [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to make string matching easier. For example:
&lt;dewey&gt;004&lt;/dewey&gt; will be restored to &lt;dewey&gt;Data processing Computer
science&lt;/dewey&gt;. The content of &lt;tag&gt; is also expanded according to the count number
to emphasize its importance. For example: &lt;tag count="3"&gt;fantasy&lt;/tag&gt; will be
expanded as &lt;tag&gt;fantasy fantasy fantasy&lt;/tag&gt;. In additional to the 19 tags, our
system also indexes the content of &lt;review&gt; as independent indexes files and names it as
reviews.
      </p>
      <p>
        According to Koolen et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], an Indri [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] based system using all the contents of
&lt;Title&gt;, &lt;Query&gt;, &lt;Group&gt;, and &lt;Narrative&gt; as query terms will give better result.
According to our observation on the topics in INEX 2012 SBS Track, we find that
there are some queries that are different from others, we call them the Type2 queries.
Type2 queries are the queries that contain the names of some books that the original
users want to find similar ones. Therefore, the books in the topics should not be part
of the recommendation. Since the book names are given explicitly, our system
originally will find exactly the same books as the top recommendation. To filter out these
ones, we define a list of phrases to identify such queries and filter out the books in the
queries from the recommendation lists. The phrases are listed in the appendix in the
rear of the paper. Figure 4 gives an example of Type2 queries taken from INEX 2013
SBS topics, in which contains a key phrase “I’m reading”. We find that there are 174
queries in the INEX 2013 SBS track that can be classified as Type2 queries. Therefore,
this year, we add a module in our system to identify the Type2 queries and filtering
out the books mentioned in the topics. The modified system flow is shown in Figure 5.
3.4
      </p>
      <sec id="sec-12-1">
        <title>Re-ranking</title>
        <p>
          The Re-ranking part is similar to that in our previous work [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. We integrate the
usergenerated metadata into the traditional content-based search result by re-ranking the
results. The social features are used to give more weight on certain books, for
example
 User rating: users might evaluate a book from 1 to 5, the higher the better.
 Helpful vote: other users might endorse one comment by voting it as helpful.
 Total vote: the total number of helpful or not.
Type2
        </p>
        <p>Yes
No</p>
        <p>Search
Engine</p>
        <p>Search
Engine</p>
        <p>Filtering</p>
        <p>We designed 3 different ways to use these social features in re-ranking.
1) User Rating method</p>
        <p>Increase the weight of content-based retrieval result by adding the summation of
user rating. As shown in formula (1):
(1)</p>
        <sec id="sec-12-1-1">
          <title>2) Average User Rating method Increase the weight of content-based retrieval result by adding the average of us</title>
          <p>Re-Ranking</p>
          <p>Result
er rating. As shown in formula (2):</p>
        </sec>
        <sec id="sec-12-1-2">
          <title>3) Weights User Rating method Increase the weight of content-based retrieval result by adding the book which gets more helpful votes. As shown in formula (3) and (4): (2)</title>
          <p>(3)
(4)
3.5</p>
        </sec>
      </sec>
      <sec id="sec-12-2">
        <title>Find the Best α Value by Experiment</title>
        <p>Since there is no theoretical reference on how to set the value, in our official runs,
the value is selected via a series experiments that we conduct on the 2013 dataset.
Table 2 shows the results, we find that the system gets the best result when is 0.95.
In the official evaluation, we sent four runs. This year, we use four fields in the topics
as query terms, and we filter out some book candidates for all the type2 queries. The
configuration of each run is as follows. Run 1, the CYUT - Type2QTGN: without
reranking. Run 2, the CYUT - 0.95AverageType2QTGN, re-ranking with Average User
Rating. Run 3, the CYUT - 0.95RatingType2QTGN, re-ranking with User Rating.
Run 4, CYUT - 0.95WRType2QTGN, Re-ranking with Weights User Rating.</p>
        <p>
          Table 3 shows the official evaluation results of our four runs. Among them the
CYUT - Type2QTGN run gives the best NDCG@10 [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] result, while the re-ranking
run CYUT - 0.95AverageType2QTGN gives similar result. The other two runs give
poor results due to technical errors; the system searches the document in 2013 index
file. The last two runs should be better result if the system searches the document in
2014 index file. Comparing to the 2013 INEX SBS results in Table 4, our system
performance improved significantly.
This paper reports our system and result in INEX 2014 Social Book Search track. We
sent four runs and the results are list in Table 3. In the four runs, the CYUT
Type2QTGN run gives best nDCG@10, which is searching with content-based search
and applying a set of filtering rules based on a list of key phrase. In the future, we will
implement more modules with literature knowledge on the writers, genre of books,
geometric categories of the publishers, and temporal categories of the authors that can
deal with the special cases in the topics.
        </p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>Acknowledgement References</title>
      <p>This study was conducted under the "Online and Offline Integrated Smart Commerce
Platform (1/4)" of the Institute for Information Industry, which is subsidized by the
Ministry of Economic Affairs of the Republic of China.
Appendix: The key phrases for recognizing Type2 queries.
&lt;TotalKeyWord&gt;
&lt;keyWord&gt;I've just finished&lt;/keyWord&gt;
&lt;keyWord&gt;I'm now reading&lt;/keyWord&gt;
&lt;keyWord&gt;I'm reading&lt;/keyWord&gt;
&lt;keyWord&gt;I've read&lt;/keyWord&gt;
&lt;keyWord&gt;I read&lt;/keyWord&gt;
&lt;keyWord&gt;I've ever read&lt;/keyWord&gt;
&lt;keyWord&gt;Any book as good as&lt;/keyWord&gt;
&lt;keyWord&gt;I'm not interested&lt;/keyWord&gt;
&lt;keyWord&gt;I already own&lt;/keyWord&gt;
&lt;keyWord&gt;I own&lt;/keyWord&gt;
&lt;keyWord&gt;picked up&lt;/keyWord&gt;
&lt;keyWord&gt;I can find&lt;/keyWord&gt;
&lt;keyWord&gt;I read&lt;/keyWord&gt;
&lt;keyWord&gt;I've looked through&lt;/keyWord&gt;
&lt;keyWord&gt;I've just found&lt;/keyWord&gt;
&lt;keyWord&gt;I have already read&lt;/keyWord&gt;
&lt;keyWord&gt;I was reading&lt;/keyWord&gt;
&lt;keyWord&gt;I had read&lt;/keyWord&gt;
&lt;keyWord&gt;to read&lt;/keyWord&gt;
&lt;keyWord&gt;what other&lt;/keyWord&gt;
&lt;keyWord&gt;I'm already completely&lt;/keyWord&gt;
&lt;keyWord&gt;I have already read&lt;/keyWord&gt;
&lt;keyWord&gt;I've started on&lt;/keyWord&gt;
&lt;keyWord&gt;I just finished&lt;/keyWord&gt;
&lt;keyWord&gt;I did enjoy&lt;/keyWord&gt;
&lt;keyWord&gt;something like&lt;/keyWord&gt;
&lt;keyWord&gt;without&lt;/keyWord&gt;
&lt;keyWord&gt;I am reading&lt;/keyWord&gt;
&lt;keyWord&gt;starting with&lt;/keyWord&gt;
&lt;keyWord&gt;I already have&lt;/keyWord&gt;
&lt;keyWord&gt;I'm thinking of&lt;/keyWord&gt;
&lt;keyWord&gt;I just finished reading&lt;/keyWord&gt;
&lt;keyWord&gt;similar&lt;/keyWord&gt;
&lt;keyWord&gt;I adore&lt;/keyWord&gt;
&lt;keyWord&gt;I tried reading&lt;/keyWord&gt;
&lt;keyWord&gt;I also have&lt;/keyWord&gt;
&lt;keyWord&gt;I've seen&lt;/keyWord&gt;
&lt;keyWord&gt;I recently read&lt;/keyWord&gt;
&lt;keyWord&gt;I discovered&lt;/keyWord&gt;
&lt;keyWord&gt;I have recently read&lt;/keyWord&gt;
&lt;keyWord&gt;have been suggested&lt;/keyWord&gt;
&lt;keyWord&gt;has been suggested&lt;/keyWord&gt;
&lt;keyWord&gt;I've enjoyed&lt;/keyWord&gt;
&lt;keyWord&gt;I've just completed&lt;/keyWord&gt;
&lt;keyWord&gt;I haven't yet read&lt;/keyWord&gt;
&lt;keyWord&gt;I have only found&lt;/keyWord&gt;
&lt;keyWord&gt;I have found&lt;/keyWord&gt;
&lt;keyWord&gt;I have read&lt;/keyWord&gt;
&lt;keyWord&gt;I am re-reading&lt;/keyWord&gt;
&lt;keyWord&gt;I also recently started&lt;/keyWord&gt;
&lt;keyWord&gt;I recently started&lt;/keyWord&gt;
&lt;keyWord&gt;I just re-read&lt;/keyWord&gt;
&lt;keyWord&gt;I've compiled&lt;/keyWord&gt;
&lt;keyWord&gt;I'd really like to read&lt;/keyWord&gt;
&lt;keyWord&gt;I've already enjoyed&lt;/keyWord&gt;
&lt;keyWord&gt;I can think of&lt;/keyWord&gt;
&lt;keyWord&gt;I was considering&lt;/keyWord&gt;
&lt;keyWord&gt;Currently reading&lt;/keyWord&gt;
&lt;keyWord&gt;Apart from&lt;/keyWord&gt;
&lt;keyWord&gt;I'm nearly finished&lt;/keyWord&gt;
&lt;keyWord&gt;have been recommended&lt;/keyWord&gt;
&lt;keyWord&gt;other recommendations&lt;/keyWord&gt;
&lt;keyWord&gt;having read&lt;/keyWord&gt;
&lt;keyWord&gt;on my list&lt;/keyWord&gt;
&lt;keyWord&gt;I've been reading&lt;/keyWord&gt;
&lt;keyWord&gt;I have just received&lt;/keyWord&gt;
&lt;keyWord&gt;finishing&lt;/keyWord&gt;
&lt;keyWord&gt;also read&lt;/keyWord&gt;
&lt;keyWord&gt;recent readings&lt;/keyWord&gt;
&lt;keyWord&gt;I have been reading&lt;/keyWord&gt;
&lt;keyWord&gt;I've recently finished&lt;/keyWord&gt;
&lt;keyWord&gt;other books&lt;/keyWord&gt;
&lt;keyWord&gt;additional resources&lt;/keyWord&gt;
&lt;keyWord&gt;The most recent book I haved&lt;/keyWord&gt;
&lt;keyWord&gt;I saw a book&lt;/keyWord&gt;
&lt;keyWord&gt;Thus far I&lt;/keyWord&gt;
&lt;keyWord&gt;what else should I&lt;/keyWord&gt;
&lt;keyWord&gt;Can anyone think of any more&lt;/keyWord&gt;
&lt;keyWord&gt;books like&lt;/keyWord&gt;
&lt;keyWord&gt;something elsee&lt;/keyWord&gt;
&lt;keyWord&gt;I thoroughly enjoyed&lt;/keyWord&gt;
&lt;keyWord&gt;My reading suggestions&lt;/keyWord&gt;
&lt;/TotalKeyWord&gt;</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Wei-Lun</surname>
            <given-names>Xiao</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shih-Hung</surname>
            <given-names>Wu</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang-Pu</surname>
            <given-names>Chen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hung-Sheng Chiu</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ren-Dar</surname>
            <given-names>Yang</given-names>
          </string-name>
          , “
          <article-title>Social Feature R-eranking in INEX 2013 Social Book Search Track”</article-title>
          ,
          <source>CLEF 2013 aE-valu tion Labs and Workshop Online Working Notes</source>
          ,
          <fpage>23</fpage>
          -
          <lpage>26</lpage>
          September, Valencia, Spain.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Marijn</given-names>
            <surname>Koolen</surname>
          </string-name>
          , Gabriella Kazai, Jaap Kamps, Michael Preminger, Antoine Doucet, and Monica Landoni, “
          <article-title>Overview of the INEX 2012 Social Book Search Track”</article-title>
          ,
          <source>INEX'12 Workshop</source>
          Pre-proceedings,P.77-P.
          <year>96</year>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Toine</given-names>
            <surname>Bogers</surname>
          </string-name>
          and Birger Larsen, “
          <source>RSLItS INaEX</source>
          <year>2012</year>
          :
          <article-title>Social Book Search Track”</article-title>
          ,
          <source>INEX'12 Workshop</source>
          Pre-proceedings,P.97-P.
          <year>108</year>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Marijn</given-names>
            <surname>Koolen</surname>
          </string-name>
          , Hugo Huurdeman and Jaap Kamps, “
          <article-title>Comparing Topic Representations for Social Book Search”, CLEF 2013 Evaluation Labs</article-title>
          and Workshop Online Working Notes,
          <fpage>23</fpage>
          -
          <lpage>26</lpage>
          September, Valencia - Spain.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>T.</given-names>
            <surname>Strohman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Turtle</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          , “
          <article-title>Indri: a la-mngoudaeglebased search engine for complex queries”</article-title>
          ,
          <source>In Proceedings of the International Conference on Intelligent Analysis</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>6. Lucene, https://lucene.apache.org</mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Marijn</given-names>
            <surname>Koolen</surname>
          </string-name>
          , Gabriella Kazai,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Preminger</surname>
          </string-name>
          , and Antoine Doucet, “
          <article-title>Overview of the INEX 2013 Social Book Search Track”</article-title>
          ,
          <source>CLEF 2013 Evaluation Labs and Workshop Online Working Notes</source>
          ,
          <fpage>23</fpage>
          -
          <lpage>26</lpage>
          September, Valencia - Spain.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Järvelin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kekäläinen</surname>
          </string-name>
          , “J.:
          <article-title>Cumulated Ga-inbased Evaluation of IR Techniques”</article-title>
          ,
          <source>ACM Transactions on Information Systems</source>
          <volume>20</volume>
          (
          <issue>4</issue>
          ) (
          <year>2002</year>
          )
          <fpage>422</fpage>
          -
          <lpage>446</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>9. 2003 list of Dewey category descriptions</article-title>
          , https://www.library.illininois.edu/ugl/about/dewey.html
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <article-title>INEX 2013 Social Book Search Track</article-title>
          , https://inex.mmci.uni-saarland.de/tracks/books
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>