相关实验视频

Updated: Sep 11, 2025

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

Published on: January 11, 2020

如何快速而节的树木可以告知诊断和干预决策,以提高精英运动员的表现

Lena Siebert¹, Lukas Reichert¹, Lisa Musculus²

¹Movement and Exercise Science, Institute of Sports Sciences, Goethe University Frankfurt, Frankfurt am Main, Germany.

|August 18, 2025

概括

快速节的树木 (FFTrees) 有效地识别了精英运动员的训练需求. 这些决策工具可以个性化干预,通过分析体育特定数据以获得更好的表现结果来增强运动潜力.

科学领域:

运动科学运动科学运动科学
表演心理学表演心理学
数据分析数据分析数据分析.

背景情况:

优化精英运动员的潜力需要优先考虑训练干预措施.
启发式决策工具,如快速节树 (FFTrees),可以识别关键性能决定因素.
FFTrees为复杂的决策提供了一种简化,基于理性的方法.

研究的目的:

评估FFTrees在指导精英运动员干预决策中的适用性.
开发和评估FFTrees,以确定个人有益的培训干预措施.
为个性化运动员发展利用多学科数据.

主要方法:

收集了466名德国精英运动员的认知,心理和运动表现数据.
利用主要组件分析 (PCA) 来获得与FFTrees相关的干预线索.
使用已识别的线索,为床和排球建造了特定运动的FFTree.

主要成果:

开发了两个体育特定的FFTree:一个用于床 (准确率90%),一个用于排球 (准确率75%).
床FFTree利用了相对握力,运动成本,运动抑制和视觉选择性注意力.
排球FFTree纳入了运动抑制,运动成本,反运动跳跃和Y平衡测试结果.

结论:

FFTrees在促进针对精英运动员量身定制的数据驱动干预决策方面表现出高度准确性.
该方法通过整合多学科数据,与体育特定需求和教练见解保持一致来支持个性化培训.
FFTrees通过有效地确定运动员的适应潜力和告知干预策略,赋予教练和决策者权力.

更多相关视频

Revised and Neuroimaging-Compatible Versions of the Dual Task Screen

Revised and Neuroimaging-Compatible Versions of the Dual Task Screen

Published on: October 5, 2020

Vision Training Methods for Sports Concussion Mitigation and Management

Vision Training Methods for Sports Concussion Mitigation and Management

Published on: May 5, 2015

相关概念视频

Survival Tree

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...