<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-018-04-0532</article-id>
      <article-id pub-id-type="publisher-id">23084</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>H.2 - DATABASE MANAGEMENT</subject>
          <subject>H.3.7 - Digital Libraries</subject>
          <subject>H.5.4 - Hypertext/Hypermedia</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Social Network Based Reputation Computation and Document Classification</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Lee</surname>
            <given-names>Joo Young</given-names>
          </name>
          <email xlink:type="simple">jlee150@syr.edu</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Duan</surname>
            <given-names>Yue</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Oh</surname>
            <given-names>Jae C.</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Du</surname>
            <given-names>Wenliang</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Blair</surname>
            <given-names>Howard</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Wang</surname>
            <given-names>Lusha</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Jin</surname>
            <given-names>Xing</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Syracuse University, Syracuse, United States of America</addr-line>
        <institution>Syracuse University</institution>
        <addr-line content-type="city">Syracuse</addr-line>
        <country>United States of America</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Joo Young Lee (<email xlink:type="simple">jlee150@syr.edu</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2012</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>02</month>
        <year>2012</year>
      </pub-date>
      <volume>18</volume>
      <issue>4</issue>
      <fpage>532</fpage>
      <lpage>553</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/4B2357CA-9BAB-56C7-B11A-65DD458CC812">4B2357CA-9BAB-56C7-B11A-65DD458CC812</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5504981">5504981</uri>
      <history>
        <date date-type="received">
          <day>30</day>
          <month>09</month>
          <year>2011</year>
        </date>
        <date date-type="accepted">
          <day>14</day>
          <month>12</month>
          <year>2011</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Joo Young Lee, Yue Duan, Jae C. Oh, Wenliang Du, Howard Blair, Lusha Wang, Xing Jin</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>We develop two social network based algorithms that automatically compute author reputation from a collection of textual documents. We first extract keyword reference behaviors of the authors to construct a social network, which represents relationships among the authors in terms of information reference behavior. With this network, we apply the two algorithms: the first computes each author's reputation value considering only direct reference and the second utilizes indirect reference recursively. We compare the reputation values computed by the two algorithms and reputation ratings given by a human domain expert. We further evaluate the algorithms in email categorization tasks by comparing them with machine learning techniques. Finally, we analyse the social network through a community detection algorithm and other analysis techniques. We observed several interesting phenomena including the network being scale-free and having a negative assortativity.</p>
      </abstract>
    </article-meta>
  </front>
</article>
