IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6641242.html
   My bibliography  Save this article

The Ranking Prediction of NBA Playoffs Based on Improved PageRank Algorithm

Author

Listed:
  • Fan Yang
  • Jun Zhang
  • Wei Wang

Abstract

It is of great significance to predict the results accurately based on the statistics of sports competition for participants research, commercial cooperation, advertising, and gambling profit. Aiming at the phenomenon that the PageRank page sorting algorithm is prone to subject deviation, the category similarity between pages is introduced into the PageRank algorithm. In the PR value calculation formula of the PageRank algorithm, the factor W(u, v) between pages is added to replace the original Nu (the number of links to page u). In this way, the content category between pages is considered, and the shortcoming of theme deviation will be improved. The time feedback factor in the PageRank-time algorithm is used for reference, and the time feedback factor is added to the first improved PR value calculation formula. Based on statistics from 1230 games during the NBA 2018-2019 regular season, this paper ranks the team strength with improved PageRank algorithm and compares the results with the ranking of regular-season points and the result of playoffs. The results show that it is consistent with the regular-season points ranking in the eastern division by the use of improved PageRank algorithm, but there is a difference in the second ranking in the western division. In the prediction of top four in playoffs, it predicts three of the four teams.

Suggested Citation

  • Fan Yang & Jun Zhang & Wei Wang, 2021. "The Ranking Prediction of NBA Playoffs Based on Improved PageRank Algorithm," Complexity, Hindawi, vol. 2021, pages 1-10, February.
    • Handle: RePEc:hin:complx:6641242
    DOI: 10.1155/2021/6641242
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6641242.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2021/6641242.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/6641242?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6641242. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.