Research on Markov chain and PageRank algorithm

Tingyuan Kan

doi:10.1117/12.2626809

21 December 2021 Research on Markov chain and PageRank algorithm

Tingyuan Kan

Proceedings Volume 12156, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2021); 121560P (2021) https://doi.org/10.1117/12.2626809
Event: International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2021), 2021, Sanya, China

Abstract

The rapid growth of the amount of information on the Internet makes web search technology become the main means for people to obtain information. How to measure the importance of web pages efficiently and quickly has become an important topic, and has different degrees of influence on all aspects of the web page, such as web crawling, web page grading and ranking. This paper discusses an important algorithm–PageRank, based on Markov chain model then a discussion of the advantages and disadvantages of PageRank is provided here. Finally, according to the drawbacks, some corrections and improvements are also discussed in this paper.

Citation Download Citation

Tingyuan Kan "Research on Markov chain and PageRank algorithm", Proc. SPIE 12156, International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2021), 121560P (21 December 2021); https://doi.org/10.1117/12.2626809

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available