<?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-023-03-0280</article-id>
      <article-id pub-id-type="publisher-id">23060</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.3.3 - Information Search and Retrieval</subject>
          <subject>I.2.2 - Automatic Programming</subject>
          <subject>I.2.7 - Natural Language Processing</subject>
          <subject>L.3.2 - Information Retrieval and Search</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>On Predicting Election Results using Twitter and Linked Open Data: The Case of the UK 2010 Election</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Kalampokis</surname>
            <given-names>Evangelos</given-names>
          </name>
          <email xlink:type="simple">ekal@uom.gr</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Karamanou</surname>
            <given-names>Areti</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Tambouris</surname>
            <given-names>Efthimios</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Tarabanis</surname>
            <given-names>Konstantinos</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">University of Macedonia, Thessaloniki, Greece</addr-line>
        <institution>University of Macedonia</institution>
        <addr-line content-type="city">Thessaloniki</addr-line>
        <country>Greece</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Evangelos Kalampokis (<email xlink:type="simple">ekal@uom.gr</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2017</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>03</month>
        <year>2017</year>
      </pub-date>
      <volume>23</volume>
      <issue>3</issue>
      <fpage>280</fpage>
      <lpage>303</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/34347621-C8C1-51BA-BA9D-9310C95BB7D2">34347621-C8C1-51BA-BA9D-9310C95BB7D2</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5504955">5504955</uri>
      <history>
        <date date-type="received">
          <day>15</day>
          <month>09</month>
          <year>2016</year>
        </date>
        <date date-type="accepted">
          <day>01</day>
          <month>03</month>
          <year>2017</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Evangelos Kalampokis, Areti Karamanou, Efthimios Tambouris, Konstantinos Tarabanis</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>The analysis of Social Media data enables eliciting public behaviour and opinion. In this context, a number of studies have recently explored Social Media's capability to predict the outcome of real-world phenomena. The results of these studies are controversial with elections being the most disputable phenomenon. The objective of this paper is to present a case of predicting the results of the UK 2010 through Twitter. In particular, we study to what extend it is possible to use Twitter data to accurately predict the percentage of votes of the three most prominent political parties namely the Conservative Party, Liberal Democrats, and the Labour Party. The approach we follow capitalises on (a) a theoretical Social Media data analysis framework for predictions and (b) Linked Open Data to enrich Twitter data. We extensively discuss each step of the framework to emphasise on the details that could affect the prediction accuracy.We anticipate that this paper will contribute to the ongoing discussion of understanding to what extend and under which circumstances election results are predictable through Social Media.</p>
      </abstract>
    </article-meta>
  </front>
</article>
