scholarly journals The Ranking Prediction of NBA Playoffs Based on Improved PageRank Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Fan Yang ◽  
Jun Zhang
Keyword(s):  
Time Algorithm ◽  
Sorting Algorithm ◽  
Calculation Formula ◽  
Content Category ◽  
Feedback Factor ◽  
Pagerank Algorithm ◽  
Western Division

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.

A CONSTANT TIME SORTING ALGORITHM FOR A THREE DIMENSIONAL RECONFIGURABLE MESH AND RECONFIGURABLE NETWORK

1995 ◽  
Vol 05 (03) ◽  
pp. 401-412 ◽  
Author(s):  
MARK S. MERRY ◽  
JOHNNIE BAKER
Keyword(s):  
Computer Science ◽  
Real Number ◽  
Three Dimensional ◽  
Time Algorithm ◽  
Constant Time ◽  
Sorting Algorithm ◽  
Compression Algorithms ◽  
Reconfigurable Mesh ◽  
Integer Sorting ◽  
Time Selection

Sorting techniques have numerous applications in computer science. Current real number and integer sorting techniques for the reconfigurable mesh operate in constant time using a reconfigurable mesh of size n × n to sort n numbers. This paper presents a constant time algorithm to sort n items on a reconfigurable network with [Formula: see text] switches and [Formula: see text] processors. Also, new constant time selection and compression algorithms are given. All results may also be implemented on the 3-D reconfigurable mesh.

Cognitive Processing of Film Cuts Among 4- to 8-Year-Old Children

2012 ◽  
Vol 17 (4) ◽  
pp. 257-265 ◽  
Author(s):  
Carmen Munk ◽  
Günter Daniel Rey ◽  
Anna Katharina Diergarten ◽  
Gerhild Nieding ◽  
Wolfgang Schneider ◽  
...  
Keyword(s):  
Eye Movements ◽  
Cognitive Processing ◽  
Media Literacy ◽  
Age Groups ◽  
Reaction Times ◽  
Time Span ◽  
Short Film ◽  
Calculation Formula ◽  
Eye Tracker ◽  
Chronological Sequence

An eye tracker experiment investigated 4-, 6-, and 8-year old children’s cognitive processing of film cuts. Nine short film sequences with or without editing errors were presented to 79 children. Eye movements up to 400 ms after the targeted film cuts were measured and analyzed using a new calculation formula based on Manhattan Metrics. No age effects were found for jump cuts (i.e., small movement discontinuities in a film). However, disturbances resulting from reversed-angle shots (i.e., a switch of the left-right position of actors in successive shots) led to increased reaction times between 6- and 8-year old children, whereas children of all age groups had difficulties coping with narrative discontinuity (i.e., the canonical chronological sequence of film actions is disrupted). Furthermore, 4-year old children showed a greater number of overall eye movements than 6- and 8-year old children. This indicates that some viewing skills are developed between 4 and 6 years of age. The results of the study provide evidence of a crucial time span of knowledge acquisition for television-based media literacy between 4 and 8 years.

An Adaptive Sorting Algorithm for Almost Sorted List

2017 ◽  
Vol 5 (12) ◽  
pp. 169-172
Author(s):  
Rina Damdoo ◽  
◽  
◽  
Kanak Kalyani
Keyword(s):  
Sorting Algorithm ◽  
Adaptive Sorting

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

Comparative Analysis and Implementation of Popular Sorting Algorithm

2019 ◽  
Author(s):  
Jatin Goel ◽  
Avnish Gupta ◽  
Nikhil Tripathi ◽  
Ravi Tomar ◽  
Tanupriya Choudhury
Keyword(s):  
Comparative Analysis ◽  
Sorting Algorithm
Sign in / Sign up

Export Citation Format

Share Document