Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A new similarity-based link prediction algorithm based on combination of network topological features

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 3 (2022)

DOI
10.11591/ijece.v12i3.pp2802-2811
ISSN
2722-2578, 2088-8708
Published
2022-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

In recent years, the study of social networks and the analysis of these networks in various fields have grown significantly. One of the most widely used fields in the study of social networks is the issue of link prediction, which has recently been very popular among researchers. A link in a social network means communication between members of the network, which can include friendships, cooperation, writing a joint article or even membership in a common place such as a company or club. The main purpose of link prediction is to investigate the possibility of creating or deleting links between members in the future state of the network using the analysis of its current state. In this paper, three new similarities, degree neighbor similarity (DNS), path neighbor similarity (PNS) and degree path neighbor Similarity (DPNS) criteria are introduced using neighbor-based and path-based similarity criteria, both of which use graph structures. The results have been tested based on area under curve (AUC) and precision criteria on datasets and it shows well the superiority of the work over the criteria that only use the neighbor or the path.

Collaboration network of the authors

3 authors · 3 co-authorship links · 2 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Islamic Azad University, Tehran
  • Shiraz University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A new similarity-based link prediction algorithm based on combination of network topological features</dc:title><dc:creator>Saeidinezhad, Hasan</dc:creator><dc:creator>Parvinnia, Elham</dc:creator><dc:creator>Boostani, Reza</dc:creator><dc:description>&lt;jats:p&gt;In recent years, the study of social networks and the analysis of these networks in various fields have grown significantly. One of the most widely used fields in the study of social networks is the issue of link prediction, which has recently been very popular among researchers. A link in a social network means communication between members of the network, which can include friendships, cooperation, writing a joint article or even membership in a common place such as a company or club. The main purpose of link prediction is to investigate the possibility of creating or deleting links between members in the future state of the network using the analysis of its current state. In this paper, three new similarities, degree neighbor similarity (DNS), path neighbor similarity (PNS) and degree path neighbor Similarity (DPNS) criteria are introduced using neighbor-based and path-based similarity criteria, both of which use graph structures. The results have been tested based on area under curve (AUC) and precision criteria on datasets and it shows well the superiority of the work over the criteria that only use the neighbor or the path.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i3.pp2802-2811</dc:identifier><dc:identifier>10.11591/ijece.v12i3.pp2802-2811</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 3 (2022); 2802</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/25385/15657</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>