An Improved New Link Prediction Method in Social Multilplex Networks Based on the Gravitational Search Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GOLSHAHI F.; Torghi Haghighat A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2020 | Volume:8 | Issue:2 (30) Page(s): 15-24

Download Full-Text

Persian Verion

View:

443

Download:

Cites:

Information Journal Paper

Title

An Improved New Link Prediction Method in Social Multilplex Networks Based on the Gravitational Search Algorithm

Author(s)

GOLSHAHI F. | Torghi Haghighat A. | Issue Writer Certificate

Keywords

Link PredictionQ1

Multiplex NetworksQ1

Social Network AnalysisQ1

Static AnalysisQ1

Abstract

The analysis of large scale dynamic networks provides useful information for the network administrator. This plays an important role in modern societies. The prediction of missing links or possible links in the future is an important and interesting issue on social networks that can support important applications with features such as new recommendations for users, friendship suggestions, and discovery of forged connections. Many real-world social networks display communications in multi-layers (for example, several social networking platforms). In this research, the problem of Link Prediction in multiple networks has been studied and a new Link Prediction method in Multiplex Networks, based on unsupervized graph structure and the gravitational search algorithms is presented. Different layers of the multiplex network have been used to increase the accuracy of the proposed method and we have presented a methodology that uses information from other layers and community information where people are associated. We have provided this information in the form of a rating. These privileges, in a way, determine the prediction of the edges between individuals in these types of networks. One of the criteria for comparing predictive algorithms is to calculate the AUC for these algorithms and using this criterion for comparison accompanied by a travian data set used as a benchmark, it is seen that the AUC of our method has improved 7% compared to Adamic which is a similar method. The results demonstrate that using community information and the gravitational algorithm in layered networks improves Link Prediction.

Cites

No record.

References

No record.

Cite

APA: Copy

GOLSHAHI, F., & Torghi Haghighat, A.. (2020). An Improved New Link Prediction Method in Social Multilplex Networks Based on the Gravitational Search Algorithm. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 8(2 (30) ), 15-24. SID. https://sid.ir/paper/385526/en

Vancouver: Copy

GOLSHAHI F., Torghi Haghighat A.. An Improved New Link Prediction Method in Social Multilplex Networks Based on the Gravitational Search Algorithm. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2020;8(2 (30) ):15-24. Available from: https://sid.ir/paper/385526/en

IEEE: Copy

F. GOLSHAHI, and A. Torghi Haghighat, “An Improved New Link Prediction Method in Social Multilplex Networks Based on the Gravitational Search Algorithm,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 8, no. 2 (30) , pp. 15–24, 2020, [Online]. Available: https://sid.ir/paper/385526/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops