<?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.3897/jucs.99169</article-id>
      <article-id pub-id-type="publisher-id">99169</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>Topic E - Data</subject>
          <subject>Topic M - Knowledge Management</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Topological Similarity and Centrality Driven Hybrid Deep Learning for Temporal Link Prediction</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Sserwadda</surname>
            <given-names>Abubakhari</given-names>
          </name>
          <uri content-type="orcid">https://orcid.org/0000-0001-9150-5298</uri>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Ozcan</surname>
            <given-names>Alper</given-names>
          </name>
          <email xlink:type="simple">alper.ozcan@gmail.com</email>
          <uri content-type="orcid">https://orcid.org/0000-0002-5999-1203</uri>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Yaslan</surname>
            <given-names>Yusuf</given-names>
          </name>
          <uri content-type="orcid">https://orcid.org/0000-0001-8038-948X</uri>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Istanbul Technical University, Istanbul, Turkiye</addr-line>
        <institution>Istanbul Technical University</institution>
        <addr-line content-type="city">Istanbul</addr-line>
        <country>Turkiye</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">Akdeniz University, Antalya, Turkiye</addr-line>
        <institution>Akdeniz University</institution>
        <addr-line content-type="city">Antalya</addr-line>
        <country>Turkiye</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Alper Ozcan (<email xlink:type="simple">alper.ozcan@gmail.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2023</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>05</month>
        <year>2023</year>
      </pub-date>
      <volume>29</volume>
      <issue>5</issue>
      <fpage>470</fpage>
      <lpage>490</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/F94953BC-9599-5579-AEBF-557828F3C472">F94953BC-9599-5579-AEBF-557828F3C472</uri>
      <history>
        <date date-type="received">
          <day>22</day>
          <month>12</month>
          <year>2022</year>
        </date>
        <date date-type="accepted">
          <day>28</day>
          <month>03</month>
          <year>2023</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Abubakhari Sserwadda, Alper Ozcan, Yusuf Yaslan</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by-nd/4.0/" xlink:type="simple">
          <license-p>This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY-ND 4.0). This license allows reusers to copy and distribute the material in any medium or format in unadapted form only, and only so long as attribution is given to the creator. The license allows for commercial use.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Several real-world phenomena, including social, communication, transportation, and biological networks, can be efficiently expressed as graphs. This enables the deployment of graph algorithms to infer information from such complex network interactions to enhance graph applications’ accuracy, including link prediction, node classification, and clustering. However, the large size and complexity of the network data limit the efficiency of the learning algorithms in making decisions from such graph datasets. To overcome these limitations, graph embedding techniques are usually adopted. However, many studies not only assume static networks but also pay less attention to preserving the network topological and centrality information, which information is key in analyzing networks. In order to fill these gaps, we propose a novel end-to-end unified <u><strong>T</strong></u>opological <u><strong>S</strong></u>imilarity and <u><strong>C</strong></u>entrality driven Hybrid Deep Learning model for <u><strong>T</strong></u>emporal <u><strong>L</strong></u>ink <u><strong>P</strong></u>rediction (TSC-TLP). First, we extract topological similarity and centrality-based features from the raw networks. Next, we systematically aggregate these topological and centrality features to act as inputs for the encoder. In addition, we leverage the long short-term memory (LSTM) layer to learn the underlying temporal information in the graph snapshots. Lastly, we impose topological similarity and centrality constraints on the model learning to enforce preserving of topological structure and node centrality role of the input graphs in the learned embeddings. The proposed TSC-TLP is tested on 3 real-world temporal social networks. On average, it exhibits a 4% improvement in link prediction accuracy and a 37% reduction in MSE on centrality prediction over the best benchmark.</p>
      </abstract>
    </article-meta>
  </front>
</article>
