<!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 Big Increase in Known Unknowns: from Author Verification to Author Clustering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anna Vartapetiance</string-name>
          <email>a.vartapetiance@surrey.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lee Gillam</string-name>
          <email>l.gillam@surrey.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computing, University of Surrey</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Previous PAN workshops have afforded evaluation of our approaches to author verification/identification based on stopword cooccurrence patterns. Problems have tended to involve comparing one document to a small set of documents (n&lt;=5) of known authorship. This paper discusses the adaptation of one of our approaches to a PAN 2016 problem of author clustering, which involves generating clusters within larger sets of documents (n&lt;=100) for an unknown number of distinct authors, where each set is in English, Dutch or Greek. We describe our previous approaches as the background to the approach taken to this task and briefly overview the results that were achieved, which are not expected to be particularly remarkable due to substantial limitations on our time around the task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In previous years of the International Workshop on Uncovering Plagiarism,
Authorship, and Social Software Misuse (PAN – for example, [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]), we have tested our
ideas on co-occurrence patterns of stopwords [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], explored 3 variations of such an
approach [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and created a means to adapt for topic-specific term length [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These
previous years of PAN were geared towards a classification task, deciding the degree
to which a document belongs to a class comprised of other documents. In PAN2016
this has changed from a classification task to a categorization task, with an unknown
number of categories less than or equal to the number of documents [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Where
previous tasks involved small numbers of documents in the existing class (n&lt;=5), this
task involves generating clusters from larger sets of documents (n&lt;=100), where each
set of documents is in English, Dutch or Greek. This author clustering task could be
considered as offering a more rigorous version of the classification task, as a kind of
attribution given noise, which could also help to bring a more objective evaluation of
authorship, in particular, by reducing the so-called “halo effect” of expert testimony.
      </p>
      <p>In this paper, we discuss the simple adaptations made to our existing approach in
order to address this task. Due to significant limitations on our time, we were unable
to evaluate our approach with any real form of rigour beyond a limited brute force
determination of category formation thresholds, and so results obtained reflect more a
desire to continue our involvement in PAN and are not expected to be remarkable.</p>
      <p>In section 2, we briefly discuss the previous approaches we have used for author
verification. Section 3 explains the modifications made to address PAN 2016. Section
4 offers results and evaluation, and Section 5 concludes the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Previous methods applied</title>
      <p>
        For PAN2012, we used a mean-variance framework for author ‘attribution’,
analysing co-occurrence a small set (up to 10 of the most frequent) of stopwords
within a specified maximum word window [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and extended this approach to Greek
and Spanish texts PAN2013 simply by using language-specific stopword lists.
PAN2014 required another stopword list, this time for Dutch (see Table 1, below, for
full set of stopwords used across these tasks), and allowed us to explore two further
approaches based on (i) an aggregate cosine comparison of positional frequencies and
(ii) a single cosine comparison [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In PAN2015, we created a means to adapt for
topic-specific term length [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and account for positional variation due to this. These
approaches provided fertile ground for a PAN2016 effort.
      </p>
      <p>For this year’s task, the shift from classification to categorization curtailed deeper
explorations into the effectiveness of the previous approaches and focused activity
entirely on adaptation to the new task. Many possible categorization approaches exist,
but where text is involved these tend to focus towards topics and involve feature
selection approaches geared towards discrimination of topic-specific keywords, with
similarity evaluation based on these features, for example with similarity measures
over vector space models. Since, according to the task description, the text topic may
vary, topic-specific approaches were ruled out. For this reason, we quickly fall back
to our previously evaluated methods; also because our previous approaches involve
determining similarity over, essentially, vector spaces.</p>
      <p>
        Our approach operates, in general, as follows: we consider a maximum window
distance, w, as a distance between any two stopwords in a stoplist of length l. For each
document, we produce a matrix (w by l2) representing the separation distances
between pairs of stopwords. The variants of our approach relate to different ways in
which then to treat the data in this matrix, and a number of further alternatives that we
are yet to explore exist here also. In terms of matching, this approach carries
statistical advantages – since stopwords are very hard for an author to avoid, in
contrast to keywords, sparsity of such a matrix should be less of an issue – whilst
disproportionality may be indicative of individual preferences and factor out
structural (grammatical) restrictions – for example, ‘of the’ but typically not ‘the of’,
similar to the ‘bread and butter’ but typically not ‘butter and bread’ of [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Our
adaptation for topic-specific term length attempts to address differences in separation
distances in respect to a propensity for, for example, long compound nominals in
certain topics compared to others (‘chiral single-walled carbon nanotubes’;
‘twinengine tandem rotor heavy-lift helicopter’). We address this through the notion of a
‘topic cost’, which we determine by counting the number of terms between the
stopwords of interest and the length of these terms, and using the difference between
these two values to re-distribute a given position score. This requires, for each
language, an additional resource - also a stoplist, albeit rather more comprehensive
than those identified above - to be able to expose the terms. For PAN2015, we could
then investigate similarities between one unknown document and any number
(although n&lt;=5) of known documents, and also between all known documents, to
establish expectations on similarity. A document could be considered as being by the
same author if the highest similarity values obtained in comparing the known
document to the unknown documents – with comparison made pattern-wise based on
cosine similarity – average higher than a certain threshold; 0.30, 0.40, 0.60 and 0.80
respectively for Dutch, English, Greek and Spanish languages.
      </p>
      <p>By contrast, PAN2016 necessitates this comparison of all possible pairs of
documents (optimizations may subsequently be identified) in order to create the
unknown number of clusters representing the unknown number of authors per
problem for the known number of documents. Our similarity scores between
document pairs can be used for the ranking part of the task, with a threshold used to
be selective over those which appear in ranking. Pairs which remain in the rankings
are all above threshold and reported as clusters, with a minimum of 2 members,
created by collecting and flattening ranked pairs with documents in common (e.g.
[a,b], [b,c], [b,d], [a,e]  [a, b, c, d, e]); those that are not ranked are reported as
singletons (clusters with a single member). Following some bug-fixing of the
clustering, and a small number of trials with the training dataset, we used 0.5 as the
threshold for all three languages. Due to lack of time we were unable to evaluate in
any significant ways the results that could be achieved by refining this threshold,
applying our prior – or new – approaches, or evaluating feature set reduction as tried
successfully in previous years, and these would all offer potential for future
experimental work.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>Results for each of the training and test collection of PAN 2016 are shown in the
tables below based on the evaluation metrics being used. We present these only for
the purpose of documenting the results, and reserve interpretation due to the absence
of knowledge of performance of other systems as would assist us in contextualization.</p>
      <p>In this paper, we discussed the adaptation of one of our approaches to a PAN 2016
problem of author clustering, and the contrast of this task to earlier tasks as might be
conceived as author classification. Because of our participation in previous tasks, and
approaches taken there, the changes we needed to make – largely around ingesting
data and similarity score processing – were relatively minimal. However, the timing
of a number of other priority efforts brought substantial limitations to the effort we
were able to dedicate to this task, in contrast to that which we would have liked to
dedicate, and because of this we do not expect that the results obtained to be
particularly remarkable.</p>
      <p>The authors gratefully acknowledge both the efforts and patience of the PAN
organizers in crafting and managing the task and the prior support from EPSRC/JISC
(EP/I034408/1), the UK’s Technology Strategy Board, now InnovateUK (TSB,
169201), HEFCE/Innovate UK through SETsquared, and the UK government.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Daelemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Verhoeven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Juola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>López-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          .
          <article-title>"Overview of the Author Identification Task at PAN 2015"</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          , and San Juan, E., editors.
          <source>CLEF 2015 Labs and Workshops, Notebook Papers. CEUR Workshop Proceedings (CEUR-WS.org)</source>
          ,
          <source>ISSN 1613-0073</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Vartapetiance</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Gillam</surname>
          </string-name>
          , “
          <article-title>Quite Simple Approaches for Authorship Attribution , Intrinsic Plagiarism Detection</article-title>
          and
          <string-name>
            <surname>Sexual Predator</surname>
          </string-name>
          Identification - Notebook
          <source>for PAN at CLEF</source>
          <year>2012</year>
          ,” in
          <source>Working Notes Papers of the CLEF 2012 Evaluation Labs</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>A.</given-names>
            <surname>Vartapetiance</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Gillam</surname>
          </string-name>
          , “
          <article-title>A Trinity of Trials : Surrey's 2014 Attempts at</article-title>
          Author Verification - Notebook
          <source>for PAN at CLEF</source>
          <year>2014</year>
          ,” Work. Notes Pap.
          <source>CLEF 2014 Eval. Labs</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Vartapetiance</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Gillam</surname>
          </string-name>
          ,
          <article-title>"Adapting for Subject-Specific Term Length using Topic Cost in Author Verification - Notebook for PAN at CLEF 2015"</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          , and San Juan, E., editors (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verhoeven</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Clustering by Authorship Within and Across Documents</article-title>
          .
          <source>In: Working Notes Papers of the CLEF 2016 Evaluation Labs. CEUR Workshop Proceedings, CLEF and CEUR-WS.org (Sep</source>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Church</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanks</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Word Association Norms,
          <source>Mutual Information and Lexicography</source>
          .
          <source>Computational Linguistics</source>
          , vol.
          <volume>16</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>22</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>