首页> 外文会议>International Conference on Ubiquitous Information Management and Communication >Inter-dependent LSTM: Baseball Game Prediction with Starting and Finishing Lineups
【24h】

Inter-dependent LSTM: Baseball Game Prediction with Starting and Finishing Lineups

机译:依赖于依赖的LSTM:棒球游戏预测开始和完成阵容

获取原文

摘要

With the wide availability of historical data from baseball games, one of the most popular sports, high accurate winner prediction has become a significant target of statistical analysis and machine learning. However, existing techniques for a pre-game prediction yield poor accuracies due to the incomplete player lists given in starting lineups and substitutions occurring during the game. We exploit the capability of Long Short-Term Memory (LSTM) in identifying hidden patterns of time series data to propose inter-dependent LSTM baseball game prediction with only the starting lineup information. Particularly, we preprocess historical data to generate a pair of pre-game and post-game records for each baseball game. The pre-game record indicates the incomplete player lists given in starting lineups, and the post-game one contains the list of all players who participated in the game. The inter-dependent LSTM model exploits the dependencies of the pairs to predict a game result with only pre-game input. Our experiment results show that the proposed model achieves up to 12% higher accuracy than the existing ones.
机译:随着棒球比赛的历史数据的广泛可用性,最受欢迎的运动之一,高准确的胜利预测已成为统计分析和机器学习的重要目标。然而,由于在比赛期间发生的起始阵容和替换中的不完整的玩家列表,现有的淘汰预测的现有技术产生差的准确性。我们利用长短短期内存(LSTM)的能力识别时间序列数据的隐藏模式,以仅用启动阵容信息提出依赖于依赖的LSTM棒球游戏预测。特别是,我们预处理历史数据,为每个棒球比赛生成一对游戏前和游戏后的记录。游戏前记录指示启动阵容中给出的不完整的玩家列表,并且游戏后一个包含参与游戏的所有玩家的列表。依赖于依赖的LSTM模型利用对的依赖关系来预测游戏结果,只有游戏预先输入。我们的实验结果表明,拟议的模型比现有的拟议模型高达12%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号