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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.