<!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>Factor analysis of sports data via decomposition of matrices with grades⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Radim Belohlavek</string-name>
          <email>radim.belohlavek@acm.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marketa Krmelova</string-name>
          <email>marketa.krmelova@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Data Analysis and Modeling Lab (DAMOL) Dept. Computer Science, Palacky University</institution>
          ,
          <addr-line>Olomouc</addr-line>
        </aff>
      </contrib-group>
      <fpage>293</fpage>
      <lpage>304</lpage>
      <abstract>
        <p>The aim of this paper is to present experimental results on a recently developed method of factor analysis of data with graded, or fuzzy, attributes. The method utilizes formal concepts of data with graded attributes. In our previous papers, we described the factor model, the method, an algorithm to compute factors, and provided basic examples. In this paper, we perform a more extensive experimentation with this method. In particular, we apply the method to factor analysis of sports data. The aim of the paper is to demonstrate that the method yields reasonable factors, explain in detail how the factor model and the factors are to be understood, and to put forward new issues relevant to the method.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <sec id="sec-2-1">
        <title>Aim of This Paper</title>
        <p>
          Recently, a considerable effort was devoted to the development of factor analysis
and related methods for new types of data such as Boolean (binary) or ordinal. In
our previous papers, we developed a method of factor analysis of Boolean data
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], i.e. data with Boolean attributes, and extended the problem and method
to data with graded attributes [
          <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
          ]. In the present paper, we use the method
as well as the algorithm from [
          <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
          ]. Due to the limited scope and the aim of
this paper, we only provide a brief, mainly informal overview of the key notions
involved, illustrate these notions by examples and refer the reader to [
          <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
          ] for
technical details. Our aim is to provide information sufficient to understand the
experiments described in this paper. A full version of this paper will contain a
detailed description of the method, a more comprehensive experimental section,
formal treatment of some issues that we only discuss informally in this paper
(cf. also Section 3), as well as a section putting the method being discussed into
perspective of related methods of data analysis.
c 2012 by the paper authors. CLA 2012, pp. 293–304. Copying permitted only for
private and academic purposes. Volume published and copyrighted by its editors.
Local Proceedings in ISBN 978–84–695–5252–0,
Universidad de M´alaga (Dept. Matem´atica Aplicada), Spain.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>The Method, Factors, and Their Interpretation</title>
        <p>
          In a broad sense, our method may be considered as implementing the general
idea of factor analysis [
          <xref ref-type="bibr" rid="ref1 ref12">1, 12</xref>
          ]: Given an n × m object-attribute matrix I, one
finds a decomposition
        </p>
        <p>
          I = A ◦ B
(1)
of I into a product of an n × k object-factor matrix A, a k × m matrix B,
revealing thus k factors, i.e. new, possibly more fundamental attributes (or variables),
which explain the original m attributes. We want k &lt; m and, in fact, k as small
as possible to achieve parsimony: The n objects described by m attributes via
I may then be described by k factors via A, with B representing a
relationship between the original attributes and the factors. Contrary to classic factor
analysis, which uses the calculus of real-valued matrices, we use the calculus of
matrices over residuated lattices. That is, the entries of matrices involved are
elements of a residuated lattice L = hL, ∧, ∨, ⊗, →, 0, 1i, i.e. Iij , Ail, Blj ∈ L. The
elements of L represent truth degrees, 0 and 1 are the smallest and largest one
and correspond to “(fully) false” and “(fully) true”; ∧ and ∨ denote the infimum
and supremum, and ⊗ and → denote the truth functions on many-valued logic
connectives of conjunction and implication. The product ◦ in (1) is defined by
(A ◦ B)ij = Wlk=1 Ail ⊗ Blj . (2)
Importantly, the entries of I, A, and B are interpreted the following way:
Iij is the truth degree of the proposition “object i has attribute j”,
Ail is the truth degree of the proposition “factor l applies to object i”,
Blj is the truth degree of “attribute j is one of the manifestations of factor l”.
For the moment, think of i, j, and l as a particular athlete (object), good
performance in long jump (attribute), and good speeding ability (factor). Using
the principles of fuzzy logic [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], (2) and hence the whole factor model has the
following meaning (this is even easy to see using intuition knowing that “exists”
and “and” are modeled by W and ⊗):
object i has attribute j if and only if
there exists factor l such that i has l (or, l applies to i)
(3)
and j is one of the particular manifestations of l.
        </p>
        <p>
          In principle, our method works as follows. We compute from I, using a greedy
approximation algorithm from [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], a set
        </p>
        <p>F = {hC1, D1i, . . . , hCk, Dki} ⊆ B(X, Y, I)
of formal fuzzy concepts of I, which gives us the decomposition as follows. Put
(AF )il = (Cl)(i) and (BF )lj = (Dl)(j),
i.e. AF is an n × k matrix in which the lth column consists of grades assigned
to objects by the lth concept extent Cl and BF is a k × m matrix in which
the lth row consists of grades assigned to attributes by the lth intent Dl. Then
I = AF ◦ BF , i.e. the matrices AF and BF induced by F provide us with
(4)
(5)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Examples and Experiments</title>
      <p>a decomposition of I. Moreover, the optimal decompositions (i.e. with least k
possible) may in principle be obtained this way, in which sense using formal
concepts as factors is an optimal strategy. Note however, that our algorithm
computes suboptimal decompositions since the problem to compute an optimal
decomposition is an NP-hard optimization problem.</p>
      <p>We revisit these notions, particularly in Section 2.1, where we explain the
notions involved using a particular example.
✵✿✵✵ ✵✿✷ ✵✿✵ ✵✿✼ ✶✿✵✵ .</p>
      <p>
        Note that due to the well-known Miller’s 7 ± 2 phenomenon [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], small scales
with up to 7±2 degrees are preferable to use because humans can understand and
use such scales easily. For a reader not familiar with basics of many-valued logics
let us note that the Lukasiewicz ⊗ (such as other many-valued conjunction) may
be seen as a natural conjunction-like aggregation: the higher the truth values a
and b of propositions A and B, the higher the truth value a⊗b of the conjunction
A&amp;B.
      </p>
      <p>Our aim in this section is to present the results of selected analyses, and thus to
demonstrate a usefulness of the method, as well as to explain in detail the process
of analysis, possibly even for a user who is not familiar with the technicalities of
the method.</p>
      <p>
        First, we point out some features common to the examples presented below.
As the complete residuated lattice, we use as five-element Lukasiewicz chain.
That is, the matrix degrees are taken from the set
Many other choices are available, see e.g. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. We represent the degrees by shades
of gray as follows (this also emphasizes the fact that the truth degrees have a
symbolic, rather than numerical, meaning):
and the operation ⊗ is given by
      </p>
      <p>L = {0, 0.25, 0.5, 0.75, 1}
a ⊗ b = max(0, a + b − 1).
2.1</p>
      <p>
        2004 Olymphic Games Decathlon—Top 5
We start with a detailed description of factor analysis of top 5 athletes in the
2004 Olympic Decathlon and use this example as a reference example in the
subsequent sections (this data is also used in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], but our analysis here is slightly
different since we use a different transformation of the athletes’ results to grades).
Our method is particularly suitable for analyzing such data for the following
reasons. The raw data, i.e. the actual results in the ten disciplines of decathlon,
can naturally be transformed to data with graded attributes, i.e. to a matrix I.
Namely, for every discipline d, one may consider a graded attribute “good
performance in d”. That is, such an attribute applies to an athlete (object) to a degree
to which we consider the performance of the athlete a good performance. This
is a natural, generally applicable idea. However, in our case, the IAAF
(International Association of Athletics Federations) provides us with decathlon scoring
tables (http://www.iaaf.org, IAAF Scoring Tables for Combined Events) using
which one transforms the actual results to scores from an ordinal scale, namely
the interval of integers [0, 1, . . . , 1400], which is common to all disciplines. For
example, the result of 10.75sec in 100m gets 962 points, the result of 204cm in
high jump gets 927 points, etc. A table with actual scores may then be
transformed to a matrix I with graded attributes using an appropriate set L of truth
degrees and an appropriate transformation function.
      </p>
      <p>
        The top table in Tab. 1 contains the results of top 5 athletes according to the
IAAF scoring tables. The second table from the top contains the corresponding
matrix I, i.e. the matrix with degrees from the five-element scale L, and the
bottom table contains its graphical representation. The transformation from the
table with scores to the matrix with degrees from L = {0, 0.25, 0.5, 0.75, 1} is
accomplished using functions
p − Lj
Hj − Lj
sj : [0, . . . , 1400] → L defined by sj (p) = round
where j is an attribute (discipline), and Lj and Hj are the lowest and the highest
scores achieved by all the athletes (i.e. not only the top 5) who participated in
the competition, and round is the function rounding the numbers in [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ] to their
closest values in L. Note that in this competition, we have L10 = 746, Llj = 723,
Lsp = 657, Lhj = 644, L40 = 673, Lhu = 755, Ldt = 622, Lpv = 673, Ljt = 598,
L15 = 466, and H10 = 989, Hlj = 1050, Hsp = 873, Hhj = 944, H40 = 968,
Hhu = 978, Hdt = 905, Hpv = 1035, Hjt = 897, H15 = 791. Therefore, the degree
assigned to Sebrle in 400m is round( 899628−−667733 ) = round(0.74 . . . ) = 0.75. The
matrix I allows us to interpret the athletes’ results verbally. Namely, assigning
to the degrees from L linguistic labels such as “not at all” to 0, “little bit” to
0.25, “half” to 0.5, “quite” to 0.75, and “fully” to 1, or the like, one may say
that Sebrle’s performance in 400m was quite good. Even though we lose some
information using such rounding to five degrees, the information preserved still
allows us to perform a reasonable analysis, which is shown next.
      </p>
      <p>
        The algorithm from [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] found a decomposition of I using six factors depicted
in Fig. 2. The corresponding decomposition I = AF ◦BF is depicted in Fig. 1. As
explained in Section 1, cf. (5), the columns of AF corresponding to Fl = hCl, Dli
contain the degrees assigned to the athletes by Cl; likewise for the rows of BF ,
the attributes, and Dl.
      </p>
      <p>Fig. 2 shows rectangular patterns using which the factors may be visualized.
Each rectangular pattern labeled Fl is actually the matrix Jl resulting as the
Cartesian product of the extent Cl and the intent Dl of Fl, i.e. we have (Jl)ij =
Cl(i) ⊗ Dl(j). (For readers familiar with the ordinary FCA, let us note that
these patterns are the rectangles corresponding to formal concepts and that in
the general situation with degrees, the concepts cannot be uniquely restored
from these patterns.)</p>
      <sec id="sec-3-1">
        <title>Scores of Top 5 Athletes</title>
        <p>10 lj sp hj 40 hu di pv ja 15
Sebrle 894 1020 873 915 892 968 844 910 897 680</p>
        <p>Clay 989 1050 804 859 852 958 873 880 885 668
Karpov 975 1012 847 887 968 978 905 790 671 692</p>
        <p>Macey 885 927 835 944 863 903 836 731 715 775</p>
        <p>Warners 947 995 758 776 911 973 741 880 669 693
❋✍ ❋✷ ❋✸ ❋✎ ❋✺ ❋✻
❋✍
❋✷
❋✸
❋✎
❋✺
❋✻
Legend: 10—100 meters sprint race; lj—long jump; sp—shot put; hj—high jump;
40—400 meters sprint race; hu—110 meters hurdles; di—discus throw; pv—pole
vault; ja—javelin throw; 15—1500 meters run.</p>
        <p>Fig. 2. Factor Concepts as Rectangular Patterns.
Fi Extent Intent
F1 {.5/Sebrle, Clay, Karpov, .5/Macey, .75/Warners} {10, lj, .75/sp, .75/hj, .5/40, hu, .5/di, .25/pv, .25/ja, .5/15}
F2 {Sebrle, .75/Clay, .25/Karpov, .5/Macey, .25/Warners} {.5/10, lj, sp, hj, .75/40, hu, .75/di, .75/pv, ja, .75/15}
F3 {.75/Sebrle, .5/Clay, .75/Karpov, Macey, .5/Warners} {.5/10, .5/lj, .75/sp, hj, .75/40, .75/hu, .75/di, .25/pv, .5/ja, 15}
F4 {Sebrle, .75/Clay, .75/Karpov, .75/Macey, Warners} {.5/10, .75/lj, .5/sp, .5/hj, .75/40, hu, .25/di, .5/pv, .25/ja, .75/15}
F5 {.75/Sebrle, .5/Clay, Karpov, .75/Macey, .25/Warners} {.75/10, .75/lj, sp, .75/hj, 40, hu, di, .25/pv, .25/ja, .75/15}
F6 {.75/Sebrle, Clay, .25/Karpov, .5/Macey, .25/Warners} {.75/10, lj, .75/sp, .75/hj, .5/40, hu, di, .5/pv, ja, .5/15}
Fig. 3 demonstrates what portion of matrix I is explained using the first l
factors for l = 1, . . . , k. In particular, the matrix labeled 56% just shows the
rectangular pattern J1 corresponding to F1. The number indicates that 56% of
the entries in I have the same value as in J1, i.e. 56% of the data is explained
by the first factor. The second matrix contains J1 ∨ J2, i.e. it illustrates what
happens when we add the second factor. As we can see, 82% of the data is
explained by the first two factors. Since the first three factors explain 91% of
the data, one might say that the first three factors account for most of the data,
are most important, and the rest of the factors may be omitted. Nevertheless,
adding further the factors we see that the first four, five, and six factors explain
95%, 98%, and 100% of the data (the latter fact is obviously true because the
factors completely decompose matrix I). Note also, that several of the 18% =
100% − 82% of the entries not explained by the first two factors have values close
to the corresponding entries of I, so a measure of closeness of Jl and I which
takes into account also close entries, rather than exactly equal ones only, would
yield a number larger than 82%. In any case, we can conclude from the visual
inspection of the matrices that already the first two or three factors explain the
data reasonably well. Note that the fact that the revealed factors are reasonable
was confirmed to us by an experienced decathlon coach who also pointed out to
us that F2 (explosiveness) is known to be well-developed by the Czech school of
decathlon (hence Sebrle).</p>
        <p>56%
95%
82%
98%
91%
100%</p>
        <p>Let us turn to the interpretation of the factors. For this purpose, Fig. 2 is
crucial since it contains all the information about the factors. Note however that
Fig. 2 is also helpful as it shows the clusters corresponding to the factor concepts
which draw together the athletes and their performances in the events. Factor
F1: F1 applies to Sebrle to degree 0.5, to both Clay and Karpov to degree 1, to
Macey to degree 0.5, and to Warners to degree 0.75. Furthermore, this factor
applies to attribute 10 (100 m) to degree 1, to attribute lj (long jump) to degree
1, to attribute sp (shot put) to degree 0.75, etc. This means that an excellent
performance (degree 1) in 100 m, an excellent performance in long jump, a very
good performance (degree 0.75) in shot put, etc. are particular manifestations of
this factor. On the other hand, only a relatively weak performance (degree 0.25)
in javelin throw and pole vault are manifestations of this factor. All the
manifestations of this factor with degree 1 are 100 m, long jump, and 110 m hurdles.
This factor can be interpreted as the ability to run fast for short distances. Note
that this factor applies particularly to Clay and Karpov which is well known
in the world of decathlon. Factor F2: Similarly, since the manifestations of this
factor with degree 1 are long jump, shot put, high jump, and javelin, F2 can be
interpreted as the ability to apply very high force in a very short term
(explosiveness). F2 applies particularly to Sebrle, and then to Clay, who are known for
this ability. Factor F3: Manifestations with grade 1 are high jump and 1500 m.
This factor is typical for lighter, not very muscular athletes. Macey, who is
evidently that type among decathletes (196 cm and 98 kg) is the athlete to whom
the factor applies to degree 1. These are the most important factors behind data
matrix I.
2.2</p>
        <p>2004 Olympic Games Decathlon Top 5 By Their Best Results
In this example, we take the top 5 athletes of the 2004 Olympic Decathlon but
we take their best performances during their decathlon competitions, instead of
their actual performances in a single event such as the 2004 Olympics. Taking
best performances may be reasonable if we want to avoid a possible bad luck in
a particular discipline such as a bad start in 100 m. Tab. 3 contains the scores.
The corresponding matrix I and its decomposition into AF ◦ BF is depicted in
Fig. 4. Here, the transformation from points to degrees is defined as follows. For
discipline j, we put
 1 for p ∈ [Hj , Hj − 100),
 0.75 for p ∈ [Hj − 100, Hj − 200),

sj (p) =  0.5 for p ∈ [Hj − 200, Hj − 300),
 0.25 for p ∈ [Hj − 300, Hj − 400),

 0 for p ≤ Hj − 400,
where Hj is the highest score ever achieved during a decathlon competition for
discipline j. Note that H10 = 1042; Hlj = 1117; Hsp = 1048; Hhj = 1061;
H40 = 1025; Hhu = 1064; Hdi = 993; Hpv = 1152; Hja = 1040; H15 = 963.</p>
        <p>It seems natural that the factors in this case are different from those in the
example in Section 2.1. Nevertheless, we can see that F1 applies to degree 1 to
Clay and Karpov in both examples and applies to the other athletes to similar
degrees in both examples as well. Nevertheless, the intents of the first factor are
different although a reasonable similarity is apparent as well (presence of long</p>
      </sec>
      <sec id="sec-3-2">
        <title>Scores of Top 5 Athletes</title>
        <p>10 lj sp hj 40 hu di pv ja 15
Sebrle 942 1089 880 944 921 1002 859 972 907 798</p>
        <p>Clay 1010 1050 868 887 944 1022 993 941 920 670
Karpov 931 1073 910 915 968 984 929 1004 743 729</p>
        <p>Macey 940 1002 841 944 998 931 836 849 799 990
Warners 947 1022 800 831 978 973 824 886 692 693
❋✍ ❋✷ ❋✸ ❋✎ ❋✺
❋✍
❋✷
❋✸
❋✎
❋✺
jump and hurdles to degree 1, presence of 100 m and high jump to high degrees).</p>
        <p>A similar observation can be made on F2 (connects Sebrle and Clay) and F3
which is typical of Macey.
The results of the 5th–10th athletes in the 2004 Olympic Decathlon are depicted
in Tab. 4. The matrix I corresponding to the top 10 athletes, along with a
decomposition I = AF ◦ BF computed by the algorithm is depicted in Fig. 5.</p>
        <p>The same transformation from scores to degrees was used as in Section 2.1.</p>
        <p>Compared to the factors from Section 2.1, the factors in this example are
generally different although some similarities are apparent. For example, factor
✶ ✹ ❧✁ ✂s ❤✁ ❤✉ ❞✄ ✂✈ ✁✄ ☎✶
Factor analysis of sports data via decomposition of matrices with grades
301
❋✓ ❋✷ ❋✸ ❋✔ ❋✺ ❋✻ ❋✼ ❋✽ ❋✾ ❋✓✕ ❋✓✓ ❋✓✷
❋✓
❋✷
❋✸
❋✔
❋✺
❋✻
❋✼
❋✽
❋✾
❋✓✕
❋✓✓
❋✓✷</p>
        <p>F2 here is exactly the same (has same intent) as F1 in Section 2.1, F12 is the
same as F6 in Section 2.1, and F4 is almost the same as F3 in Section 2.1.</p>
        <p>We might nevertheless be interested in the question of how well the factors
from Section 2.1 explain the new dataset regarding the top 10 athletes. A
reasonable way to proceed is the following. Consider the set of 6 concepts of the
new, 10 × 10 matrix I, namely,</p>
        <p>G = {G1 = hP1, Q1i, . . . , G6 = hP6, Q6i}
obtained from the factors F1 = hC1, D1i, . . . , F6 = hC6, D6i by</p>
        <p>P1 = D1↓, Q1 = P1↑, . . . , P6 = D6↓, Q6 = P6↑,
i.e. every factor Gl is the concept of the 10 × 10 matrix I generated by the intent
of Fl. This way, we do not have I = AG ◦ BG in general, as can be seen from
this example. Nevertheless, the first factor G1 explains 50% of the data, the first
two factors 69%, the first three factors 80%, the first four factors 86%, the first
five factors 89%, and all factors in G explain 91% of the data. Hence, one may
conclude that the factors of the top 5 athletes explain reasonably well also the
results of all the top 10 athletes. The matrices involved are depicted in Fig. 6.</p>
        <p>Note that one may clearly observe the similarity between I (the original matrix)
and AG ◦ BG (the matrix reconstructed from the factors in G).
2.4</p>
        <p>2004 Olympic Games Modern Pentathlon
Another sport that contains several disciplines and may be interesting for
factor analysis is the modern pentathlon. The five disciplines are, however, rather
diverse and it is therefore challenging to think of natural factors in this sport.
Recall that modern pentathlon consists of pistol shooting, fencing, 200 m freestyle
swimming, show jumping, and a 3 km cross-country run. Except for the fencing
competition, athletes do not directly compete against one another in the five
Radim Belohlavek and Marketa Krmelova
❋✓ ❋✷ ❋✸ ❋✔ ❋✺ ❋✻
❋✓
❋✷
❋✸
❋✔
❋✺
❋✻
events. Instead, a better absolute performance results in a higher score and the
sum of all the scores for the disciplines gives the overall total score of a given
athlete.</p>
        <p>Tab. 5 contains the results of the 2004 Olympic Games modern pentathlon
of the top 10 athletes. The corresponding matrix I and its decomposition into
AF ◦ BF is depicted in Fig. 7. To transform the scores of discipline j to degrees,
we used the function
 1 for p ∈ [Hj , Hj − 15 (Hj − Lj )),
 0.75 for p ∈ [Hj − 51 (Hj − Lj ), Hj − 52 (Hj − Lj )),

sj (p) =  0.5 for p ∈ [Hj − 25 (Hj − Lj ), Hj − 53 (Hj − Lj )),
 0.25 for p ∈ [Hj − 35 (Hj − Lj ), Hj − 54 (Hj − Lj )),

 0 for p ≤ Hj − 45 (Hj − Lj ),
where Hj and Lj are the highest and the lowest score achieve in discipline j in the
2004 Olympic Games modern pentathlon. Note that Hsh = 1168, Lsh = 892;
Hfe = 1000, Lfe = 664; Hsw = 1376, Lsw = 1140; Hri = 1172, Lri = 584;
Hru = 1116, Lru = 752.</p>
        <p>✿❀ ✿❁ ✿❂ ✿❃ ✿❄ ✿❅
✿❀
✿❁
✿❂
✿❃
✿❄
✿❅</p>
        <p>✕✖ ❢✗ ✘✕ r✙ r✚</p>
        <p>Fig. 7. Decomposition I = AF ◦ BF .</p>
        <p>Note that of all the factors computed, F2 is probably most interesting because
it is actually known in the world of modern pentathlon. Namely, F2’s
manifestations are riding and cross-country run which is typical for athletes who are in
a good physical shape and have good endurance. Each of the other factors more
or less corresponds to a single discipline which corresponds to the intuitive idea
that the disciplines are diverse and require diverse skills.
3</p>
        <p>Concusions, Further Issues and Future Work
We presented several examples of factor analysis of sports data using a recently
developed method that utilizes formal concepts as factors. Our main aim was
to explain the method, to illustrate the key notions used in the method, and
to demonstrate how one can understand the results of the method. It turns out
from the examples that the method yields reasonable factors and that the results
of the method are easy to understand.</p>
        <p>Due to the limited scope of this paper, we presented only a limited
number of examples and limited comments on the presented examples. In addition
to the examples presented in this paper, we performed factor analyses of
further decathlon data (namely, the World Championships), figure skating, and ice
hockey players performance. We refrained from formalizing some of the issues
involved, such as “explanation of data by factors”, “similarity of factors”, how
well the factors of one dataset serve as good factors of another dataset, etc., and
used these notions with their informal meaning only. We therefore also skipped
theoretical results regarding these notions, as well as further notions and results
that may help us answer further natural questions that arise in the context of
the presented method, such as the influence of the choice of the scale of degrees,
the operation ⊗, the influence of the transformation from scores to degrees, and
the like.</p>
        <p>
          More examples with detailed comments as well as a detailed treatment of
some of issues mentioned above will appear in the full version of this paper. An
interesting question that is to be a subject of our future research is a
comparison, experimental and possibly also theoretical, of relationships of the presented
method with related methods that involve matrix decomposition, notable the
non-negative matrix factorization [
          <xref ref-type="bibr" rid="ref14 ref8">8, 14</xref>
          ].
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bartholomew</surname>
            <given-names>D. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knott</surname>
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Latent Variable Models</article-title>
          and
          <string-name>
            <given-names>Factor</given-names>
            <surname>Analysis</surname>
          </string-name>
          , 2nd Ed., London, Arnold,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bartl</surname>
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belohlavek</surname>
            <given-names>R.</given-names>
          </string-name>
          , Konecny J.:
          <article-title>Optimal decompositions of matrices with grades into binary and graded matrices</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          <volume>59</volume>
          (
          <issue>2</issue>
          )(
          <year>2010</year>
          ),
          <fpage>151</fpage>
          -
          <lpage>167</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Belohlavek</surname>
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Concept lattices and order in fuzzy logic</article-title>
          .
          <source>Annals of Pure and Applied Logic</source>
          <volume>128</volume>
          (
          <issue>1-3</issue>
          )(
          <year>2004</year>
          ),
          <fpage>277</fpage>
          -
          <lpage>298</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Belohlavek</surname>
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Optimal decompositions of matrices with entries from residuated lattices</article-title>
          .
          <source>Journal of Logic and Computation</source>
          , doi: 10.1093/logcom/exr023, online
          <issue>: September 7</issue>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Belohlavek</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vychodil</surname>
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Discovery of optimal factors in binary data via a novel method of matrix decomposition</article-title>
          .
          <source>Journal of Computer and System Sciences</source>
          <volume>76</volume>
          (
          <issue>1</issue>
          )(
          <year>2010</year>
          ),
          <fpage>3</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Belohlavek</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vychodil</surname>
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Factor analysis of incidence data via novel decomposition of matrices</article-title>
          .
          <source>LNAI</source>
          <volume>5548</volume>
          (
          <year>2009</year>
          ),
          <fpage>83</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ganter</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Formal Concept Analysis</article-title>
          .
          <source>Mathematical Foundations</source>
          . Springer, Berlin,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Golub G.,
          <string-name>
            <surname>Van Loan</surname>
            <given-names>C.</given-names>
          </string-name>
          : Matrix Computations. Johns Hopkins University Press,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>J. A. Goguen.</surname>
          </string-name>
          <article-title>The logic of inexact concepts</article-title>
          .
          <source>Synthese</source>
          <volume>18</volume>
          (
          <issue>1968-9</issue>
          ),
          <fpage>325</fpage>
          -
          <lpage>373</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gottwald</surname>
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Treatise on Many-Valued Logics</article-title>
          . Research Studies Press, Baldock, Hertfordshire, England,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. H´ajek P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Harman H. H. : Modern Factor Analysis</surname>
          </string-name>
          , 2nd Ed. The Univ. Chicago Press, Chicago,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Krantz</surname>
            <given-names>H. H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luce R. D.</surname>
          </string-name>
          ,
          <string-name>
            <surname>Suppes</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tversky</surname>
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Foundations of Measurement</source>
          . Vol.
          <article-title>I (Additive and Polynomial Representations), Vol. II (Geometric, Threshold, and Probabilistic Represenations), Vol. III (Represenations, Axiomatization,</article-title>
          and Invariance).
          <source>Dover Edition</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Lee</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seung</surname>
            <given-names>H.</given-names>
          </string-name>
          :
          <article-title>Learning the parts of objects by non-negative matrix factorization</article-title>
          .
          <source>Nature</source>
          <volume>401</volume>
          (
          <year>1999</year>
          ),
          <fpage>788</fpage>
          -
          <lpage>791</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Miller</surname>
            <given-names>G. A.</given-names>
          </string-name>
          :
          <article-title>The magical number seven, plus or minus two: Some limits on our capacity for processing information</article-title>
          .
          <source>Psychol</source>
          . Rev.
          <volume>63</volume>
          (
          <year>1956</year>
          ),
          <fpage>81</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Stockmeyer L. J.:</surname>
          </string-name>
          <article-title>The set basis problem is NP-complete</article-title>
          .
          <source>IBM Research Report RC5431</source>
          , Yorktown Heights, NY,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Ward</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dilworth</surname>
            <given-names>R. P.</given-names>
          </string-name>
          :
          <article-title>Residuated lattices</article-title>
          .
          <source>Trans. Amer. Math. Soc</source>
          .
          <volume>45</volume>
          (
          <year>1939</year>
          ),
          <fpage>335</fpage>
          -
          <lpage>354</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Zadeh</surname>
            <given-names>L. A.</given-names>
          </string-name>
          :
          <article-title>Fuzzy sets</article-title>
          .
          <source>Inf. Control</source>
          <volume>8</volume>
          (
          <year>1965</year>
          ),
          <fpage>338</fpage>
          -
          <lpage>353</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>