<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Feature Extraction and Aggregation for Predicting the Euro 2016</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maryam Tavakoly</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hamid Zafartavanaelmiz</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ulf Brefeldy</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>2</fpage>
      <lpage>8</lpage>
      <abstract>
        <p>This paper is addressing the challenge of predicting Euro 2016 outcomes. A set of processed features alongside with a new proposed feature are used to train a linear model to compute scores of 24 participating countries. The obtained scores form fwin, lose, drawg probabilities for all possible xtures. The empirical evaluation until the seminals shows that the conceptually simple approach proves accurate for countries with historical data.</p>
      </abstract>
      <kwd-group>
        <kwd>Feature extraction</kwd>
        <kwd>ridge regression</kwd>
        <kwd>ranking</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Football is among the most popular sports in the world. Big tournaments attract
the interest of di erent groups of people, every year. The ability to predict the
outcome of matches is very challenging as they are highly uncertain. Although
sports analytics has received much attention in the past few years (e.g., [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">5, 4, 3</xref>
        ]),
predicting the outcome of a single match (e.g., [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) is largely understudied as it
probably involves too many sources of randomness.
      </p>
      <p>This paper is attached to the prediction competition for Euro 2016. We
introduce a method for predicting the scores of the countries which are present in
this tournament. The scores are further used to address the rst challenge of the
competition; the probability of fwin, lose, drawg for all possible xtures.</p>
      <p>We use provided the dataset which contains general information about
countries as well as their players. In addition, we extract additional data from the
history of all o cial games between countries by aggregating several data sources.
The features are used together with a linear model to estimate a score for each
country. The scores are then transformed into the desired probabilities for the
mentioned challenge. We rst describe the process of extracting features in
Section 2. In Section 3, the proposed method for challenge 1 is introduced. The
analysis of the results until the semi nals is presented in Section 4; Section 5
concludes.
tion provided two data sets. The rst one contains the overall ranking
information for the participating countries of the Euro 2016, and the latter summarizes
player speci c properties. We select a subset of features from both datasets as
follows:
{ Countries: fFIFA1 ranking, FIFA points, UEFA2 ranking, UEFA coe
cient, ELO3 ranking and ELO pointsg
{ Players: fMarket value, Age, Euro 2016 matches and goals, All time matches
and goal, Career matches and goalsg
Additionally, a crawler collects the squads from the o cial website of UEFA
and lters the Players data by the nal list of players in every team. We then
replace the number of appearances and goals of each player by their ratio, i.e.,
#goals=#appearance. Note that France, as the host of the tournament, has no
appearance and goal data in the quali cation phase. As a remedy, we use a ratio
to 1 to introduce a host advantage for France. Features of di erent players are
averaged, so that we end-up with a feature set on country-level.</p>
      <p>Moreover, we extract extra data from a few public sources to create an
auxiliary feature. We argue that if a team has more players who are playing for the
same (successful) club, it is more likely that the harmony in the team leads to
success of their national team as well. Thus, a list of the players' current football
club together with the club ranking (top-200) is crawled from the International
Federation of Football History &amp; Statistics (IFFHS) for 20154. For each country,
the club with the highest number of national team players is chosen, where ties
are broken by club rank. Table 1 shows the short list of statistics for the teams
in quarter nal. As can be seen in Table 1, this gave us an engineered dataset
that contains country, club, number of national team members who play in that
club and the club ranking.</p>
      <p>We aggregate the player related features such as Market Value and Age by
averaging and the rest by summation. Lastly, the club rank times the number
of players of the corresponding club for each national team has added to this
aggregated intermediate dataset.</p>
      <p>Once the player related features are obtained per country, we normalize them
using feature scaling as follows:
We then add the mean of the normalized features from the Players data as a
new single feature (PlayersScore) to the Countries data. Finally, the remaining
features of Countries data are also normalized by feature scaling.</p>
      <p>The ultimate feature set is as follow: fFIFA ranking, FIFA points, UEFA
ranking, UEFA coe cient, Elo ranking, Elo points, PlayerScoreg
1 Fdration Internationale de Football Association
2 Union of European Football Associations
3 World Football Elo Ratings web site, http://www.eloratings.net/
4 http://i hs.de/club-world-ranking-2015./</p>
      <p>* club was not in the top 200 of year 2015.
3</p>
    </sec>
    <sec id="sec-2">
      <title>The Proposed Approach</title>
      <p>In this section, we present our algorithm for predicting the fwin, lose, drawg
probabilities from scores that are obtained by a linear model. These
intermediate scores can be interpreted as indicators of the power of the teams in this
tournament. In the remainder, we assume a linear relationship between the score
of each country and the features. Let si; i 2 f1; :::; 24g be the score of ith country
and xi is the corresponding feature vector. Our linear model aims at learning a
weight vector such that si = T xi.
3.1</p>
      <sec id="sec-2-1">
        <title>Learning</title>
        <p>
          For learning the parameters , we describe a method to compute an
estimation of scores, s^i, for every country. The head-to-head records of national teams
against each other is gathered from [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Unfortunately, available data were
already aggregated and we only had access to each record of two countries which
contains the numbers of wins, draws and losses. As a result we were not able
to weight the recent data over the old ones that might be more representative
of the current power of the countries The historical data is captured for the
training purpose, hence, we are able to manipulate the dataset format to a more
convenient form. The counts of win, draw and lose are converted to the desired
probabilities. For instance, Italy and Sweden played 21 times against each other.
Each won 6 times and they drew 9 times. The fwin, lose, drawg probability
is thus f0.28, 0.28, 0.43g. In the next part, we explain the conversion process
of scores to probabilities. Therefore, connecting the probabilities from historical
records to the scores is the other way around.
        </p>
        <p>By applying ridge regression on the data, the weight vector is optimized as
follows:</p>
        <p>^ = (XT X + I) 1XT ^s;
where X 2 R24 7 is the matrix of seven nal features for 24 countries, I is
identity matrix, and ^s is vector of their scores. Each entry in ^ shows the importance
of the feature in that position of the vector; e.g., FIFA ranking and PlayersScore
are the most important features, while UEFA coe cient is the least important
feature. The obtained scores are used for prediction in the following challenge.
3.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Challenge 1: Predicting Match Outcome</title>
        <p>In the rst challenge, a prediction of fwin (Pw), lose (Pl), draw (Pd)g probability
for each country against every other country is required. A single score is used
for de ning the desired probabilities. For two countries i and j with scores of si
and sj , respectively, the probabilities are computed as follows.
if si
sj :</p>
        <p>si
Pwi = (si+sj)</p>
        <p>Pwj = (1
else :</p>
        <p>sj
Pwj = (si+sj)</p>
        <p>Pwi = (1
Pd = 1 Pwi</p>
        <p>Pwi ) sj = Pli
Pwj ) si = Plj</p>
        <p>Pwj
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Performance Analysis</title>
      <p>In this setting, the country with the higher score is more likely to win.
We evaluate the performance of our algorithm by comparing the predicted values
to the actual results. As the results are determined until semi- nals, we can
compute multi-class logarithmic loss of fwin, lose, drawg probabilities as follows,
Logloss =
1 XN XM yij log(pij );</p>
      <p>N i=1 j=1
where N is the number of games and M is equal to three classes as we are
interested to calculate the loss for the predicted probabilities. Figure 1 summarizes
the log loss error for the 51 matches. The average loss value is 1.32.</p>
      <p>Although the average number of head-to-head matches is 13.7746, historical
data for several countries are not adequate for a justi able predication. Figure
2 shows the number of matches of each team with all other teams in this
tournament. It can be spotted in Figure 4 that most of the countries with high loss
value, were provided by small number of historical data on previous matches.
For example, the number of matches between Wales and Russia were limited to
four which leads to incon dent predictions. Figure 5 focuses on situations where
more than four historical games are available; the average of logarithmic loss
declines to 1.1129.</p>
      <p>Moreover, the loss for the teams which have no record or just one appearance
in previous Euro championship are relatively higher than the rest of the teams.
Among all twenty-four teams, Albania, Iceland, Northern Ireland, Slovakia and
Wales did not qualify before. Austria and Ukraine had the chance to play in Euro
championship just once. As shown in Figure 6, we observe a further decrease of
the loss (0.9680) when we focus on pairs of teams with at least two previous
appearances in Euro championship. In the presence of su cient historical data,
our approach is able to accurately predict the outcome of matches.</p>
      <p>Additionally, we compare our prediction with a simple baseline which only
takes the FIFA Ranking of the countries into account. For each pair of countries,
we assign the winning probability of one for the country with the higher rank
and zero for losing as well as draw. Figure 3 shows that the error of prediction
for this simple strategy is very high compare to our approach which considers
all the features.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>We presented our solution for Euro 2016 competition. Our approach grounded
on feature engineering and used linear models to predict the desired probabilities
for all possible match outcomes. We showed the impact of the features on the
resulting scores. We observed that accurate predictions are possible for pairs of
teams that possess a long history of matches against each other while we faced
cold-start-like problems for teams that hardly faced each other.</p>
      <p>http://trends.baidu.com/worldcup/events/knockout?</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Knockout prediction.
          <source>locale=en</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. International football history and statistics.
          <source>www.11v11.com</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>M.</given-names>
            <surname>Brandt</surname>
          </string-name>
          and
          <string-name>
            <given-names>U.</given-names>
            <surname>Brefeld</surname>
          </string-name>
          .
          <article-title>Graph-based approaches for analyzing team interaction on the example of soccer.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>B.</given-names>
            <surname>Gabin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Camerino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Anguera</surname>
          </string-name>
          , and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Castan~er. Lince: multiplatform sport analysis software</article-title>
          .
          <source>Procedia-Social and Behavioral Sciences</source>
          ,
          <volume>46</volume>
          :
          <fpage>4692</fpage>
          {
          <fpage>4694</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>J.</given-names>
            <surname>Haase</surname>
          </string-name>
          and
          <string-name>
            <given-names>U.</given-names>
            <surname>Brefeld</surname>
          </string-name>
          .
          <article-title>Mining positional data streams</article-title>
          .
          <source>In International Workshop on New Frontiers in Mining Complex Patterns</source>
          , pages
          <volume>102</volume>
          {
          <fpage>116</fpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>