<!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>RCAExplore, a FCA based Tool to Explore Relational Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xavier Dolques</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Agnes Braud</string-name>
          <email>agnes.braud@unistra.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marianne Huchard</string-name>
          <email>huchard@lirmm.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Florence Le Ber</string-name>
          <email>florence.leberg@engees.unistra.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>(1) ICube, Universite de Strasbourg, ENGEES</institution>
          ,
          <addr-line>CNRS</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Relational Concept Anaysis (RCA) basics</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Relational Concept Analysis (RCA) is one variant of Formal Concept Analysis for multi-relational dataset exploration. The tool RCAExplore is an implementation of the RCA process where several choices can be made before each iteration: the structure to be used (concept lattice, AOC-Poset, Iceberg lattice), the scaling quanti er (exist, forall, contains, percentage-quanti ers, etc.), and the considered formal and relational contexts. RCAExplore was developed during Fresqueau ANR 11 MONU 14 project, in order to explore relational hydroecological data, and has also been used on several datasets in di erent other domains. The source code and a standalone jar application are available online. An integration of the tool is ongoing within a platform for data exploration and knowledge representation.</p>
      </abstract>
      <kwd-group>
        <kwd>Data exploration</kwd>
        <kwd>Concept Analysis</kwd>
        <kwd>Formal Concept Analysis</kwd>
        <kwd>Relational</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>traits of
life traits taxons taxons
presence of
taxons [1..19]
presence of
taxons [20..99]</p>
      <p>presence of
taxons [100..+∞[
physico-chemical
characters lvl 1
physico-chemical
characters lvl 2
stations watercourse kind
physico-chemical
characters
watercourse
characteristics</p>
      <p>Exploring such a relational dataset allows to answer several questions, e.g.
what are the links between life traits of the taxons and values of physico-chemical
parameters on river stations? Answers can take several forms, such as extracting
rules that involve the relations, or grouping objects from the di erent categories
(like physico-chemical parameters, or taxons) depending on their attributes and
on the objects of another category they are connected with.</p>
      <p>RCA can be used for such tasks. First, the user has to build object-attribute
contexts, here, life traits, taxons, stations, physico-chemical characters
and watercourse characteristics. Relations between objects are then
formalised into seven object-object contexts, e.g. presence of taxons1-19 goes
from taxons to stations: a taxon is linked to a station, if the sample size for
this taxon on this station is between 1 and 19 (see RCAExplore editor open on
this relation, in Fig. 3).</p>
      <p>The principle of RCA consists in integrating object-object relations as new
attributes (called relational attributes ) in formal contexts thanks to scaling
quanti ers, such as the existential (exist ) and universal strict (exist+forall ) scaling
quanti ers. It produces iteratively a set of concept lattices (one lattice per object
category) interconnected through relational information. The concepts in a given
lattice group objects according to the shared attributes and to the connections
they have with objects of another category. The result is a family of concept
lattices where concepts of a lattice are linked to concepts of another lattice,
as sketched out in Fig. 2: a concept Cs reveal a group of stations (1) where at
least one physico-chemical value from a group of physico-chemical characteristics
(concept Cp) has been measured with level 2, (2) being in a kind of watercourse
from a watercourse characteristics group (concept Cw), (3) hosting more than
60% of numerous (100+) taxon types from a group (concept Ct) whose elements
have at least one trait from a group of life traits (concept Cl).</p>
      <p>
        The process is as follows: rst, lattices are built on the object-attribute
contexts Ki; second, object-attribute contexts are extended with new attributes
built using the object-object relations and the concept sets of the lattices; third,
new lattices are built on the extended contexts. For instance let K = fK1; K2g,
R = fRg, where K1 = (G1; M1; I1), K2 = (G2; M2; I2) and R = (G1; G2; r). Let
C = (X; Y ) be a concept of the K2 lattice (i.e. X G2); 9 is the existential
quanti er. A relational attribute 9r(C) is added to the K1 context, and is owned
by an object g 2 G1 if r(g) \ X 6= ;. A whole construction process consists in
building a nite sequence of contexts and concept lattices based on (K; R) and
chosen scaling quanti ers. The last sequence is obtained when the xed point is
reached. Details about RCA are given in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>RCAExplore</title>
      <p>RCAExplore1 is a reference implementation of RCA o ering new ways of dealing
with relations. RCAExplore is developed in Java. It proposes a relational context
family editor (see Fig. 3, highlighting an object-object context linking taxons
and stations), an interactive concept lattice family generator (see Fig. 4), and
a concept lattice family browser. The tool is developed under the LGPL license.</p>
      <p>The novelty behind RCAExplore, with respect to other RCA tools such as
Galicia2, is to provide, besides an automatic mode, a manual mode where it
is possible to modify the data considered before each new iteration step of the
RCA process. At each step of the process, the user can choose (Fig. 4):</p>
      <sec id="sec-2-1">
        <title>1 http://dataqual.engees.unistra.fr/logiciels/rcaExplore</title>
        <p>2 http://www.iro.umontreal.ca/ galicia/
{ the conceptual structure (concept lattice, AOC-poset, Iceberg lattice),
{ the scaling quanti er (in f9, 98, 9 , 98 n%, 9 n%g, n = 30 and n = 60),
{ the considered contexts (among the available object-attribute and
objectobject contexts),
{ if they want the simpli ed or the full intents and extents, and other options.
The tool checks whether the choices made by the user are consistent. For
example, a user cannot choose at step n a relational context with the target formal
context K, if K has not been chosen at step n 1. Files are generated at each
step, that contain all the conceptual structures of this step in a format (.svg
and .dot, from Graphviz3) which is readable and exploitable by other programs,
and it is possible to also see the extended contexts in LATEX and HTML. A trace
le records the choices made during the process, and can be used to replay the
same con guration in automatic mode, namely without again manually
selecting structures, quanti ers or contexts. A visualization option also allows to see
graphically, at the end of the process, the conceptual structures that have been
generated at all steps.</p>
        <p>The concept lattice family browser allows, from a given step number, a given
context and a given concept name, to look at the parents, children, intent,
simpli ed intent and extent of a concept. If two attributes are selected in the
simpli ed intent and the intent respectively, the corresponding implication rule is
displayed.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Application examples</title>
      <p>As previously introduced, RCAExplore has been primarily used to explore
hydroecological data in the framework of Fresqueau ANR 11 MONU 14 project.
The question was to link the characteristics (traits) of taxons to the
physicochemical state of a river station where they live. Data have been explored
according to di erent paths: focusing on river stations and trying to characterize them
both with taxon traits and physico-chemical parameters, focusing on speci c
relations (e.g. presence of rare taxons in river stations) by varying and combining</p>
      <sec id="sec-3-1">
        <title>3 https://www.graphviz.org/</title>
        <p>
          Fig. 4. Choosing the conceptual structure and scaling operators to be used
the scaling operators, etc. Rules have been computed [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], e.g. a straightforward
rule4, could be (meaning that if a station hosts many of numerous taxon types
that appreciate slow current, then the river has calm water):
9
!
60% presence[100;::+1[(9traits of taxons(appreciate slow current))
9watercourse kind(calm water)
        </p>
        <p>
          The features of RCAExplore have been useful to support FCA and several
research experiences, to mention just a few: e ect of varying the scaling quanti ers
on a subset of the Fresqueau dataset is shown in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], assessing the relevance of
using AOC-posets during gradual class model refactoring has been shown in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]
on industrial UML and Java class models. In [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], the authors use RCAExplore to
assess the scalability of RCA on connected product comparison matrices.
RCAExplore has also been used to analyse spatio-temporal data characterizing river
networks [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and is currently used to teach FCA and RCA at Montpellier and
Strasbourg Universities. It is under integration in the COGUI platform5 under
the guidance of Alain Gutierrez.
4 Such straightforward rules are useful to understand and to build con dence on other,
more informative, rules.
5 https://www.lirmm.fr/cogui/3/
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Braud</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dolques</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Le</given-names>
            <surname>Ber</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Generalization e ect of quanti ers in a classi cation based on relational concept analysis</article-title>
          .
          <source>Knowl.-Based Syst</source>
          .
          <volume>160</volume>
          ,
          <issue>119</issue>
          {
          <fpage>135</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Carbonnel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Variability representation in product lines using concept lattices: Feasibility study with descriptions from wikipedia's product comparison matrices</article-title>
          .
          <source>In: Proc. of the Int. Ws. on Formal Concept Analysis and Applications</source>
          ,
          <source>FCA&amp;A</source>
          <year>2015</year>
          ,
          <article-title>co-located with (ICFCA 2015)</article-title>
          . pp.
          <volume>93</volume>
          {
          <issue>108</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dolques</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Ber</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grac</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis</article-title>
          .
          <source>Int. J. General Systems</source>
          <volume>45</volume>
          (
          <issue>2</issue>
          ),
          <volume>187</volume>
          {
          <fpage>210</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dolques</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Ber</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nebut</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Relational Concept Analysis for Relational Data Exploration</article-title>
          .
          <source>Adv. in Know. Disc. and Manag</source>
          .
          <volume>5</volume>
          ,
          <issue>55</issue>
          {
          <fpage>77</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <source>Formal Concept Analysis: Mathematical Foundations</source>
          . Springer Verlag (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hacene</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valtchev</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Relational concept analysis: mining concept lattices from multi-relational data</article-title>
          .
          <source>Ann. Math. Artif. Intell</source>
          .
          <volume>67</volume>
          (
          <issue>1</issue>
          ),
          <volume>81</volume>
          {
          <fpage>108</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Miralles</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molla</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nebut</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deruelle</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Derras</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Class Model Normalization - Outperforming Formal Concept Analysis</surname>
          </string-name>
          <article-title>Approaches with AOC-posets</article-title>
          .
          <source>In: Proc. of the 12th Int. Conf. on Concept Lattices and Their Applications (CLA'15)</source>
          . pp.
          <volume>111</volume>
          {
          <issue>122</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Nica</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Braud</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Ber</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Exploring Heterogeneous Sequential Data on River Networks with Relational Concept Analysis</article-title>
          .
          <source>In: Proc. of the 23rd Int. Conf. on Conceptual Structures (ICCS'18)</source>
          . pp.
          <volume>152</volume>
          {
          <fpage>166</fpage>
          . LNAI 10872 (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>