<!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>A Statistical Analysis Approach to Author Identification Using Latent Semantic Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Satyam</string-name>
          <email>satyam.sinha.ds@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anand</string-name>
          <email>anand62002@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arnav Kumar Dawn</string-name>
          <email>arnavdawn58@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sujan Kumar Saha?</string-name>
          <email>sujan.kr.saha@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science and Engineering Birla Institute of Technology</institution>
          ,
          <addr-line>Mesra, Ranchi</addr-line>
          ,
          <country country="IN">India -</country>
          <addr-line>835215</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>1143</fpage>
      <lpage>1147</lpage>
      <abstract>
        <p>In this paper we present a Latent Semantic Analysis (LSA) based approach to the Authorship Identification task in the PAN workshop. We apply LSA on a character n-gram based statistical model to obtain the similarities between document pairs. A statistical analysis of the pairwise document similarities is then used to determine a threshold value. Finding the optimal parameters (n-gram lengths, SVD cutoff, local and global weighting schemes), distance measures and thresholds for different languages and genre is an exercise central to this technique. The vastness of the parameter space makes the technique very flexible. The modularity of the technique allows easy tweaks to a specific module without requiring changes in other modules. This approach has very low runtime as it does away with the typical pre-processing and calculations involved in linguistic analysis.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Authorship of documents is often questioned in legal systems or in the case of newly
discovered manuscripts or articles of great literary or scientific value. The task of
Author Identification [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], as presented in the PAN-2014 workshop, requires us to verify if
a disputed document is the work of a given author, provided that other sample
documents written by the author are available for analysis. Automation of this task has been
of much interest to the research community as it is sought to mimic the wisdom of the
linguistic experts by creating systems that can recognize unique elements (grammatical
structure, stylistic markers) in the documents and attribute or rescind the authorship.
The task is inherently tedious, requires a vast knowledge and experience in
stylometry and moreover the human expertise in this area is in short supply. Hence, there is a
need for computationally efficient systems that can verify authorship with reasonable
accuracy.
      </p>
      <p>It is desirable for such systems to work across different languages and genres. In
the PAN-2014 workshop, the corpus used to evaluate the performance of the systems
included texts written in languages like Dutch, English, Greek and Spanish with genre
varying between articles, essays, novels and reviews.
? Faculty Advisor to the project</p>
    </sec>
    <sec id="sec-2">
      <title>Motivation and Objectives</title>
      <p>We aspire to create a general method that can adapt to different languages or genre
simply by making changes in the parameters used or by changing the threshold
values. Our main objective is to create a simple statistical analysis that is comparable in
performance to the conventional approaches.</p>
      <p>The small number of sample documents available makes the task very challenging.
Thus, it is common practice to improvise and collect more information about the
author’s style by crawling the internet for documents that are stylistically similar to the
samples. But we restrict our method to use only the samples provided in order to avoid
high demand for network resources at runtime.</p>
      <p>
        The effectiveness of character n-grams in stylometry has been studied extensively
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. It has been shown that character n-grams can capture valuable stylistic
information which can be used to determine authorship without the need of externally
sourced documents or any other information about the grammatical structure of the
sample documents. To elucidate, we present the following examples. Any text with
many occurrences of a question-tag like -", isn’t it?" will result in a high frequency
of the character 3-gram -"it?". Similarly any text written in past tense is characterized
by -"ed ". Also, writings that involve a lot of questions are replete with occurrences of
the -" wh" 3-gram. Thus, it is apparent that parsing the documents is not necessary to
capture the necessary details about the author’s preferences for various linguistic
constructs, and a simpler character n-gram analysis can be used for this purpose instead.
We expect this scheme to be valid for other languages as well. The optimal length of
n-gram varies across languages and depends upon the morphology. This optimal length
can be determined during training phase and can be passed as a parameter during the
test phase.
      </p>
      <p>
        Latent Semantic Analysis [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] is a method used to obtain a low-dimensional
approximation of data represented as a matrix. This has the effect of reducing noise in the data
as well as reducing the sparseness of the matrix. LSA can be accomplished by several
matrix decompositions, but the Singular Value Decomposition (SVD) is the most
popular method. It has been shown [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] that culling out the less significant singular values and
reconstructing the matrix results in a least-squares best-fit approximation of the original
matrix.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Our Approach</title>
      <p>
        We generate character n-grams by sliding a window of length n along the document.
These n-grams are used as the features or terms for our Term-Document matrix. This
matrix is populated by the product of the local weighting and the global weighting
for each term corresponding to each document. The local weighting is used to
characterize the term in the current document. Several schemes like term-frequency,
logterm-frequency or binary term-frequency may be used for local weighting [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] of the
term. The global weighting characterizes the term across all documents in the corpus.
Entropy and inverse document-frequency are used as the global weighting schemes.
Different weighting schemes give different performances for different languages and
genre. Also, to reduce the effect of variability in document lengths each document row
is then normalized by dividing by the square root of the document length.
      </p>
      <p>
        We advance previous methods that apply LSA to stylometry [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and provide a
confidence measure instead of visualisations. The singular value decomposition of the
matrix is obtained and the less significant singular values are culled out to obtain an
approximate reconstruction of the Term-Document matrix. The document rows of the
Term-document matrix are used to compute all pairwise document dissimilarities.
Different dissimilarity measures based on cosine similarity or extended Jaccard similarity
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] may be used. We surmise that the authorship may be judged by studying these
pairwise document dissimilarities.
      </p>
      <p>We differentiate between the dissimilarities between two sample documents ij and
dissimilarities between a sample document and the disputed document i . Depending
on the number of sample documents available we define the following cases</p>
      <p>Case 1 - When there is only one sample document available, only the value 1 can
be obtained and the decision is based on this parameter only. The training corpus is used
to determine a threshold value th1 such that authorship is judged to be true if 1&lt; th1
or false otherwise.</p>
      <p>Case 2 - When two documents samples are available we can obtain 1 , 2 and 12.
We obtain the mean = 1 +2 2 and = 12 . A threshold value th2 is obtained
by training such that 12&lt; th2 implies that the given author wrote the disputed
document.</p>
      <p>Case 3 - When we have n (&gt;2) sample documents we can obtain ij , 1 &lt;= i, j &lt;= n,
Pn Pn
i=1 j=1 ij and
along with Pnni values. We define the following means samples = n2
disputed= in=1 i .The change in the means is measured as = ddiissppuutteedd+ ssaammpplleess .
Similar computations are done for the variances of the two types of dissimilarities to
obtain samples =r Pin=1 Pjn=1(n2ij samples)2
q Pin=1( i disputed)2 .
and disputed = n
= disputed samples .These values are
disputed+ samples
&lt; th3 is true for the cases where
The change in the variances is measured as
used to obtain a threshold value th3 such that
the disputed document is the work of the given author.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Resources</title>
      <p>
        For the development of the software we use the Stylo [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] package from the CRAN
repository that is distributed under the GNU GPL 3 license. Stylo provides a
comprehensive collection of functions used frequently in stylometric analysis. Our software is
implemented entirely in R [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] which is a popular language for statistical computing and
graphics.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Result and Analysis</title>
      <p>
        We trained and tested our software on the corpus provided by the PAN workshop for the
Author Identification task. TIRA [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] - an automated tool for deployment and evaluation
of the software was developed at the workshop and provided as a facility to the
participants. We were able to obtain competitive results while maintaining a very low runtime.
The performance of our software for different categories is tabulated as follows
We provide an alternative mechanism for authorship attribution with results comparable
to most other approaches to the task. It paves the way for further exploration in the
utility of character n-gram based analysis and effectiveness of LSA in creating a
lownoise approximation of data. There is a possibility to exploit weak patterns in the corpus
that follow the Zipf’s Law. Also, there is a lot of scope for studying the effect of different
weighting schemes, normalization methods and similarity measures on the performance
of our method.
      </p>
      <p>
        The application of Burrow’s Delta [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] to stylometric applications [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] has been
well studied. The Burrow’s delta is Manhattan distance between document rows after
the term-columns have been centered on the column mean and are normalized by
dividing by the standard deviation of the column. This provides a motivation for testing
other centering and normalization schemes and other distance measures like Canberra,
Euclidean, etc. Several modifications [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] of the Burrow’s delta have been implemented
and tested and their usage could be a valuable modification in our system.
      </p>
      <p>Our system performs sub-optimally for Spanish and Greek texts and this calls for
a more involved study of the morphological structures of these languages to develop a
more sophisticated approach.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Burrows</surname>
          </string-name>
          , J.:
          <article-title>Delta: a measure of stylistic difference and a guide to likely authorship</article-title>
          .
          <source>Literary and Linguistic Computing</source>
          <volume>17</volume>
          (
          <issue>3</issue>
          ),
          <fpage>267</fpage>
          -
          <lpage>287</lpage>
          (
          <year>2002</year>
          ), http://llc.oxfordjournals.org/content/17/3/267.abstract
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Dumais</surname>
          </string-name>
          , S.T.:
          <article-title>Improving the retrieval of information from external sources</article-title>
          .
          <source>Behavior Research Methods, Instruments, &amp; Computers</source>
          <volume>23</volume>
          (
          <issue>2</issue>
          ),
          <fpage>229</fpage>
          -
          <lpage>236</lpage>
          (
          <year>1991</year>
          ), http://psychonomic.org/search/view.cgi?id=
          <fpage>5145</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Eder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kestemont</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rybicki</surname>
          </string-name>
          , J.:
          <article-title>Stylometry with r: a suite of tools</article-title>
          .
          <source>In: Digital Humanities</source>
          <year>2013</year>
          : Conference Abstracts. pp.
          <fpage>487</fpage>
          -
          <lpage>89</lpage>
          . University of Nebraska-Lincoln, Lincoln,
          <string-name>
            <surname>NE</surname>
          </string-name>
          (
          <year>2013</year>
          ), http://dh2013.unl.edu/abstracts/
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beyer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Busse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Recent trends in digital text forensics and its evaluation</article-title>
          . In: Forner,
          <string-name>
            <given-names>P.</given-names>
            , MÃijller, H.,
            <surname>Paredes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <surname>B</surname>
          </string-name>
          . (eds.)
          <article-title>Information Access Evaluation meets Multilinguality, Multimodality,</article-title>
          and Visualization. Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Houvardas</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
          </string-name>
          , E.:
          <article-title>N-gram feature selection for authorship identification</article-title>
          . In: Euzenat,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Domingue</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.)
          <source>Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science</source>
          , vol.
          <volume>4183</volume>
          , pp.
          <fpage>77</fpage>
          -
          <lpage>86</lpage>
          . Springer Berlin Heidelberg (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Juola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
          </string-name>
          , E.:
          <article-title>Overview of the author identification task at pan 2013</article-title>
          . In: Forner,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Navigli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Tufis</surname>
          </string-name>
          ,
          <string-name>
            <surname>D</surname>
          </string-name>
          . (eds.)
          <source>Working Notes Papers of the CLEF 2013 Evaluation Labs</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Foltz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laham</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>An introduction to latent semantic analysis</article-title>
          .
          <source>Discourse processes 25</source>
          ,
          <fpage>259</fpage>
          -
          <lpage>284</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Mathematical foundations behind latent semantic analysis</article-title>
          .
          <source>Handbook of latent semantic</source>
          analysis pp.
          <fpage>35</fpage>
          -
          <lpage>55</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>R</given-names>
            <surname>Core Team: R: A Language</surname>
          </string-name>
          and
          <article-title>Environment for Statistical Computing</article-title>
          . R Foundation for Statistical Computing, Vienna, Austria (
          <year>2014</year>
          ), http://www.R-project.org/
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Soboroff</surname>
            ,
            <given-names>I.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nicholas</surname>
            ,
            <given-names>C.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kukla</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ebert</surname>
            ,
            <given-names>D.S.:</given-names>
          </string-name>
          <article-title>Visualizing document authorship using ngrams and latent semantic indexing</article-title>
          .
          <source>In: Proceedings of the 1997 Workshop on New Paradigms in information Visualization and Manipulation</source>
          . pp.
          <fpage>43</fpage>
          -
          <lpage>48</lpage>
          . Addison-Wesley, New York, NY (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Stamatatos</surname>
          </string-name>
          , E.:
          <article-title>On the robustness of authorship attribution based on character n-gram features</article-title>
          .
          <source>Journal of Law and Policy</source>
          <volume>21</volume>
          (
          <issue>2</issue>
          ),
          <volume>421</volume>
          (March
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argamon</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A mathematical explanation of burrows's delta</article-title>
          .
          <source>In: Proceedings of the Digital Humanities Conference</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Strehl</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghosh</surname>
          </string-name>
          , J.:
          <article-title>Value-based customer grouping from large retail data-sets</article-title>
          .
          <source>In: Proc. SPIE Conference on Data Mining and Knowledge Discovery, Orlando</source>
          . vol.
          <volume>4057</volume>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>42</lpage>
          . SPIE (April
          <year>2000</year>
          ), http://strehl.com/download/strehl-spie00.pdf
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>