Improving Random Walk Sampling, Inspired by Two Methods of Choosing Seed Node And No-Retracing With Combination of them with Page Rank 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.

Kheradbeygi Moghadam Ali; BASTANFARD AZAM

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2022 | Issue:8

Download Full-Text

View:

Download:

Information Seminar Paper

Title

Improving Random Walk Sampling, Inspired by Two Methods of Choosing Seed Node And No-Retracing With Combination of them with Page Rank Algorithm

Author(s)

Kheradbeygi Moghadam Ali | BASTANFARD AZAM

Keywords

Sampling

Network sampling

Classical Random Walk

Choosing Seed Node

No-Retracing

Page rank

Markov chain

Degree distribution

Average degree

Clustering coefficient

Complex networks

Abstract

One of the algorithms used for Sampling Complex networks is the Classical Random Walk algorithm, which has been considered due to its good performance. But speed and energy consumption can also be improved by reducing size of input data. In this study, two random walk algorithms inspired by two methods, Choosing Seed Node, and No-Retracing algorithm which obtained by changing the Classical Random Walk algorithm, and combining these three algorithms with google Page rank algorithm, are discussed. This is done to preserve important nodes and reduce the size of the input data. This Sampling was done from the United States flight network database. Also, important characteristics obtained in Sampling, such as Sampling efficiency, Degree distribution, Average degree, and average Clustering coefficient have been investigated. The algorithms studied in this research each have their own advantages and disadvantages. For example, the No-Retracing shows better performance in terms of time and average Clustering coefficient. This efficiency is even greater when we use a combination of No-Retracing algorithm with google Page ranking algorithm. These algorithms can be used when speed is important in decision making, such as deciding on airlines and public transportation, etc. These algorithms are also more energy efficient than the studied algorithms.

Video

Cites

No record.

References

No record.

Cite

APA: Copy

Kheradbeygi Moghadam, Ali, & BASTANFARD, AZAM. (2022). Improving Random Walk Sampling, Inspired by Two Methods of Choosing Seed Node And No-Retracing With Combination of them with Page Rank Algorithm. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949638/en

Vancouver: Copy

Kheradbeygi Moghadam Ali, BASTANFARD AZAM. Improving Random Walk Sampling, Inspired by Two Methods of Choosing Seed Node And No-Retracing With Combination of them with Page Rank Algorithm. 2022. Available from: https://sid.ir/paper/949638/en

IEEE: Copy

Ali Kheradbeygi Moghadam, and AZAM BASTANFARD, “Improving Random Walk Sampling, Inspired by Two Methods of Choosing Seed Node And No-Retracing With Combination of them with Page Rank Algorithm,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2022, [Online]. Available: https://sid.ir/paper/949638/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops