andrew_gelman_stats andrew_gelman_stats-2010 andrew_gelman_stats-2010-218 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500?), the action always gets concentrated on one part of the board. Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift.
sentIndex sentText sentNum sentScore
1 I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. [sent-1, score-1.591]
2 In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500? [sent-2, score-0.634]
3 ), the action always gets concentrated on one part of the board. [sent-3, score-0.867]
4 Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift. [sent-4, score-1.649]
wordName wordTfidf (topN-words)
[('games', 0.355), ('action', 0.35), ('board', 0.347), ('grandmaster', 0.294), ('concentrated', 0.219), ('chess', 0.21), ('suddenly', 0.196), ('rating', 0.194), ('squares', 0.183), ('meanwhile', 0.173), ('shift', 0.171), ('players', 0.17), ('guessing', 0.158), ('newspaper', 0.155), ('implications', 0.154), ('focused', 0.153), ('reminded', 0.147), ('playing', 0.147), ('game', 0.146), ('places', 0.14), ('entire', 0.133), ('gets', 0.114), ('course', 0.083), ('part', 0.079), ('best', 0.079), ('particular', 0.077), ('always', 0.076), ('something', 0.057), ('use', 0.057), ('good', 0.048), ('get', 0.041), ('would', 0.032), ('like', 0.032), ('one', 0.029)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 218 andrew gelman stats-2010-08-20-I think you knew this already
Introduction: I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500?), the action always gets concentrated on one part of the board. Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift.
2 0.25566185 1847 andrew gelman stats-2013-05-08-Of parsing and chess
Introduction: Gary Marcus writes , An algorithm that is good at chess won’t help parsing sentences, and one that parses sentences likely won’t be much help playing chess. That is soooo true. I’m excellent at parsing sentences but I’m not so great at chess. And, worse than that, my chess ability seems to be declining from year to year. Which reminds me: I recently read Frank Brady’s much lauded Endgame , a biography of Bobby Fischer. The first few chapters were great, not just the Cinderella story of his steps to the world championship, but also the background on his childhood and the stories of the games and tournaments that he lost along the way. But after Fischer beats Spassky in 1972, the book just dies. Brady has chapter after chapter on Fisher’s life, his paranoia, his girlfriends, his travels. But, really, after the chess is over, it’s just sad and kind of boring. I’d much rather have had twice as much detail on the first part of the life and then had the post-1972 era compr
3 0.19594865 615 andrew gelman stats-2011-03-16-Chess vs. checkers
Introduction: Mark Palko writes : Chess derives most of its complexity through differentiated pieces; with checkers the complexity comes from the interaction between pieces. The result is a series of elegant graph problems where the viable paths change with each move of your opponent. To draw an analogy with chess, imagine if moving your knight could allow your opponent’s bishop to move like a rook. Add to that the potential for traps and manipulation that come with forced capture and you have one of the most remarkable games of all time. . . . It’s not unusual to hear masters of both chess and checkers (draughts) to admit that they prefer the latter. So why does chess get all the respect? Why do you never see a criminal mastermind or a Bond villain playing in a checkers tournament? Part of the problem is that we learn the game as children so we tend to think of it as a children’s game. We focus on how simple the rules are and miss how much complexity and subtlety you can get out of those ru
4 0.17678609 1473 andrew gelman stats-2012-08-28-Turing chess run update
Introduction: In honor of the Olympics , I got my butt over to the park and played run-around-the-house chess for the first time ever. As was discussed in the comments thread awhile ago , there seem to be three possible ways to play Turing chess: 1. You make your move and run around the house. The other player has to move before you return. Once you sit down to the table, the other player runs around the house. Then you have to move, etc. You lose if you are checkmated or if you fail to move before your opponent returns to his chair. 2. You make your move and run around the house. The other player has to move before you return, but he does not have to wait until you return to start running. He can start running once he’s moved. Then when you get back you have to move before he gets back, but you can start to run once you’ve moved, etc. 3. You make your move and run around the house. The other player takes as long as he wants and makes his move, then he runs. When you return, yo
5 0.16231567 1638 andrew gelman stats-2012-12-25-Diving chess
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
6 0.13785729 1617 andrew gelman stats-2012-12-11-Math Talks :: Action Movies
7 0.13437843 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again
8 0.13404456 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball
9 0.11985324 1818 andrew gelman stats-2013-04-22-Goal: Rules for Turing chess
11 0.10515933 813 andrew gelman stats-2011-07-21-Scrabble!
12 0.10453079 2262 andrew gelman stats-2014-03-23-Win probabilities during a sporting event
13 0.093343914 216 andrew gelman stats-2010-08-18-More forecasting competitions
14 0.089141168 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
15 0.087500334 1547 andrew gelman stats-2012-10-25-College football, voting, and the law of large numbers
16 0.084897682 1260 andrew gelman stats-2012-04-11-Hunger Games survival analysis
17 0.083258107 462 andrew gelman stats-2010-12-10-Who’s holding the pen?, The split screen, and other ideas for one-on-one instruction
18 0.07954175 997 andrew gelman stats-2011-11-07-My contribution to the discussion on “Should voting be mandatory?”
19 0.077405207 1465 andrew gelman stats-2012-08-21-D. Buggin
20 0.074515112 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”
topicId topicWeight
[(0, 0.07), (1, -0.031), (2, -0.009), (3, 0.026), (4, 0.018), (5, 0.01), (6, 0.045), (7, 0.016), (8, 0.038), (9, -0.011), (10, 0.001), (11, 0.032), (12, -0.005), (13, -0.032), (14, -0.025), (15, -0.013), (16, 0.011), (17, -0.01), (18, 0.023), (19, -0.018), (20, -0.03), (21, 0.07), (22, 0.005), (23, 0.064), (24, 0.02), (25, 0.05), (26, 0.018), (27, 0.075), (28, -0.03), (29, -0.156), (30, 0.078), (31, -0.153), (32, -0.029), (33, 0.035), (34, 0.014), (35, -0.006), (36, -0.044), (37, 0.022), (38, 0.034), (39, 0.085), (40, 0.014), (41, 0.017), (42, 0.028), (43, -0.011), (44, -0.007), (45, -0.062), (46, 0.085), (47, -0.027), (48, 0.027), (49, 0.004)]
simIndex simValue blogId blogTitle
same-blog 1 0.95320588 218 andrew gelman stats-2010-08-20-I think you knew this already
Introduction: I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500?), the action always gets concentrated on one part of the board. Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift.
2 0.9238016 1638 andrew gelman stats-2012-12-25-Diving chess
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
3 0.9130584 615 andrew gelman stats-2011-03-16-Chess vs. checkers
Introduction: Mark Palko writes : Chess derives most of its complexity through differentiated pieces; with checkers the complexity comes from the interaction between pieces. The result is a series of elegant graph problems where the viable paths change with each move of your opponent. To draw an analogy with chess, imagine if moving your knight could allow your opponent’s bishop to move like a rook. Add to that the potential for traps and manipulation that come with forced capture and you have one of the most remarkable games of all time. . . . It’s not unusual to hear masters of both chess and checkers (draughts) to admit that they prefer the latter. So why does chess get all the respect? Why do you never see a criminal mastermind or a Bond villain playing in a checkers tournament? Part of the problem is that we learn the game as children so we tend to think of it as a children’s game. We focus on how simple the rules are and miss how much complexity and subtlety you can get out of those ru
4 0.86907947 1473 andrew gelman stats-2012-08-28-Turing chess run update
Introduction: In honor of the Olympics , I got my butt over to the park and played run-around-the-house chess for the first time ever. As was discussed in the comments thread awhile ago , there seem to be three possible ways to play Turing chess: 1. You make your move and run around the house. The other player has to move before you return. Once you sit down to the table, the other player runs around the house. Then you have to move, etc. You lose if you are checkmated or if you fail to move before your opponent returns to his chair. 2. You make your move and run around the house. The other player has to move before you return, but he does not have to wait until you return to start running. He can start running once he’s moved. Then when you get back you have to move before he gets back, but you can start to run once you’ve moved, etc. 3. You make your move and run around the house. The other player takes as long as he wants and makes his move, then he runs. When you return, yo
5 0.86854482 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again
Introduction: Here . (Background here .) P.S. Just a thought: is it possible that one reason for the effectiveness of relief pitchers is that, by the end of the game, the starting players (that is, the hitters who have been playing all game) are getting tired? I’m pretty sure that lots of baseball-statistics experts will know the answer to this.
6 0.85256505 1818 andrew gelman stats-2013-04-22-Goal: Rules for Turing chess
7 0.81847763 1847 andrew gelman stats-2013-05-08-Of parsing and chess
8 0.8095094 813 andrew gelman stats-2011-07-21-Scrabble!
9 0.75150633 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
10 0.66351259 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball
12 0.60577822 1903 andrew gelman stats-2013-06-17-Weak identification provides partial information
13 0.6008808 559 andrew gelman stats-2011-02-06-Bidding for the kickoff
14 0.58394915 216 andrew gelman stats-2010-08-18-More forecasting competitions
15 0.56893378 2262 andrew gelman stats-2014-03-23-Win probabilities during a sporting event
16 0.55493915 2267 andrew gelman stats-2014-03-26-Is a steal really worth 9 points?
17 0.54968703 881 andrew gelman stats-2011-08-30-Rickey Henderson and Peter Angelos, together again
18 0.52673167 562 andrew gelman stats-2011-02-06-Statistician cracks Toronto lottery
19 0.52050894 1113 andrew gelman stats-2012-01-11-Toshiro Kageyama on professionalism
20 0.51850587 634 andrew gelman stats-2011-03-29-A.I. is Whatever We Can’t Yet Automate
topicId topicWeight
[(4, 0.188), (9, 0.086), (16, 0.028), (21, 0.152), (24, 0.046), (54, 0.036), (63, 0.028), (89, 0.031), (90, 0.034), (99, 0.221)]
simIndex simValue blogId blogTitle
Introduction: Alexander at GiveWell writes : The Disease Control Priorities in Developing Countries (DCP2), a major report funded by the Gates Foundation . . . provides an estimate of $3.41 per disability-adjusted life-year (DALY) for the cost-effectiveness of soil-transmitted-helminth (STH) treatment, implying that STH treatment is one of the most cost-effective interventions for global health. In investigating this figure, we have corresponded, over a period of months, with six scholars who had been directly or indirectly involved in the production of the estimate. Eventually, we were able to obtain the spreadsheet that was used to generate the $3.41/DALY estimate. That spreadsheet contains five separate errors that, when corrected, shift the estimated cost effectiveness of deworming from $3.41 to $326.43. [I think they mean to say $300 -- ed.] We came to this conclusion a year after learning that the DCP2’s published cost-effectiveness estimate for schistosomiasis treatment – another kind of
same-blog 2 0.81799567 218 andrew gelman stats-2010-08-20-I think you knew this already
Introduction: I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500?), the action always gets concentrated on one part of the board. Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift.
3 0.80662405 238 andrew gelman stats-2010-08-27-No radon lobby
Introduction: Kaiser writes thoughtfully about the costs, benefits, and incentives for different policy recommendation options regarding a recent water crisis. Good stuff: it’s solid “freakonomics”–and I mean this in positive way: a mix of economic and statistical analysis, with assumptions stated clearly. Kaiser writes: Using the framework from Chapter 4, we should think about the incentives facing the Mass. Water Resources Authority: A false positive error (people asked to throw out water when water is clean) means people stop drinking tap water temporarily, perhaps switching to bottled water, and the officials claim victory when no one falls sick, and businesses that produce bottled water experience a jump in sales. It is also very difficult to prove a “false positive” when people have stopped drinking the water. So this type of error is easy to hide behind. A false negative error (people told it’s safe to drink water when water is polluted) becomes apparent when someone falls sick
4 0.80018318 151 andrew gelman stats-2010-07-16-Wanted: Probability distributions for rank orderings
Introduction: Dietrich Stoyan writes: I asked the IMS people for an expert in statistics of voting/elections and they wrote me your name. I am a statistician, but never worked in the field voting/elections. It was my son-in-law who asked me for statistical theories in that field. He posed in particular the following problem: The aim of the voting is to come to a ranking of c candidates. Every vote is a permutation of these c candidates. The problem is to have probability distributions in the set of all permutations of c elements. Are there theories for such distributions? I should be very grateful for a fast answer with hints to literature. (I confess that I do not know your books.) My reply: Rather than trying to model the ranks directly, I’d recommend modeling a latent continuous outcome which then implies a distribution on ranks, if the ranks are of interest. There are lots of distributions of c-dimensional continuous outcomes. In political science, the usual way to start is
5 0.79642189 1918 andrew gelman stats-2013-06-29-Going negative
Introduction: Troels Ring writes: I have measured total phosphorus, TP, on a number of dialysis patients, and also measured conventional phosphate, Pi. Now P is exchanged with the environment as Pi, so in principle a correlation between TP and Pi could perhaps be expected. I’m really most interested in the fraction of TP which is not Pi, that is TP-Pi. I would also expect that to be positively correlated with Pi. However, looking at the data using a mixed model an insignificant negative correlation is obtained. Then I thought, that since TP-Pi is bound to be small if Pi is large a negative correlation is almost dictated by the math even if the biology would have it otherwise in so far as the the TP-Pi, likely organic P, must someday have been Pi. Hence I thought about correcting the slight negative correlation between TP-Pi and Pi for the expected large negative correlation due to the math – to eventually recover what I came from: a positive correlation. People seems to agree that this thinki
6 0.79009038 1997 andrew gelman stats-2013-08-24-Measurement error in monkey studies
7 0.78891313 1919 andrew gelman stats-2013-06-29-R sucks
8 0.78073996 1618 andrew gelman stats-2012-12-11-The consulting biz
9 0.77822155 1857 andrew gelman stats-2013-05-15-Does quantum uncertainty have a place in everyday applied statistics?
10 0.77661955 1801 andrew gelman stats-2013-04-13-Can you write a program to determine the causal order?
11 0.77590227 854 andrew gelman stats-2011-08-15-A silly paper that tries to make fun of multilevel models
12 0.7738288 62 andrew gelman stats-2010-06-01-Two Postdoc Positions Available on Bayesian Hierarchical Modeling
14 0.76779604 432 andrew gelman stats-2010-11-27-Neumann update
15 0.76527917 907 andrew gelman stats-2011-09-14-Reproducibility in Practice
16 0.76386952 1275 andrew gelman stats-2012-04-22-Please stop me before I barf again
17 0.75591016 113 andrew gelman stats-2010-06-28-Advocacy in the form of a “deliberative forum”
20 0.75402296 419 andrew gelman stats-2010-11-18-Derivative-based MCMC as a breakthrough technique for implementing Bayesian statistics