=Paper=
{{Paper
|id=None
|storemode=property
|title=Relational Concept Analysis: A Synthesis and Open Questions
|pdfUrl=https://ceur-ws.org/Vol-939/paper1.pdf
|volume=Vol-939
|dblpUrl=https://dblp.org/rec/conf/ecai/Huchard12
}}
==Relational Concept Analysis: A Synthesis and Open Questions==
<pdf width="1500px">https://ceur-ws.org/Vol-939/paper1.pdf</pdf>
<pre>
                                  Invited Talk

Relational Concept Analysis: a synthesis and open questions
                           Marianne Huchard
    LIRMM, Université de Montpellier 2 and CNRS, Montpellier, France,
                      marianne.huchard@lirmm.fr


                                         Abstract
       Relational Concept Analysis (RCA) builds conceptual structures on sets of objects
  connected by sets of links, following an underlying entity-relationship diagram. These
  conceptual structures (concept lattice families) are composed of several concept lattices
  (one for each object set one wants to focus on) connected by relational attributes of var-
  ious strengths. Concept lattice families can be read to extract interconnected relevant
  object groups and classifications as well as to derive implication rules. The RCA algo-
  rithm uses classical concept lattice building algorithms and a relational scaling step. In
  this talk, we recall the main principles of RCA and we elaborate on several issues (some
  of which are totally open) including querying relational data with RCA, looking at spe-
  cific relational schemes, convergence of RCA when disturbing the classical algorithmic
  schema, and understanding the growth process of concepts.

</pre>