Improving the DeepWalk Algorithm for Link Prediction In Social Networks

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.

Mahmoodzadeh Paria; Rezvanian Alireza

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2024 | Issue:10

Download Full-Text

View:

Download:

Information Seminar Paper

Title

Improving the DeepWalk Algorithm for Link Prediction In Social Networks

Author(s)

Mahmoodzadeh Paria | Rezvanian Alireza

Keywords

Social network analysis

Link prediction

Graph embedding

Representation learning

Random walk

Abstract

The increasing growth of social networks has drawn researchers' attention to Link prediction, and it has been used in many fields, including computer science, information science, and anthropology. One of the newest Link prediction methods is Graph embedding methods, which are used to generate a feature vector for each node of the graph and find unknown links. The DeepWalk algorithm is one of the most popular Graph embedding methods that captures the network structure using a Random walk with equal probability. In this paper, a modified version of the DeepWalk algorithm is proposed, which uses a new Random walk model to solve the Link prediction problem. In fact, in the proposed method, the amount of structural similarity and the similarity of important features of nodes are combined. The results show that two nodes are more likely to form a link if they have similar structure and important features. To evaluate the proposed method, experiments have been conducted on five datasets. The test results indicate a relative improvement in the results obtained.

Cites

No record.

References

No record.

Cite

APA: Copy

Mahmoodzadeh, Paria, & Rezvanian, Alireza. (2024). Improving the DeepWalk Algorithm for Link Prediction In Social Networks. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/1147656/en

Vancouver: Copy

Mahmoodzadeh Paria, Rezvanian Alireza. Improving the DeepWalk Algorithm for Link Prediction In Social Networks. 2024. Available from: https://sid.ir/paper/1147656/en

IEEE: Copy

Paria Mahmoodzadeh, and Alireza Rezvanian, “Improving the DeepWalk Algorithm for Link Prediction In Social Networks,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2024, [Online]. Available: https://sid.ir/paper/1147656/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops