Beep: Balancing Effectiveness and Efficiency when Finding Multivariate Patterns in Racket Sports
Abstract
Modeling each hit as a multivariate event in racket sports and conducting sequential analysis aids in assessing player/team performance and identifying successful tactics for coaches and analysts. However, the complex correlations among multiple event attributes require pattern mining algorithms to be highly effective and efficient. This paper proposes Beep to discover meaningful multivariate patterns in racket sports. In particular, Beep introduces a new encoding scheme to discover patterns with correlations among multiple attributes and high-level tolerances of noise. Moreover, Beep applies an algorithm based on LSH (Locality-Sensitive Hashing) to accelerate summarizing patterns. We conducted a case study on a table tennis dataset and quantitative experiments on multi-scaled synthetic datasets to compare Beep with the SOTA multivariate pattern mining algorithm. Results showed that Beep can effectively discover patterns and noises to help analysts gain insights. Moreover, Beep was about five times faster than the SOTA algorithm.
Cite
@article{arxiv.2307.11780,
title = {Beep: Balancing Effectiveness and Efficiency when Finding Multivariate Patterns in Racket Sports},
author = {Jiang Wu and Dongyu Liu and Ziyang Guo and Yingcai Wu},
journal= {arXiv preprint arXiv:2307.11780},
year = {2023}
}
Comments
This work is accepted in the KDD 2023 Workshop on Data Science and AI for Sports