Stochastic Tracking II: Next Gen Solutions and Player Performance

In our previous post on Stochastic Tracking, we took a look at motivating a Hierarchical Bayesian process in filtering tracking data and producing more robust estimators for the velocity. During the discussion, we limited the data sampled to be of two-dimensions only and had to assume that acceleration was constant between sampled points. Due to…

Stochastic Tracking

In the era of tracking data, a need for a new style of analysis has emerged. Long gone are the regularized regression models and the simple counting techniques. Instead, we require leveraging shot-noise distributed systems such as Dan Cervone’s competing risks model, or Matthias Kempe’s self-organizing maps, or Peter Carr’s Imitation Learning. The list is…

Computing in the Stream: Schedule Compactification

When we learn about computational mathematics, software engineering, or data science in general, one of the most important questions we have to answer is how many operations are required. The answer isn’t to show the prowess of our algorithm, but rather identify how quickly the algorithm can perform. We need to know if the answer…

Making Blocks Count

When we measure the defensive impact of a player, typically the first arguments we make are the number of blocks and steals that player has obtained. We celebrate players like Dikembe Mutombo and Maurice Cheeks for their prowess in obtaining blocks (2nd all time) and steals (5th all time), respectively. In the latter case, a…