<!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>A Conceptual-KDD approach and its application to cultural heritage</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Renzo Stanley</string-name>
          <email>rstanley@inf.utfsm.cl</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hern´an Astudillo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V´ıctor Codocedo</string-name>
          <email>victor.codocedo@loria.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Amedeo Napoli</string-name>
          <email>amedeo.napoli@loria.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LORIA</institution>
          ,
          <addr-line>BP 70239, F-54506 Vandoeuvre-l`es-Nancy</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidad T ́ecnica Federico Santa Mar ́ıa</institution>
          ,
          <addr-line>Av. Espan ̃a 1680. Valpara ́ıso</addr-line>
          ,
          <country country="CL">Chile</country>
        </aff>
      </contrib-group>
      <fpage>163</fpage>
      <lpage>174</lpage>
      <abstract>
        <p>Several governmental and non-governmental organizations (NGOs), motivated by the UNESCO have undertaken the task of documenting the intangible cultural heritage of their communities. However, this has proven to be a difficult task. In this work we present a conceptual knowledge discovery in databases (CKDD) approach to aid a particular organization in this task (which has already started). Because of the dynamism of the cultural heritage domain, the design of the database used to store the documentation data has become obsolete. We propose to redesign the database (actually, its schema) to unveil independent modules of information collaboratively created by different domain experts. Finally, we present a straightforward method to convert the redesigned data schema into an ontological model which can be used for integration and publication purposes.</p>
      </abstract>
      <kwd-group>
        <kwd>Formal concept analysis</kwd>
        <kwd>Knowledge discovery in databases</kwd>
        <kwd>Conceptual knowledge discovery</kwd>
        <kwd>Intangible Cultural Heritage</kwd>
        <kwd>Documentation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The Chilean National Council of Culture and Arts1 (CNCA) has undergone
the mission of documenting the intangible cultural heritage (ICH) of different
small zones of the country in the context of a world-wide UNESCO2 crusade to
incentivize governments and NGOs to properly maintain our cultural knowledge.
The ICH, as drafted in the Convention for the Safeguarding of the Intangible
Cultural Heritage3 refers to “traditions or living expressions inherited from our
ancestors and passed on to our descendants, such as oral traditions, performing
arts, social practices, rituals, festive events, knowledge and practices concerning
nature and the universe or the knowledge and skills to produce traditional crafts”.
c paper author(s), 2013. Published in Manuel Ojeda-Aciego, Jan Outrata (Eds.): CLA
2013, pp. 163{174, ISBN 978{2{7466{6566{8, Laboratory L3i, University of La
Rochelle, 2013. Copying permitted only for private and academic purposes.
To survey the ICH, the CNCA maintains several “documenters” who meet
artists, artisans and other actors of the folkloric stage. Each documenter fills a
“file” containing several semi-structured and text-free fields which are later
registered in a relational database (DB). This database is later consulted by curators
(usually domain experts) who fix problems in data definitions or storage. The
CNCA has requested help in two specific aspects. Given the difficulty of
documenting very different domains in ICH, the design of a data schema to support
its documentation is a hard task which leads to inconsistencies in its model.
Currently, the data schema used by the CNCA was designed by a computer
engineer with some knowledge on the domain. However, as the ICH
documentation process expanded to other cultural domains (“music”, “folk festivals”,
“crafts”, etc.) the data schema became too general and some modifications were
requested to enable a higher level of details. The CNCA requested to analyse the
data schema in order to find “modular” partitions on the model corresponding
to different domains in ICH. Thus, each module can be maintained by a related
domain-expert avoiding the risk of information conflict.</p>
      <p>The second request derives from the fact that, since the ICH documentation
is a multi-organizational endeavour motivated by UNESCO, it is expected that
data collected by CNCA will be integrated with other databases later on. Because
of this, CNCA has asked aid to obtain an ontological schema from its current
data schema which can be used for linked data publication.</p>
      <p>
        In this work we propose a novel knowledge discovery in databases process
guided by formal concept analysis (also, referred to as conceptual knowledge
discovery in databases CKDD [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) approach to deal with both requirements. We
analyse the current data schema definition to construct a concept lattice through
FCA in which we apply different techniques to find the modules representing
ICH domains. The contributions of this work are firstly, to present a real-world
experience using FCA and concept lattices to achieve a task as important as
heritage documentation and secondly, the description of a process to elicit an
ontological schema from a relational DB schema which can be of benefit in
different applications.
      </p>
      <p>The remainder of this article is organised as follows: Section 2 presents the
CKDD process while Sections 3, 4 and 5 detail each of its steps. Section 6
describes the case study of applying the CKDD process over the CNCA database
for ICH documentation. Finally, Section 7 presents a discussion on related work
and concludes the paper.
2</p>
      <p>Formal concept analysis and knowledge discovery in
databases.</p>
      <p>
        We propose an iterative and human-centred approach to overcome both
requirements of the CNCA based on Conceptual Knowledge Discovery in Databases
(CKDD) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. CKDD is a tool to support humans in the discovery and extraction
of knowledge from large collections of data where the conceptual representation
of knowledge is a key aspect [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>Formal context with expert feedback</p>
      <p>Data
Database database Preprocessing
schema
formal
context</p>
      <p>Formal Concept</p>
      <p>Analysis
concept lattice
formal context</p>
      <p>Interpretation ontological Knowledge base
schema
tasks
• Schema processing
• Attribute integration
• Relational Attribute scaling</p>
      <p>tasks
• Extensional stability calculation
• Attribute-concepts identification</p>
      <p>tasks
•• QMuoedsutiloanrizcarteiaotnion/answering
• Ontological schema creation</p>
      <p>
        First Step of the CKKD process: Data preprocessing
The first step starts by extracting the database schema and ends when it is
converted to a formal context. Currently, most of the relational database
management systems are based on the relational model constituted by tables and
their relations (there are actually more elements in a relational model which are
not of first interest here). We provide an adapted definition of the relational
schema model as described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
3.1
      </p>
      <p>Relational data schema model
A relational schema S = {R1, R2, ..., R|S|} is defined as a set of tables or “relation
schemas” Ri(A1, A2, ..., Ani ) consisting of a table name Ri and a list of ni fields
Aj which define value assignments of the domain dom(Aj ) to an entry in the
table. The notation Ri.Aj stands for the field Aj in table Ri. An entry in a table
is defined as an ordered n-tuple of values denoted by t[Ri] =&lt; v1, v2, ..., vni &gt;
where each value is denoted as t[Aj ] = vj ∈ dom(Aj ) ∪ {N U LL}. N U LL
indicates that the value is unknown for the field in the entry. The relation state
r(Ri) = {t1, t2, ..., tri } of table Ri denotes its total set of entries. In a table Ri,
the set of fields SK ⊂ Ri denotes a superkey which identifies a tuple as unique.
A primary key P K is defined as a superkey where |SK| = 1 and |.| denotes set
cardinality, i.e. P K is a single field and we say that Ri.P K is the primary key of
table Ri the value of which unequivocally identifies an entry in table Ri. Finally,
a field R1.F K is called a foreign key iff R1.F K = R2.P K which indicates a
relation between R1 and R2. In the particular case of the CNCA database for ICH
documentation, a notion of inheritance of tables is supported. We define this as</p>
      <p>Ritual  
id_ritual  
name  
descrip4on  
views  
place  
id_agent  </p>
      <p>Agent  
id_agent  
rut_number  
background  
phone  
name  
address  
email  </p>
      <p>Fes+ve  Event  
id_fest  
name  
descrip4on  
background  
views  
dura4on  
id_agent  
Individual  Agent  
birthday  
gender  </p>
      <p>Collec+ve  Agent  
establishment  
gender_composi4on  
follows: table R1 inherits from table R2 iff R2 ⊂ R1 and R1.P K = R2.P K, i.e.
table R1 contains all the fields in table R2 and they share the same primary key.</p>
      <p>Figure 2 illustrates a data schema example S = {Festive Event , Ritual ,
Agent , Individual Agent , Collective Agent } where arrows represent relation
between two tables and a line with a rhombus at the end represents inheritance.
Table Ritual can be represented as Ritual(id ritual, name, description, views,
place, id agent) where dom(name) = string, Ritual.id ritual is the primary key
of table Ritual and Ritual.id agent is a foreign key relating Ritual with Agent .
The example also shows that Individual Agent and Collective Agent inherit from
table Agent , meaning that all the attributes from table Agent are also present
in tables Individual Agent and Collective Agent .</p>
      <p>Formal context K is composed by tables in the set S (all the tables or a
sub-set of them), the set of fields A (composed by the set of all fields from all
tables considered in S) and the relation set I (the relations between tables in S
and their fields in A). Notice that we define a formal context by making the
correspondences object-table and attribute-field. To avoid confusions, in this work
we differentiate between these correspondences by using different font faces for
objects or attributes and for tables or fields. Along with the formal
context, we also define the following rules of attribute integration based on the
characteristics of the fields:
– The special attribute id represents all primary keys:</p>
      <p>id ∈ A , (Ri, id) ∈ I ∀Ri ∈ S.
– Fields with the same name are integrated into a single attribute (e.g.
attribute name represents Agent .name and Ritual .name)
3.3</p>
      <p>
        Relational attribute scaling
In the context of FCA, foreign keys correspond to relational attributes. For
example, in Figure 2 we do not say “table Ritual contains a foreign key” (as
in the case of Ritual contains a primary key), but rather “Ritual is related to
Agent by a foreign key”. Such kind of attributes cannot be included in a binary
formal context. To deal with relational attributes, we scale them and treat them
as normal attributes in the lines of [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We do so by prepending the prefix
related to: to the name of the table where the foreign key directs to (e.g.
in the formal context in Table 1, we say that the object Ritual contains the
attribute related to:Agent). This is formalized as
      </p>
      <p>Rj.F K = Ri.P K; Ri, Rj ∈ S ⇒ related to:Ri ∈ A ∧</p>
      <p>(Rj,related to:Ri) ∈ I</p>
      <p>In the case the table Ri pointed to by a foreign key do not exist in S, then
we simply do not take into consideration that table nor we create the scaled
relation related to:Ri.
Agent × × × × × × ×
IndividualAgent × × × × × × ×
CollectiveAgent × × × × × × ×
FestiveEvent × × × × × ×
Ritual × × × × × ×
× ×
× ×
×
This step receives a formal context and ends when a concept lattice is
constructed. Figure 3(a) shows the concept lattice calculated for the formal context
in Table 1. Along with the concept lattice, the original formal context is sent
to step 3 to allow modifications in it for further iterations of the process. We
develop two tasks related to the identification of elements which would help in
the redesign of the data schema.
4.1</p>
      <p>
        Attribute concept identification
The attribute concept of attribute Aj is defined by μAj = (A0j , A0j0), where ()0
is the derivation operator in FCA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The identification of attribute concepts
is rather simple and we do it by navigating from the top to the bottom of the
lattice. Attribute concepts are the most general concepts in the lattice containing
a given attribute. In our case, the attribute concept of a given field contains the
largest set of tables related to it. This is important since, as we will describe
in the next step of interpretation, we process each field separately in order to
create the ontological schema. Attribute concepts make this simpler as for each
field we only need one concept and not the whole lattice.
4.2
      </p>
      <p>
        Extensional stability calculation:
Since we are looking to enhance the design of a data schema in the database,
within the lattice we would like to have only those concepts which group together
in their extents tables of the same domain. This would allow us to address the
modularization of information per domain issue which is one of the request of the
CNCA, assuming that tables in the same domain are likely to share similar fields.
In order to do so, we use the notion of extensional stability as firstly described in
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and later in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] as a way to measure “the probability of a concept to preserve
its extent after leaving out an arbitrary number of attributes”.
5
      </p>
      <p>Third Step of the CKDD process: Interpretation
The final step receives a formal context and its associated concept lattice where
each attribute concept is identified and each formal concept contains an
extensional stability value. Since CKDD is an iterative process, this step has two
possible outputs. If the expert decides to make another iteration, the process
goes back to step 2 sending a modified version of the formal context received
including feedback of the expert. If the expert decides to end the process, this
will create an “ontological schema” which will be stored in a knowledge base
and the process ends. For the iteration, there are two tasks to perform: Question
creation/answering and Modularization. The task which transforms the concept
lattice into an ontological schema ends the process. A further step of annotation
which converts the entries in tables into linked data using the ontological schema
can be considered, but for the sake of space we have left it out of this paper.</p>
      <p>Question creation and answering
We use extensional stability as an indicator of how related are tables within a
given concept extent. A lower stability indicates that those tables are grouped
more as an accident (for example, because of the misuse of a single (or several)
field name(s)) rather than because they belong to the same domain. We look
for unstable attribute concepts because they are the most general concepts
containing a given attribute, so they are those that relate more tables together.
Moreover, we can create questions for the expert to answer in the hope they
provide information to “break” the attribute concept and separate domains.</p>
      <p>Consider the example in Figure 3(a) in which two domains are illustrated.
The first relates events while the second relates people and communities. The
most unstable attribute concepts (extensional stability of 0.5) correspond to
those labelled with the attributes background and place. In the case of place,
it only contains one table meaning that “breaking” this concept does not help
in separating domains4. The attribute concept of background contains four
objects, namely FestiveEvent, Agent, IndividualAgent and CollectiveAgent
for which FestiveEvent belongs to a different domain than the others.</p>
      <p>Regarding the questions posed to the expert, we have:
1. Would you like to assign attribute to all the objects?
2. Would you like to eliminate the attribute from a single/a set of objects/s?
3. Would you like to split attribute into different attributes for different
objects?</p>
      <p>If the expert selects option 1, the attribute will be shared by every object
and hence, it will be placed as part of the intent of the top of the lattice (like id
and name in Figure 3(a)). In the case of option 2, the attribute is erased from the
formal context and hence, its attribute concept is removed. With option 3, we
can recommend the partition of the attribute by looking at the sub-concepts of
the attribute concept. Then, a new attribute is created for each partition made
while the original attribute disappears. Consider Ai to be the attribute for which
the expert has to answer a question. For each option we can define a new formal
context as follows:
1. Option 1: KA = (S, A, I ∪ {(R, Ai); ∀R ∈ S})
2. Option 2: KA = (S, A\{Ai}, I\{(R, Ai; )∀R ∈ S})
3. Option 3: Let Aj be the splits of attribute Ai assigned to objects Rj, then
KA = (S, (A\{Ai}) ∪ Aj, I\{(R, Ai); ∀R ∈ S} ∪ {(Rj, Aj)})</p>
      <p>In the example, the expert selected option 3 splitting background into an
attribute for FestiveEvent (practice background) and another for the Agents
(records). This example is actually an extract of a real case study where the
4 A low stability in a singled-object attribute concept may indicate that the table
should be split in two or more different tables. We do not address this issue in this
work
expert realized that the term “background” was used with multiple meanings
and that it should be separated into an attribute registering the history of past
events and another for the official records of people. Figure 3(b) presents the
concept lattice created from the formal context yielded by this decision.
5.2</p>
      <p>Modularization
The expert may choose to perform this task disregarding answering questions.
We start from the already processed concept lattice L and find its sublattices
such as Li ∩ Lj = {&gt;, ⊥} where Li, Lj are sublattices of L and &gt;, ⊥ represent
the top and the bottom of L respectively. We achieve this by obtaining the
connected graphs from the lattice once &gt; and ⊥ are removed. Each sublattice
is a candidate to represent a domain which must be labelled by the expert.
The label is included into the formal context as a special attribute of the form
domain:Label with relations to all the objects in the sublattice. The concept
lattice is later recalculated. Figure 3(b) depicts the final form of the lattice for
the running example. Finally, the expert may also be interested in merging more
than one sublattice into a single domain. In that case, the special attribute is
added to all objects in the set of sublattices selected by the expert.
(a) Concept lattice created from the data (b) Concept lattice after the expert’s
deschema example cision (attribute background split into
practice background and records)
including domain labels
The final task of the process derives an ontological model from the concept lattice
that can be used for data integration and linked data publication. This is done
Concept Element Triples created
&gt; = (S, ∅) Ri ∈ S Ri rdf:type rdfs:Class
e.g. cnca:Agent rdf:type rdfs:Class
⊥ = (∅, A) Aj ∈ A Aj rdf:type rdfs:Property</p>
      <p>Aj rdfs:range rdfs:Literal
e.g. cnca:establishment rdf:type rdfs:Property</p>
      <p>cnca:establishment rdfs:range rdfs:Literal
⊥ = (∅, A) related to:Ri ∈ A related to:Ri rdf:type rdfs:Property
related to:Ri rdf:range rdfs:Ri
e.g. cnca:participant rdf:type rdfs:Property
cnca:participant rdfs:range cnca:Agent
⊥ = (∅, A) domain:Label ∈ A cnca:Label rdf:type cnca:Domain
cnca:Domain rdf:type rdfs:Class
cnca:in domain rdf:type rdfs:Property
e.g. cnca:People rdf:type cnca:Domain
μAj = (A0j, A0j0) Ri ∈ A0j cnca:Aj rdfs:domain cnca:Ri
e.g. cnca:participant rdfs:domain cnca:Ritual
μAj = (A0j, A0j0) (Aj =domain:Label and cnca:Ri cnca:in domain cnca:Label</p>
      <p>
        Ri ∈ A0j) e.g. cnca:Agent cnca:in domain cnca:People
by creating a set of RDF triples5 for given elements in the formal concepts of
the lattice. Table 2 shows this conversion where for example, in the first row it
is shown that for the top concept, all the tables in its extent are modelled as
RDFS classes6 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. For simplicity purposes, Table 2 only presents a part of the
total set of triples created considering the top &gt;, the bottom ⊥ and attribute
μAj concepts.
6
      </p>
      <p>Case study: CNCA Intangible Cultural Heritage
Database
The database schema of the CNCA for ICH documentation consists of nearly
300 tables, however only 27 tables were selected by the experts on the basis of
their representative and multi-disciplinary knowledge. Selected tables consider
descriptions of agents, collective agents, festive events, culinary manifestations,
geolocations and more. The formal context derived from the database contains 27
objects, 56 attributes, and 25 relational attributes. Figure 4 depicts the concept
lattice built from this formal context.
5 Resource Description Framework (RDF) is a standard specification for semantic web
and linked data based on triples http://www.w3.org/RDF/.
6 Resource Description Framework Schema (RDFS) is an extension of RDF which
supports classes, properties and more complex definitions.</p>
      <p>Table 3 shows the actions taken by the domain expert during 9 iterations
of the CKDD process. We distinguished between facts, questions and actions.
Facts represent database assertions which are displayed for helping the expert
in decision taking. For example, in iteration 1 the expert is presented with the
facts: “71% of the objects contain the attribute name” and “The attribute name
has a value in 100% of the entries in the objects where it appears”. The first
fact helps the expert to understand that name is actually very common among
the objects and can easily be extended to the whole object set. The second fact
combines information from the DB and the concept lattice to tell the expert that
in all the entries t which contain the field name (represented by the attribute
name), the value t[name] is different than N U LL. This indicates him that the
attribute should not be removed from any object. Questions and actions were
already detailed in Section 5.1.</p>
      <p>In iterations 3 and 4 the expert split the attribute background (“antecedentes”
in Spanish). This attribute appears in several objects (46% of object set) through
all the domains, however with different semantics. Finally, the expert created
the attributes historical background, records, practice background and
culinary background. In iteration 5 and 6, the expert decided to eliminate some
attributes from the object set. For example, the relation related to:Commune
which represented a foreign key in the database, was not being used in 3 tables
from which it was removed. Finally, in iterations 7, 8 and 9 the expert labelled
the modules as subdomains of ICH FestiveFeatures, Geo and AgentFeatures.
Figure 5 illustrates the final concept lattice presenting the different
subdomains identified from left to right, namely; Agent descriptors subdomain,
Festive Event descriptors subdomain, Culinary descriptors subdomain,
Geographical subdomain, Content creators subdomain, Photo subdomain, ICH subdomain.
The last subdomain includes all the manifestations about ICH in this database
schema.</p>
      <p>
        Related Work, Discussion and Conclusion
Modelling semantic relations in DBs is proposed in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] where the author presents
a framework to formalize semantics in a lexical database. A lexical database
maintains information about concepts and their semantic position w.r.t. each
other (hypernymy or meronymy ). In general, relational DBs do not share the
same characteristics nor structure as lexical databases, allowing to store more
heterogeneous data. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] the same author proposes an algebra for relational
DBs which can be interpreted also in terms of a formal context in FCA. A
similar idea was proposed by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] where the author uses the algebra to translate
a relational database into a family of formal contexts to benefit from both, the
simplicity of the relational model description and the power of FCA in analysis.
By contrast, our approach is more straightforward since we are not interested
in data operations using the concept lattice, but rather in a direct translation
of the data schema. Thus, we do not work with the entries in the tables of the
database. In our approach we use the concept lattice as a support for guiding the
redesign process in which a domain expert is the main provider of knowledge.
      </p>
      <p>To conclude, in this article we have presented an application of a conceptual
knowledge discovery in databases process designed to redesign and convert a
database schema into an ontological model. The process is heavily human centred
as it considers a domain expert as the main source of knowledge to guide the
process. To support him, we use formal concept analysis with a formal context
created from the set of tables and fields extracted from the database schema.
The concept lattice calculated from this formal context is used to analyse the
schema and create questions which the user should answer. Each question has
an associated set of actions aimed at redesigning the database schema model.</p>
      <p>
        The application is implemented over an excerpt of the Chilean National
Council of Culture and Arts (CNCA) database for intangible cultural heritage
documentation. Currently, we are implementing the process in full scale
including more domain experts. Future work include the annotation process of data
using the ontological schema created which has already been considered,
however not described in this article. As pointed out by one of the reviewers of this
work, the approach presented in this article may also be applied in the
context of software engineering, specifically in code re-factoring and object-model
re-engineering [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Joachim</given-names>
            <surname>Hereth</surname>
          </string-name>
          <string-name>
            <surname>Correia</surname>
          </string-name>
          , Gerd Stumme, Rudolf Wille, and
          <string-name>
            <given-names>Uta</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Conceptual knowledge discovery-a human-centered approach</article-title>
          .
          <source>Applied Artificial Intelligence</source>
          ,
          <volume>17</volume>
          (
          <issue>3</issue>
          ):
          <fpage>281</fpage>
          -
          <lpage>302</lpage>
          ,
          <year>March 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ramez</surname>
          </string-name>
          <article-title>A Elmasri and Shankrant B Navathe</article-title>
          .
          <article-title>Fundamentals of Database Systems</article-title>
          . Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 3rd edition,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Bernhard</given-names>
            <surname>Ganter</surname>
          </string-name>
          and
          <string-name>
            <given-names>Rudolf</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <source>Formal Concept Analysis: Mathematical Foundations</source>
          . Springer,
          <year>December 1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Robert</given-names>
            <surname>Godin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Petko</given-names>
            <surname>Valtchev</surname>
          </string-name>
          .
          <article-title>Formal concept analysis-based class hierarchy design in object-oriented software development</article-title>
          .
          <source>In Formal Concept Analysis</source>
          , volume
          <volume>3626</volume>
          of Lecture Notes in Computer Science.
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Joachim</given-names>
            <surname>Hereth</surname>
          </string-name>
          .
          <article-title>Relational scaling and databases</article-title>
          .
          <source>In Conceptual Structures: Integration and Interfaces</source>
          , volume
          <volume>2393</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>62</fpage>
          -
          <lpage>76</lpage>
          . Springer Berlin Heidelberg,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Sergei</surname>
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>Kuznetsov</surname>
          </string-name>
          .
          <article-title>On stability of a formal concept</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          ,
          <volume>49</volume>
          (
          <issue>1-4</issue>
          ):
          <fpage>101</fpage>
          -
          <lpage>115</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Brian</given-names>
            <surname>McBride</surname>
          </string-name>
          .
          <article-title>The resource description framework (rdf) and its vocabulary description language rdfs</article-title>
          . In Handbook on Ontologies,
          <source>International Handbooks on Information Systems</source>
          , pages
          <fpage>51</fpage>
          -
          <lpage>65</lpage>
          . Springer Berlin Heidelberg,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Uta</given-names>
            <surname>Priss</surname>
          </string-name>
          .
          <article-title>Efficient implementation of semantic relations in lexical databases</article-title>
          .
          <source>Computational Intelligence</source>
          ,
          <volume>15</volume>
          :
          <fpage>79</fpage>
          -
          <lpage>87</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Uta</given-names>
            <surname>Priss</surname>
          </string-name>
          .
          <article-title>Establishing connections between formal concept analysis and relational databases</article-title>
          .
          <source>In Common Semantics for Sharing Knowledge: Contributions to ICCS</source>
          <year>2005</year>
          , pages
          <fpage>132</fpage>
          -
          <lpage>145</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Camille</surname>
            <given-names>Roth</given-names>
          </string-name>
          , Sergei Obiedkov, and
          <string-name>
            <given-names>Derrick</given-names>
            <surname>Kourie</surname>
          </string-name>
          .
          <article-title>Towards concise representation for taxonomies of epistemic communities</article-title>
          .
          <source>Concept Lattices and Their Applications</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mohamed</surname>
            Rouane-Hacene, Marianne Huchard, Amedeo Napoli, and
            <given-names>Petko</given-names>
          </string-name>
          <string-name>
            <surname>Valtchev</surname>
          </string-name>
          .
          <article-title>A proposal for combining Formal Concept Analysis and description Logics for mining relational data</article-title>
          .
          <source>In Proceedings of ICFCA</source>
          <year>2007</year>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>Rudolf</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Why can concept lattices support knowledge discovery in databases?</article-title>
          <source>Journal of Experimental and Theoretical Artificial Intelligence</source>
          ,
          <volume>14</volume>
          (
          <issue>2-3</issue>
          ):
          <fpage>81</fpage>
          -
          <lpage>92</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>