themify-updater
domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init
action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home/worldrg6/public_html/wordpress/wp-includes/functions.php on line 6121themify
domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init
action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home/worldrg6/public_html/wordpress/wp-includes/functions.php on line 6121Hi all! I wanted to statistically compare Stopgamov\u2019s grades with some big data-how they relate? Is there interdependence? Is it possible to do this at all?<\/p>\n
I bring to your attention a small study that did not set high goals and objectives, but was done mainly on jokes.<\/p>\n
First you need to assemble a base of games with which we will further have fun.<\/p>\n
Information from the page with the distribution of all reviews for grades must be brought into a boring table view. Total 73 pages, on average of 30 games on each – this is 2 190 games. Suppose two minutes to reprint the names manually and rest – this is 73 hours!<\/p>\n
Something else is needed. At the end of each title with a review, it is written \u201cReview\u201d, which prompted the idea – you can open the page code, copy it to the exel (it looks terrible, but I can\u2019t do anything else), and filter the lines where this is the same \u201cReview\u201d. No sooner said than done. Some pathetic 40 minutes later the base of Stopgamov’s assessments appeared.<\/p>\n
Now you need to find what to compare grades with. In Reddte, a post was found in which someone posted a huge file with the Game Rankings rating database before closing (the site itself is now a strike on metacritic). The file dates from December 2019., So a year and a half of new games will have to be missed.<\/p>\n
As a result, 1,287 games released in 2010\u20132019 were gained.<\/p>\n
Visualization of the received data. 1. Distribution of points for assessment of SG. Dependence is visible, and the median (read: average) score grows for each assessment. 2. Distribution of pieces of games in points and estimates. Critics are clearly supportive, most of the assessments between 70-80 points. 3. Dry statistics. 4. Just a screen of how the base looks like.<\/p>\n
Visualization of the received data. 1. Distribution of points for assessment of SG. Dependence is visible, and the median (read: average) score grows for each assessment. 2. Distribution of pieces of games in points and estimates. Critics are clearly supportive, most of the assessments between 70-80 points. 3. Dry statistics. 4. Just a screen of how the base looks like.<\/p>\n
Visualization of the received data. 1. Distribution of points for assessment of SG. Dependence is visible, and the median (read: average) score grows for each assessment. 2. Distribution of pieces of games in points and estimates. Critics are clearly supportive, most of the assessments between 70-80 points. 3. Dry statistics. 4. Just a screen of how the base looks like.<\/p>\n
Visualization of the received data. 1. Distribution of points for assessment of SG. Dependence is visible, and the median (read: average) score grows for each assessment. 2. Distribution of pieces of games in points and estimates. Critics are clearly supportive, most of the assessments between 70-80 points. 3. Dry statistics. 4. Just a screen of how the base looks like.<\/p>\n
For a scientifically based approach to the analysis of relationships, we use multinomy logistics regression.<\/p>\n
Regression analysis examines the statistical connection between one dependent variable and (one or more) independent and shows the presence or absence of communication, its strength, then allows you to make the forecast of one of the variables, knowing the others. For example, having studied the relationship of the age of the player and the clock spent behind the compacter per day, you can estimate the number of hours for any age in general (of course, with a bunch of nuances that we will not) about).<\/p>\n
The most common regression is linear, which explores the relationship between numerical variables. In our case, the dependence between the score of the game and the assessments of the SG, which are non -layered and can only be four types are investigated. Therefore, linear regression is not suitable for us, we need logistics, which takes into account non -layer variables.<\/p>\n
We load our table into a statup and for some kind of 28 lines of code, we get a statistically significant regression that conducted the analysis of the loaded base and revealed interdependence between the estimates of the SG and the games of the game. For clarity, I deduced the model probability of a particular assessment of the SG depending on the critics score.<\/p>\n
The probability of each SG assessment for each critics score. For example, the blue sector is an assessment of “garbage”. With the growth of the game point, the probability of \u201cgarbage\u201d is reduced, because the quality of the game is growing. And the game with 72 points is most likely (the probability of 63%) will receive “commendable”.<\/p>\n
There is a positive relationship between the assessment of SG and the score of the game – the better the assessment, the higher the average score (who would doubt).<\/p>\n
In general, critics of most games assign points between 70 and 80. In this range, the probability of \u201ccommendable\u201d is 66%, \u201camazing\u201d – 19%, \u201cPropriknika\u201d – 12%. That’s what we have so many “commendable” games.<\/p>\n
And, it seems to me, the most interesting. If we assume that \u201cgarbage\u201d and \u201cpassage\u201d are generally \u201cbad\u201d games, and the rest are \u201cgood\u201d, then the probability of any unknown game is \u201cbad\u201d-51% (respectively, \u201cgood\u201d-49%). Almost perfect balance of Stopheim objectivity! But then Stopgame favors the developers – \u201cbad\u201d will receive \u201cgarbage\u201d with a probability of 34%, and \u201cgood\u201d will receive \u201camazingly\u201d with 41%.<\/p>\n
The most important thing is that the assessments of Stopheim are in their own mass are good and the opinion of critics is consistent with them, almost scientifically proven \ud83d\ude42<\/p>\n
This is perhaps all and all. Thank you for being with us, I hope someone was interested.<\/p>\n
The study used Excel, Rstudio, Power Bi, Chrome and Black Tea.<\/i> <\/p>\nThe best comments<\/h2>\n
The first seems like a comment<\/p>\n
\nIt is more difficult with good unknown – you need to look at why they do not fall into the review.<\/p>\n<\/blockquote>\n
So because unknown) <\/p>\n
And you can just ask Dotterian in a couple of minutes to collect any statistics directly from the database. : D<\/p>\n
\nTotal 73 pages, on average of 30 games on each – this is 2 190 games. Suppose two minutes to reprint the names manually and rest – this is 73 hours!<\/p>\n<\/blockquote>\n
I have this part in the article raised the most questions. I, and so, Syak, and such a way tried to imagine it, but did not understand how to write off the names of the games and their assessments for an hour.<\/p>\n
Two minutes – this is one game? O_O<\/p>\n
(Right now I will \u201cvoice into the air\u201d to voice plans to solve the problem of transferring information to the table) <\/p>\n
Firstly, if there is a skill of speed (or a friend with it), you can cooperate with the other and: he reads aloud to you the name of the game and an assessment, you write down. In this case, well, by a couple of minutes to go to the page. Moreover, if the names of the games, obviously, need to be recorded completely, then the estimates can easily be reduced to \u201craisins\u201d, \u201cphv\u201d, \u201czh\u201d, \u201cmus\u201d (but there is such a saving in presses, of course). Ultimatically – \u201cgarbage\u201d change to \u201c1\u201d, \u201craisins\u201d to \u201c4\u201d. <\/p>\n