Skip to main content
Log in

Research on Optimization of PageRank Algorithm Based on Transition Probability

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In the current era of information explosion, information search has become the focus of research, and search engines generally use PageRank algorithm to sort web-page. Based on the situation, this paper starts with rules of PageRank algorithm, and aims at optimizing PR value problem of link page average allocation. After that, this paper carries on discriminant analysis to the probability of web-page randomly jump to any page with the probability of residual damping coefficient, and assigns the PR value according to number of downstream pages linked to specified page, namely, improving accuracy of the algorithm by optimizing transition probability matrix in the PageRank algorithm. Finally, we prove that optimized algorithm has improved accuracy of PageRank distribution, and is superior to traditional algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Liu, C., & Li, Y. (2015). A parallel PageRank algorithm with power iteration acceleration. International Journal of Grid & Distributed Computing, 8(1), 55–61.

    Article  Google Scholar 

  2. Mitliagkas, I., Borokhovich, M., Dimakis, A. G., et al. (2015). FrogWild!—Fast PageRank approximations on graph engines. Computer Science, 8(8), 874–885.

    Google Scholar 

  3. Chen, G., Siyang, L. I., Zhang, F., et al. (2016). Research on optimization of PageRank algorithm based on forestry theme. Journal of Natural Science of Heilongjiang University, 2(1), 56–61.

    Google Scholar 

  4. Xiangming, Q. I., Sun, W., & University, L. T. (2017). Research on PageRank algorithm based on multi-feature factor fusion. Computer Engineering & Applications, 2(6), 60–61.

    Google Scholar 

  5. Wang, C., & Wang, K. (2017). PageRank algorithm based on aggregation of users feedback characteristics. Computer Engineering & Design, 5(6), 22–24.

    Google Scholar 

  6. Li, H., Mu, L., & Zan, H. (2016). Computation of word similarity based on the information content of Sememes and PageRank algorithm, 5(4), 132–133.

    Google Scholar 

  7. Koketsu, T., Yanagimoto, H., & Yoshioka, M. (2015). Access log analysis with PageRank. IEEJ Transactions on Electronics Information & Systems, 98(9), 23–30.

    Google Scholar 

  8. Xie, W., Bindel, D., Demers, A., et al. (2015). Edge-weighted personalized PageRank: Breaking a decade-old performance barrier, 9(1), 1325–1334.

    Google Scholar 

  9. Zhang, J., Tang, J., Ma, C., et al. (2015). Panther: Fast top-k similarity search on large networks. Computer Science, 8(1), 1445–1454.

    Google Scholar 

  10. Banerjee, S., & Lofgren, P. (2015). Fast bidirectional probability estimation in Markov models. Computer Science, 48(1), 276–307.

    Google Scholar 

Download references

Acknowledgements

Support by Chongqing Big Data Engineering Laboratory for Children, Chongqing Electronics Engineering Technology Research Center for Interactive Learning and Scientific and Technological Research Program of Chongqing Municipal Education Commission (Grant No. KJ1714355).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xi Shi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, X., Wei, P. & Zhou, Z. Research on Optimization of PageRank Algorithm Based on Transition Probability. Wireless Pers Commun 102, 1171–1180 (2018). https://doi.org/10.1007/s11277-017-5173-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-5173-4

Keywords

Navigation