EA-lect: an evolutionary algorithm for constructing logical rules to predict election into Cooperstown
暂无分享,去创建一个
While several papers exist focusing on the question of election into the Baseball Hall of Fame election, all of them use the same method for building a model: regression analysis. Problems with this include the fact that regressions are continuous functions, and thus have trouble modeling binary problems. While there are some methods that work reasonably well, a logical rule, which can be evaluated to only true or false, seems to be a better option for several reasons. In regression models, since the results are continuous, it is possible to get an answer other than just 1 or 0 for a binary problem. Because of this, an arbitrary cutoff to what is to be considered a positive example must be made. Instead, through the use of genetic algorithms, a logical rule, which can evaluate any example to either true or false (1 or 0) can be found. The rules found by this system are extremely accurate, with training accuracies around 99% and testing accuracies just lower at 97%.
[1] Voting for the Baseball Hall of Fame: The Effect of Race on Election Date , 2003 .
[3] Clare Bates Congdon,et al. Classification of epidemiological data: a comparison of genetic algorithm and decision tree approaches , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[4] D. Findlay,et al. Voting Behavior, Discrimination and the National Baseball Hall of Fame , 1997 .
[5] R. Todd Jewell,et al. Measuring discrimination in major league baseball: evidence from the baseball hall of fame , 2002 .