Gudberg K. Jonsson, Sigridur H. Bjarkadottir, Baldvin Gislason, Andrew Borrie et Magnus S. Magnusson
38
Figure 1:
A s c h e ma t ic re p r e s e nta t io n o f a T-p a tt e rn i s s h o w n i n fi g ur e 1 . If o n e
assumes that the letters in line 1 correspond to specific performance events
(e.g. pass, tackle and shot in football) that appear on the line in proportion to
th e time o f th e ir oc c ur re n ce t he n lin e 1 i s a v is ua l r e pr e se n tat io n o f t h e
temporal structure of a sports performance.
W it h in t h e u p p er l in e t h e re a r e fo u r e v e n ts (a , b , c , d ) th a t o c cu r in a
r e g u l a r t e m p o r a l pa t t e r n h o w e v e r t h e p a t te rn h a s b e e n m a s k e d b y th e
surro undin g, more ran dom, o ccurre nce of the eve nts w an d k . If a pe rfor-
mance analyst or coach were simply visually inspecting the data string it is
unlikely that the pattern would have been detected. The T-pattern analysis
w o u l d h a v e i d e n t i f i e d t h e p a t t e r n b e c a u s e o f i ts c o n s i s t e n t t e m p o r a l
structure. The T-pattern detection algorithms allow an analyst to separate out
rando mly occu rring eve nts from temporal pa tte rn s e ven whe n th e ran dom
events occur in between elements of the pattern.
A T-pattern is essentially a combination of events where the events occur
in the same order with the consecutive time distances between consecutive
pattern components remaining relatively invariant with respect to an expec-
tation assuming, as a null hypothesis, that each component is independently
and randomly distributed over time. As stated by Magnusson ’that is, if A is
an earlier and B a later component of the same recurring T-pattern then after
an occurrence of A at t, there is an interval that tends to contain at least one
occurrence of B more often than would be expected by chance’ (Magnusson,
20 00 , p. 9 4). The t empo ra l r ela tion sh ip b etwee n A an d B is d ef ine d as a
critical interval an d this con cept lies at th e cen tre of the pattern d etectio n
algorithms.
Th e pattern detection a lg orithms c an a nalyze both o rd in al and temporal
data however, for the algorithms to generate the most meaningful analyses
the raw data must be time coded i.e. an event must be coded according to
time of occurre nce as well as event type . The coding of many event-typ es
and corres pond in g times re sults in the type of d ata set shown in figure 2.
This figure displays a behaviour record from the second half of a club football
match and consists of 250 series of occurrence times (one for each coded
event type) ordered according to their first occurrence time.
Schematic representation
of a T-pattern viewed
within a normal data string
and as it appears
in isolation.
Présentation schématique
d’un T-pattern dans une
séquence normale
et lorsqu’il est isolé.
L’axe représente le temps.
a, b, c, d, k et w sont
des évènements-types.
Detection of real-time patterns in sports interactions in football
Do'stlaringiz bilan baham: