<!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>EEvvaalluuaattiioonn ooff IIPPAAQQ qquueessttiioonnnnaaiirree bbyy FFCCAA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladi mır´ Sklenra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ˇ´ JıriZ´ˇacpal</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erik Sigmund Vladi mır´ Sklenra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ˇ´ JıriZ´ˇacpal</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erik Sigmund</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. Computer Science, Palacky ́ University</institution>
          ,
          <addr-line>Tomkova 40, CZ-779 00 Olomouc</addr-line>
          ,
          <institution>Dept. Computer Science</institution>
          ,
          <addr-line>Palacky ́ Unive</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>mkova 40, CZ-779 00 Olomouc</institution>
          ,
          <addr-line>Czech</addr-line>
        </aff>
      </contrib-group>
      <fpage>60</fpage>
      <lpage>69</lpage>
      <abstract>
        <p>This paper presents using of Formal Concept Analysis (FCA) in evaluation of IPAQ questionnaire. IPAQ is global epidemiological questionnaire physical activity data. It tries to catch state of physical activity (inactivity) in representative file of population. The goal of authors was find dependencies between demographic data (age, gender, education, occupation, ...) and degree of physical activity. We tried to obtain these dependencies from intents of concept lattice created on the base of questionnaire. Because the whole concept lattice was very large and contained number of concepts not interesting for expert that evaluated data from questionnaire, we used binary relations to constrain it. Primarily, we focused on equivalence relations.</p>
      </abstract>
      <kwd-group>
        <kwd>FCA</kwd>
        <kwd>evaluation of questionnaire</kwd>
        <kwd>constrained concept lattice</kwd>
        <kwd>equivalence relation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Evaluation of questionnaire is traditionally way how to discover properties
(attributes) shared by important set of respondents (objects) and dependencies
between properties of respondents. Standard technique of their evaluation is using
statistical methods. In this paper we show another method how to get
information from data gained from large set of respondents. We used Formal Concept
Analysis (FCA) to evaluate data recorded by more than 4000 respondents in
IPAQ questionnaire.</p>
      <p>Formal concept analysis In its basic setting, formal concept analysis deals with
input data in the form of a table with rows corresponding to objects and columns
corresponding to attributes which describes a relationship between the objects
and attributes. The data table is formally represented by a so-called formal
context which is a triplet hX, Y, Ii where I is a binary relation between X and
Y , hx, yi ∈ I meaning that the object x has the attribute y. For each A ⊆ X
denote by A↑ a subset of Y denfied by</p>
    </sec>
    <sec id="sec-2">
      <title>Similarly, for B ⊆ Y denote by B↓ a subset of X defined by</title>
      <p>A↑ = {y | for each x ∈ A : hx, yi ∈ I}.</p>
      <p>B↓ = {x | for each y ∈ B : hx, yi ∈ I}.
That is, A↑ is the set of all attributes from Y shared by all objects from A (and
similarly for B↓). A formal concept in hX, Y, Ii is a pair hA, Bi of A ⊆ X and
B ⊆ Y satisfying A↑ = B and B↓ = A. That is, a formal concept consists of a
set A (extent) of objects which fall under the concept and a set B (intent) of
attributes which fall under the concept such that A is the set of all objects sharing
all attributes from B and, conversely, B is the collection of all attributes from Y
shared by all objects from A. The set B (X, Y, I) = {hA, Bi | A↑ = B, B↓ = A}
of all formal concepts in hX, Y, Ii can be naturally equipped with a partial order
denfied by
hA1, B1i ≤ h A2, B2i iff A1 ⊆</p>
    </sec>
    <sec id="sec-3">
      <title>A2 (or, equivalently, B2 ⊆</title>
      <p>B1).</p>
      <p>Under ≤ , B (X, Y, I) happens to be a complete lattice, called a concept lattice.</p>
      <p>
        We refer to [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for background information in formal concept analysis (FCA).
      </p>
      <p>Formal concept analysis thus treats both the individual objects and the
individual attributes as distinct entities for which there is no further information
available except for the relationship I saying which objects have which attributes.</p>
      <p>However, in case of evaluation of questionnaire, it is necessary to work with
some additional information. First, identity of one concrete object is not
interesting (respondents are often anonymous). We want to nfid out properties common
to some subsets of respondents (for example young females). Thus we have to
denfie these interesting subsets and consider only concepts which extent contain
all (or majority of) respondents from these subsets. Second, we have to calculate
with some noise in data. For example, that small number of respondents have
different properties than others in their subsets.
2</p>
      <sec id="sec-3-1">
        <title>IPAQ questionnaire</title>
        <p>In 1996, Dr. Michael Booth of Sydney, Australia, initiated a collaborative effort
to develop a valid and reliable questionnaire measuring health-related physical
activity suitable for both research and surveillance. An international group of
physical activity assessment experts were invited to form a working group,
referred to as the International Consensus Group for the Development of an
International Physical Activity Questionnaire. A year later, the consensus group came
together for a meeting at the World Health Organisation (WHO) in Geneva,
Switzerland. The purpose of the International Physical Activity Questionnaires
(IPAQ) is to provide a set of well-developed instruments that can be used
internationally to obtain comparable estimates of physical activity. In response
to the global demand for comparable and valid measures of physical activity
within and between countries, IPAQ was developed for surveillance activities
and to guide policy development related to health-enhancing physical activity
across various life domains. In IPAQ questionnaire is many attributes, such as
age, gender, education, occupation and other particularities of physical
activity (PA) and physical inactivity (PI) at representative file of Czech population
between 18 and 65 years old. In 2004 were got data for analysis PA and PI
patterns from 2300 women a 2018 men. In respect of much adventitious information
characteristic PA and PI is evaluation by ”classical” statistics with hypothesis
test almost inexhaustible.
3</p>
      </sec>
      <sec id="sec-3-2">
        <title>Concept lattices of contexts with binary relations</title>
        <p>
          In our recent papers we presented how further information additionally supplied
with the basic object-attribute data table can be utilized [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ],[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ],[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ],[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. We now
recall the basic concepts of [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>Definition 1. A formal context with a binary relation (R-context, for short) is
a structure hX, Y, I, ≡i (written also hhX, ≡i , Y, Ii) where hX, Y, Ii is a formal
context and ≡ is a binary relation on X.</p>
        <p>Remark 1. (1) We are primarily interested in case when ≡ is an equivalence
relation. Then x1 ≡ x2 means that objects x1 and x2 are equivalent from some
point of view (similar, indistuinguishable).</p>
        <p>(2) Equivalence ≡ may be supplied by an expert or may result from some
previous analysis or external source. For example, objects from X may be
partitioned by some clustering (based on attributes from Y or some other data
available) or some convention (a catalogue). Such a partition gives naturally a
rise to an equivalence relation.</p>
        <p>If ≡ represents an indistinguishability (or intended indistinguishability), it
might be desirable to consider only those formal concepts which do not separate
indistinguishable objects. We call such formal concepts compatible.
Definition 2. For an R-context hhX, ≡i , Y, Ii, a formal concept
hA, Bi ∈ B (X, Y, I) is called compatible with ≡ if for each x1, x2 ∈ X, if x1 ∈ A,
and x1 ≡ x2 or x2 ≡ x1, then x2 ∈ A.</p>
        <p>Compatible concepts are thus certain formal concepts from B (X, Y, I)
satisfying a natural restriction with respect to ≡ . The set of all formal concepts from
B (X, Y, I) which are compatible with ≡ will be denoted by B (hX, ≡i , Y, I).</p>
        <p>
          For an equivalence ≡ on X, extents of compatible formal concepts are unions
of ≡ -classes (recall that an ≡ -class corresponding to x ∈ X is a set [x]≡ = {x0 ∈
X | x ≡ x0}; the collection of all ≡ -classes is denoted by X/ ≡ ).
Theorem 1. ([
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]) B (hX, ≡i , Y, I) equipped with ≤ is a complete lattice in which
arbitrary infima coincide with infima in B (X, Y, I), i.e. it is a complete
Vsublattice of B (X, Y, I).
        </p>
        <p>It can be shown by an easy example that suprema in B (hX, ≡i , Y, I) do not
generally coincide with suprema in B (X, Y, I).</p>
      </sec>
      <sec id="sec-3-3">
        <title>P%-compatible concepts</title>
        <p>When we evaluate questionnaire, we want to nfid properties that are shared
by majority of respondents (or interesting subset of respondents, for example
all young females). Thus our previous denfiition of compatible concept is too
strict, because it is unnecessary to desire that attributes in compatible intents
are shared by all equivalent objects. In most cases it is sufficient that extent
contains only important portion(given in percents) of the class of equivalent
objects [x]≡ .</p>
        <p>Definition 3. For an R-context hhX, ≡i , Y, Ii and 0 ≤ p ≤
cept hA, Bi ∈ B (X, Y, I) is called p%-compatible with ≡
|[x]≡ ∩ A| ≥ | [x]≡ |.p/100
100, a formal
conif for each x ∈ A,</p>
        <p>This is, if object x belongs to extent, than also at least p% of others
objects from the same equivalent class must belong to extent. The set of all formal
concepts from B (X, Y, I) which are p%-compatible with ≡ will be denoted by
Bp (hX, ≡i , Y, I)</p>
        <p>The following lemma is obvious. It shows a natural result saying that the less
percents of objects from [x]≡ is sufficient, the more formal concepts satisfying
the restrictions.</p>
        <p>Lemma 1. If p1 ≤ p2 then Bp2 (hX, ≡i , Y, I) ⊆ B p1 (hX, ≡i , Y, I)
5</p>
      </sec>
      <sec id="sec-3-4">
        <title>Evaluation IPAQ questionnaire by FCA</title>
        <p>Creation of context. First step in analyse IPAQ questionnaire by FCA is creation
of context from questionnaire data table. The set of objects is set of respondent.
The set of attributes is given by queries in questionnaire (age, sex, location, BMI,
...). Because of data are not in bivalent form, we have to transform this date to
bivalent form by scaling. The expert provided this data for scaling, who assigned
borders between degrees of attribute. For example characteristic age divided to
three attributes young (age is less then 20 years), middle (age is between 21 and
55 years) and old (age is more then 55 years). The transformation to context
is very important, because bad alignment of borders can make for deformation
whole concept lattice. Part of questionnaire is in Fig. 1. Part of context is in
Fig. 2..</p>
        <p>Resulting context has 72 attributes. We can calculate concept lattice for this
context. We have lattice, which has about 21 millions concepts. It is very much
for nfiding dependencies between attributes. Because of it we try to constrain
lattice by equivalence relation and consider only p%-compatible concepts.
6</p>
      </sec>
      <sec id="sec-3-5">
        <title>Obtaining equivalence relations</title>
        <p>The key question is, how to obtain particular equivalences. The most important
is expert, who has to specify, which set of attributes is interesting for him. One
class of equivalent objects then contains all objects (respondents) that have the
same subset of interesting attributes.</p>
        <p>More formally. For a formal context hX, Y, Ii and set of interesting(important)
attributtes M ⊂ Y we denote by ≡ M the binary relation defined on X by
x1 ≡ M x2 if and only if {x1}↑ ∩ M = {x2}↑ ∩ M .</p>
        <p>In other words, x1 ≡ M x2 if and only if x1 and x2 have the same subset of
attributes from M. Obviously, ≡ M is an equivalence relation on X.</p>
        <p>In our case, expert was interested in discavering attributes, that are common
for all (or important part of) respondents from given class (for example smoking
old men).</p>
        <p>Together with expert we denfied 32 sets of important attributes, which are
from 4 main groups:
– Physical activity, age and gender of respondents.
– Physical activity, age, gender and education of respondents.
– Physical activity, age, gender and body mass index (BMI) of respondents.
– Physical activity, age, gender smoking of respondents.</p>
        <p>All above mentioned attributes are many-valued attributes with nominal scale.
Each set of many-valued attributes built up equivalent classes of respondents,
which have value of this attributes identical. We calculated constrained concept
lattices for each equivalence relation. Because of the data from respondents are
very sensitive for noise, we also built up lattices contained 90% - compatible
and 75% - compatible concepts. We delivered these constrained lattices to the
expert to analyze. He finds ”interesting” concepts, which describe dependencies
between demographic data and physical activity or inactivity. Each
compatible concept is interesting for his intent, which contains at most one value for
each many-valued important attribute. In addition to these attributes may be
in intent contained another attributes. Occurrence of such attributes is
interesting for expert, because they are shared by majority of respondents from given
equivalence class. Cardinality of extent is also interesting, because it determines
number of respondents, who have attributes in intent.</p>
        <p>We demonstrate this method on one group of attributes.
7</p>
      </sec>
      <sec id="sec-3-6">
        <title>Example</title>
        <p>Expert selected those attributes: gender, age, education and intensive
physical activity (PA). Because of gender is scaling to 2 attributes(Man, Woman),
age to 3 attributes(young, middle, old) and intensive PA to 3
attributes(belowaverage, average, above-average) we have 54 equivalent classes. Corresponding
constrained concept lattices have 188 concepts. Set of all p%-compatible
concepts contain 418 concepts (90%) and 1 449 concepts (75%). Now the expert
can analyze lattices. He choose one equivalent class. For example: SEX - man,
AGE - middle, EDUCATION - secondary, intensive physical activity (PA)
above-average. For those attributes he finds greatest(by concept lattice
ordering) concept, which intent contains all this attributes. Such concept with all
concepts, which are less create sublattice. Expert goes through this sublattice
and finds out intents, which contains another attributes then those, which
characterize given class(or group of classes). At first we analyze sublattice, which
contains 100%-compatible concepts. Corresponding sublattice is in Fig. 3.</p>
        <p>This sublattice has only smallest and greatest element. There is not
another concept in this sublattice. It is causing by requirment, that all
objectsrespondents from equivalent class have to be contained in concept. For expert
is important intent of greatest concept, because in it are all atribututes
common for all respondents from given class. In this example we can see, that there
are only attributtes, which determine given equivalente class. More interesting
is lattice contained 90% - compatible concepts. Corresponding sublattice is in
Fig. 4.</p>
        <p>There are 3 aditionally concepts. First includes 569 respondents (it is 99%
from all members of equivalent class), who have value of attribute SITTING
equal to low. It conrfim expecting, that respondents with high intensive PA
sitting low. Second concept includes respondents, who have value of attribute
NATIONALITY equal to Czech. This fact we would interprete that only Czech
respondents have high intensive PA. Really it means, that majority of all
respondents had Czech nationality. Third concept is inmfium of previous two concepts.</p>
        <p>The largest sublattice is from lattice contained 75% - compatible concepts.
Corresponding sublattice is in Fig. 5.</p>
        <p>This sublattice has some interesting concepts. For example the concept, which
include 457 respondents (it is 79% from all members of equivalent class) with
value of attribute SPORT ACTIVITY equal to yes, value of attribute SITTING
equal to low and value of attribute NATIONALITY equal to Czech. We can
deEvaluation of IPAQ questionnaire by FCA
67
SEX - man,</p>
        <p>AGE - middle,</p>
        <p>EDUCATION - secondary,
INTENSIVE PA - above-average
duce form this concept, that above-average physical activity is closely associated
with fact, that person sits low and does some sport activity during his leisure
time.
8</p>
      </sec>
      <sec id="sec-3-7">
        <title>Future research</title>
        <p>
          We now comment on some further topics and future research (some of these are
studied in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]).
        </p>
        <p>– A concept lattice may be thought of as a hierarchical clustering scheme.</p>
        <p>
          The partition corresponding to ≡ represents another clustering (more
generally, we can think of a hierarchical clustering scheme). Several interesting
problems arise here (constraining one clustering by the other, comparing the
clusterings, measuring their mutual consistency, etc.), a work is in progress.
– There is more ways of creating context from questionnaire. Naturally way
is using of fuzzy logic and fuzzy sets. We will experiment with creating of
fuzzy context and methods of constraining resulting fuzzy concept lattice by
fuzzy relations. Main ideas of fuzzy concept analysis are in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ],[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
9
        </p>
      </sec>
      <sec id="sec-3-8">
        <title>Conclusion</title>
        <p>Our way of evaluating gives a new point of view on data contained in
questionnaire. On the base of first response from expert, who worked with our results,
we can say, that our approache may be usefull for finding dependencies between
properties of respondents of questionnaire.</p>
        <p>Acknowledgment Supported by grant No. 1ET101370417 of the GA AV CR.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>G.</given-names>
            <surname>Ammons</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mandelin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bodik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Larus</surname>
          </string-name>
          .
          <article-title>Debugging temporal specifications with concept analysis</article-title>
          .
          <source>In Proc. ACM SIGPLAN'03 Conference on Programming Language Design and Implementation</source>
          , pages
          <fpage>182</fpage>
          -
          <lpage>195</lpage>
          , San Diego, CA,
          <year>June 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. R Belˇohal´vek, V. Sklenra,ˇ´
          <string-name>
            <given-names>J.</given-names>
            <surname>Zacpal</surname>
          </string-name>
          .
          <article-title>Formal concept analysis with hierarchically ordered attributes</article-title>
          .
          <source>Int. J. General Systems</source>
          <volume>33</volume>
          (
          <issue>4</issue>
          )(
          <year>2004</year>
          ),
          <fpage>283</fpage>
          -
          <lpage>294</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Belˇohal´vek R.:
          <source>Fuzzy Relational Systems: Foundations and Principles</source>
          . Kluwer Academic/Plenum Publishers, New York,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Belˇohal´vek R.:
          <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="ref5">
        <mixed-citation>
          5. Belˇohal´vek R., Sklenraˇ´ V.:
          <article-title>Formal Concept Analysis Constrained by ADF</article-title>
          .
          <source>In: Proc. ICFCA</source>
          <year>2005</year>
          , pp.
          <fpage>176</fpage>
          -
          <lpage>191</lpage>
          . [ISBN 3-540-24525-1]
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Belˇohal´vek R., Sklenraˇ´ V.,
          <string-name>
            <surname>Zacpal</surname>
            <given-names>J</given-names>
          </string-name>
          .:
          <article-title>Concept lattices constrained by equivalence relations</article-title>
          .
          <source>In: Proc. CLA</source>
          <year>2004</year>
          , pp.
          <fpage>58</fpage>
          -
          <lpage>66</lpage>
          . [ISBN 80-248-0597-9]
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Belˇohal´vek R., Sklenraˇ´ V.,
          <string-name>
            <surname>Zacpal</surname>
            <given-names>J</given-names>
          </string-name>
          .:
          <article-title>Concept lattices constrained by systems of partitions</article-title>
          .
          <source>In: Proc. Znalosti</source>
          <year>2005</year>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>C.</given-names>
            <surname>Carpineto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Romano</surname>
          </string-name>
          .
          <article-title>A lattice conceptual clustering system and its application to browsing retrieval</article-title>
          .
          <source>Machine Learning</source>
          <volume>24</volume>
          :
          <fpage>95</fpage>
          -
          <lpage>122</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>R.</given-names>
            <surname>Cole</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Eklund</surname>
          </string-name>
          .
          <article-title>Scalability in formal context analysis: a case study using medical texts</article-title>
          .
          <source>Computational Intelligence</source>
          <volume>15</volume>
          :
          <fpage>11</fpage>
          -
          <lpage>27</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. U. Dekel,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gill</surname>
          </string-name>
          .
          <article-title>Visualizing class interfaces with formal concept analysis</article-title>
          .
          <source>In OOPSLA'03</source>
          , pages
          <fpage>288</fpage>
          -
          <lpage>289</lpage>
          , Anaheim, CA,
          <year>October 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>B.</given-names>
            <surname>Ganter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Formal Concept Analysis</article-title>
          .
          <source>Mathematical Foundations</source>
          . Springer-Verlag, Berlin,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>O. S.</given-names>
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. A. Obiedkov.</surname>
          </string-name>
          <article-title>Comparing performance of algorithms for generating concept lattices</article-title>
          .
          <source>J. Exp. Theor. Artif. Intelligence</source>
          <volume>14</volume>
          (
          <issue>2</issue>
          /3):
          <fpage>189</fpage>
          -
          <lpage>216</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>D.</given-names>
            <surname>Maier</surname>
          </string-name>
          .
          <source>The Theory of Relational</source>
          Databases. Computer Science Press, Rockville,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>O.</given-names>
            <surname>Ore</surname>
          </string-name>
          .
          <article-title>Galois connections</article-title>
          .
          <source>Trans. Amer. Math. Soc</source>
          .
          <volume>55</volume>
          :
          <fpage>493</fpage>
          -
          <lpage>513</lpage>
          ,
          <year>1944</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. G. Stumme,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Conceptual knowledge discovery in databases using formal concept analysis methods</article-title>
          . In J. M.
          <string-name>
            <surname>Zytkow</surname>
          </string-name>
          , M. Quafofou (Eds.).
          <source>Principles of Data Mining and Knowledge Discovery. LNAI 1510</source>
          , pages
          <fpage>450</fpage>
          -
          <lpage>458</lpage>
          , Springer, Heidelberg,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>P.</given-names>
            <surname>Valtchev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Missaoui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Godin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Meridji</surname>
          </string-name>
          .
          <article-title>Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory</article-title>
          .
          <source>J. Exp. Theor. Artif. Intelligence</source>
          <volume>14</volume>
          (
          <issue>2</issue>
          /3):
          <fpage>115</fpage>
          -
          <lpage>142</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>