<!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>Vector space model and Overlap metric for Author Identification</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Nuance Communications</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <abstract>
        <p>This paper describes our entry for the Author Identification task at PAN 2013. The Author Identification task was performed using a combination of Vector Space Model [1] (VSM) and Similarity Overlap Metric [3] (SOM) on the character n-grams extracted from the documents related to an author and the document of question. A combination of the VSM and SOM provided an overall F-measure, precision and recall values of 0.576 each.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The author identification task is to identify whether the given document is written by
the author of the known document(s). The initial challenge was to identify what features
would help in identifying the author. Based on the following intuition, we identified that
character 3-grams would help in identifying the author. For example in English, some
authors like to write-up either in past tense, present tense, future tense or continuous
tense. All these tenses in English can be identified using clear indicators such as
continuous tense is always indicated by Jerund format ie., words with characters ’ing’ at the
suffix. The tense will clearly indicate the style of the author. Further to this, an author
might use descriptive words (i.e., adjectives) to represent something in their storyline.
These details can be easily identified from a character 3-gram or 4-gram. The intuition
was considered with expertise in English language only. Based on this intuition, we
decided to use character n-gram model for the system.
2.1</p>
      <sec id="sec-1-1">
        <title>Problem statement &amp; Data</title>
        <p>For the author identification task, we were provided with the following training data by
PAN.</p>
        <p>– 10 English, 20 Greek and 5 Spanish folders
– Each folder had upto 10 documents written by a known author
– Each folder also had a document written by an unknown author
– A gold standard was also provided for all the folders
The idea was to classify whether the document written by the unknown author is written
by the known author or not.
2.2</p>
      </sec>
      <sec id="sec-1-2">
        <title>Approach</title>
        <p>
          The author identification task being closely related to intrinsic plagiarism detection,
we considered author style as the only feature for classification. Therefore, we used a
combination of VSM [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and SOM [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The known author’s documents and unknown
author’s document were processed before they were considered for vector space model.
The processing involved converting all the spaces into underscore (_) and converting
all newline characters to double underscore (__). On processing the documents, the
following approaches were implemented.
        </p>
        <p>
          Vector Space Model The known author’s documents were split into 3-gram
characters and considered as a vector and unknown author’s document was split into 3-gram
characters and was considered as a different vector. Based on the VSM, a similarity
measure was computed which represented the cosine of the angle between two vectors.
As mentioned in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], following is the cosine value computation.
        </p>
        <p>consider known documents vector be!x = (x1; x2; ::; xn)
and unknown document vector be !y = (y1; y2; ::; yn)</p>
        <p>
          cos(!x ; !y) = j!x!xj;:!jy!yj = pPin=P1inx=i21pxiPyiin=1 yi2
Similarity Overlap On initial evaluation, it was identified that just the cosine values
produced by VSM were not enough to classify whether the unknown document was
written by the author of the known documents or not. Therefore, we required another
approach for the classification. The similarity overlap metric [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] attempted last year for
the source retrieval task is used here to compute the 3-gram character similarity overlap
between the known document and the unknown document.
        </p>
        <p>consider known documents set X = set(x1; x2; ::; xn)
consider unknown document set Y = set(y1; y2; ::; yn)</p>
        <p>X T Y</p>
        <p>
          Overlap(X; Y ) = min(X;Y )
The cosine and overlap values always range between 0 and 1, therefore we used thresold
values to classify the unknown documents. The following table represents the threshold
values used for classification.
Based on the said threshold values, the unknown document was classified as known
document or unknown document. Although the initial intuition was to use this
methodology for English dataset, we attempted the same for all other datasets as well. The
following results and discussion section provides the insight based on the results
obtained for the said approach.
The baseline precision, recall and f-measure values were set at 0.500 for the author
identification task. The results available at [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] are summarized in the following table.
The overall precision and recall values stood at 0.576, which suggested that the overall
approach carried out for author identification is a good start.
        </p>
        <p>Data Set
Overall
English
Greek
Baseline
Spanish
As we get into the scores for different language sets, the approach did not work well for
spanish dataset. This suggests that we need to look for better language specific features
to classify author. Although the approach was carried out based on intuition for English
language, the results suggests that the same language features work better for Greek
than for English. Since we have used two very simple approaches to identify the author,
the time complexity of the system proves to be the best of all.
3</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Conclusion</title>
      <p>The author identification task was completed with better than baseline results for all
the datasets, while the precision and recall values for spanish dataset were lower than
baseline. Therefore the features for spanish need to be selected carefully
understanding the language specification and flavour. Further to this, the current system produced
promising results with a combination of vector space model and similarity overlap
metric, which can further be experimented with diferent character grams. Moreover, we
will be scrutinizing other language specific features which may be useful to identify the
document’s author.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>G.</given-names>
            <surname>Salton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.S.</given-names>
            <surname>Yang</surname>
          </string-name>
          :
          <article-title>A vector space model for automatic indexing</article-title>
          . In: C.A.Montgomery (ed.)
          <source>Communications of ACM</source>
          . vol.
          <volume>18</volume>
          , pp.
          <fpage>613</fpage>
          -
          <lpage>620</lpage>
          (
          <year>November 1975</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Jayapal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Similarity overlap metric and greedy string tiling at pan 2012: Plagiarism detection</article-title>
          .
          <source>In: Notebook for PAN at CLEF</source>
          <year>2012</year>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Nawab</surname>
            ,
            <given-names>R.M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stevenson</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clough</surname>
          </string-name>
          , P.: University of sheffield
          <source>lab report for pan at clef</source>
          <year>2010</year>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. PAN:
          <article-title>Author identification</article-title>
          .
          <source>Online (June</source>
          <year>2013</year>
          ), http://www.uniweimar.de/medien/webis/research/events/pan-13/pan13-web/pan13-ai
          <article-title>-final-results</article-title>
          .pdf
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>