A Random Forest-based Prediction Model for Turning Points in Antagonistic Event-Group Competitions

• URL: http://arxiv.org/abs/2405.20029v2
• Date: Sat, 1 Jun 2024 11:03:18 GMT
• Title: A Random Forest-based Prediction Model for Turning Points in Antagonistic Event-Group Competitions
• Authors: Zishuo Zhu,
• Abstract summary: This paper proposes a prediction model based on Random Forest for the turning point of the antagonistic event-group. The model can effectively predict the turning point of the competition situation of the antagonistic event-group.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: At present, most of the prediction studies related to antagonistic event-group competitions focus on the prediction of competition results, and less on the prediction of the competition process, which can not provide real-time feedback of the athletes' state information in the actual competition, and thus can not analyze the changes of the competition situation. In order to solve this problem, this paper proposes a prediction model based on Random Forest for the turning point of the antagonistic event-group. Firstly, the quantitative equation of competitive potential energy is proposed; Secondly, the quantitative value of competitive potential energy is obtained by using the dynamic combination of weights method, and the turning point of the competition situation of the antagonistic event-group is marked according to the quantitative time series graph; Finally, the random forest prediction model based on the optimisation of the KM-SMOTE algorithm and the grid search method is established. The experimental analysis shows that: The quantitative equation of competitive potential energy can effectively reflect the dynamic situation of the competition; The model can effectively predict the turning point of the competition situation of the antagonistic event-group, and the recall rate of the model in the test set is 86.13%; The model has certain significance for the future study of the competition situation of the antagonistic event-group.

Related papers

• Algorithmic Fairness in Performative Policy Learning: Escaping the Impossibility of Group Fairness [19.183108418687226]
  We develop algorithmic fairness practices that leverage performativity to achieve stronger group fairness guarantees in social classification problems. A crucial benefit of this approach is that it is possible to resolve the incompatibilities between conflicting group fairness definitions.
  arXiv  Detail & Related papers  (2024-05-30T19:46:47Z)
• CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition [52.2034494666179]
  Sparse mixture of experts (SMoE) offers an appealing solution to scale up the model complexity beyond the mean of increasing the network's depth or width. We propose a competition mechanism to address this fundamental challenge of representation collapse. By routing inputs only to experts with the highest neural response, we show that, under mild assumptions, competition enjoys the same convergence rate as the optimal estimator.
  arXiv  Detail & Related papers  (2024-02-04T15:17:09Z)
• Performative Time-Series Forecasting [71.18553214204978]
  We formalize performative time-series forecasting (PeTS) from a machine-learning perspective. We propose a novel approach, Feature Performative-Shifting (FPS), which leverages the concept of delayed response to anticipate distribution shifts. We conduct comprehensive experiments using multiple time-series models on COVID-19 and traffic forecasting tasks.
  arXiv  Detail & Related papers  (2023-10-09T18:34:29Z)
• Understanding the Impact of Competing Events on Heterogeneous Treatment Effect Estimation from Time-to-Event Data [92.51773744318119]
  We study the problem of inferring heterogeneous treatment effects (HTEs) from time-to-event data in the presence of competing events. We take an outcome modeling approach to estimating HTEs, and consider how and when existing prediction models for time-to-event data can be used as plug-in estimators for potential outcomes. We theoretically analyze and empirically illustrate when and how these challenges play a role when using generic machine learning prediction models for the estimation of HTEs.
  arXiv  Detail & Related papers  (2023-02-23T14:28:55Z)
• Towards Out-of-Distribution Sequential Event Prediction: A Causal Treatment [72.50906475214457]
  The goal of sequential event prediction is to estimate the next event based on a sequence of historical events. In practice, the next-event prediction models are trained with sequential data collected at one time. We propose a framework with hierarchical branching structures for learning context-specific representations.
  arXiv  Detail & Related papers  (2022-10-24T07:54:13Z)
• CEP3: Community Event Prediction with Neural Point Process on Graph [59.434777403325604]
  We propose a novel model combining Graph Neural Networks and Marked Temporal Point Process (MTPP) Our experiments demonstrate the superior performance of our model in terms of both model accuracy and training efficiency.
  arXiv  Detail & Related papers  (2022-05-21T15:30:25Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Improvements to short-term weather prediction with recurrent-convolutional networks [0.0]
  This paper describes the author's efforts to improve the model further in the second stage of the Weather4cast 2021 competition. The largest quantitative improvements to the competition metrics can be attributed to the increased amount of training data available in the second stage of the competition.
  arXiv  Detail & Related papers  (2021-11-11T14:38:15Z)
• Towards robust and domain agnostic reinforcement learning competitions [12.731614722371376]
  Reinforcement learning competitions have formed the basis for standard research benchmarks. Despite this, a majority of challenges suffer from the same fundamental problems. We present a new framework of competition design that promotes the development of algorithms that overcome these barriers.
  arXiv  Detail & Related papers  (2021-06-07T16:15:46Z)
• Kaggle forecasting competitions: An overlooked learning opportunity [0.0]
  We review the results from six Kaggle competitions featuring real-life business forecasting tasks. We find that most of the Kaggle datasets are characterized by higher intermittence and entropy than the M-competitions. We find the strong performance of gradient boosted decision trees, increasing success of neural networks for forecasting, and a variety of techniques for adapting machine learning models to the forecasting task.
  arXiv  Detail & Related papers  (2020-09-16T14:14:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.