<!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>LatViz: A New Practical Tool for Performing Interactive Exploration over Concept Lattices</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mehwish Alam</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thi Nhu Nguyen Le</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Amedeo Napoli</string-name>
          <email>amedeo.napoli@loria.frg</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>. Laboratoire d'Informatique de Paris-Nord, Universite Paris 13</institution>
          ,
          <addr-line>Paris</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universite de Lorraine) BP 239, Vandoeuvre-les-Nancy</institution>
          ,
          <addr-line>F-54506</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>With the increase in Web of Data (WOD) many new challenges regarding exploration, interaction, analysis and discovery have surfaced. One of the basic building blocks of data analysis is classi cation. Many studies have been conducted concerning Formal Concept Analysis (FCA) and its variants over WOD. But one fundamental question is, after these concept lattices are obtained on top of WOD, how the user can interactively explore and analyze this data through concept lattices. To achieve this goal, we introduce a new tool called as LatViz, which allows the construction of concept lattices and their navigation. LatViz proposes some remarkable improvements over existing tools and introduces various new functionalities such as interaction with expert, visualization of Pattern Structures, AOC posets, concept annotations, ltering concept lattice based on several criteria and nally, an intuitive visualization of implications. This way the user can e ectively perform an interactive exploration over a concept lattice which is a basis for a strong user interaction with WOD for data analysis.</p>
      </abstract>
      <kwd-group>
        <kwd>Lattice Visualization</kwd>
        <kwd>Interactive Exploration</kwd>
        <kwd>Web of Data</kwd>
        <kwd>Formal Concept Analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In the last decade, there has been a huge shift from the Web of Documents to the
Web of Data (WOD). Web of Documents represents data in the form of HTML
pages which linked with other HTML pages through hyperlinks. This web of
documents has evolved into WOD where all the information contained is represented
in the form of entity and relations allowing the semantics to be embedded in the
representation of the this data. This data are in the form of a (node-arc) labeled
graph belonging to several domains such as newspapers, publications,
biomedical data etc. The growth in the publication of data sources in WOD has made it
an important source of data, which has led towards many challenges pertaining
to e ective utilization of this data. WOD mainly represents data in the form of
Resource Description Framework (RDF)1. There are several ways such as data
1 http://www.w3.org/RDF/
dumps and SPARQL queries to access this data, which can be utilized for many
purposes, one of which is visualization and interactive exploration for data
analysis purposes. Several visualization tools have been developed for this purpose,
one of which is LODLive2 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], where user can choose data-sets such as DBpedia
and Freebase and specify an entity as a starting point for browsing the node-arc
labeled graph. Another tool based on graphical display is RelFinder [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], where
given several entities the tool automatically nds the paths connecting these
entities. The major drawback of LODLive is that after two hops the number of
nodes increase and it is hard to visualize the data. Moreover, these tools are
good for getting an insight into what RDF graph contains but they are not built
for the purpose of knowledge discovery.
      </p>
      <p>
        In order to provide the user with the ability to perform data analysis and
knowledge discovery over such kind of data, there is a need to perform
classication, where the obtained classes are further made available to the user for
exploration and subjective interpretation. In the current study we use Formal
Concept Analysis as the basis for classi cation. Several studies have already been
conducted using FCA and its variants over RDF graphs or its generalization to
knowledge graphs. Out of these studies so far RV-Xplorer [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is the only tool that
actually allows interactive exploration of clustered RDF data [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The purpose of
this paper is to enhance the functionalities discussed in the previous two studies.
In this study we introduce a new tool LatViz which increases the
interpretability of a concept lattice by remarkably improving the user interaction with the
concept lattice as compared to existing tools. Various new functionalities have
been introduced such as the visualization of Pattern Structures and AOC-posets,
concept annotation, ltering concept lattice and pattern concept lattice based
on several criteria and nally, an intuitive visualization of implications. This
way the user can e ectively perform an interactive exploration over a concept
lattice which in turn gives a basis for a strong user interaction with WOD for
knowledge discovery purposes. In this paper, we detail the important interaction
operations implemented in LatViz. In the rest of this paper we refer to \user"
as an \expert" as (s)he needs to have some basic knowledge about the lattice
structure.
      </p>
      <p>The paper is structured as follows: Section 2 introduces a motivating example,
Section 3 introduces the background required for understanding the rest of the
paper while Section 4 introduces some of the important functionalities of LatViz.
Then in Section 5, we discuss some of the related tools already developed and
nally Section 6 details the future perspectives of the current work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Motivating Example</title>
      <p>Let us consider that an expert is searching for papers published by a particular
team in conferences or journals related to his/her eld of research. In order to
locate the papers of his/her interest (s)he has to search for speci c keywords</p>
      <sec id="sec-2-1">
        <title>2 http://en.lodlive.it/</title>
        <p>or authors in the local portal. For getting the view of which kind of papers
are contained (s)he has to run a broad query and then narrow down his/her
query to obtain papers on speci c keywords or authors or group of keywords or
authors. The expert will end up running several queries to get what (s)he wants.
Moreover, if the expert wants to know the collaborations of the team with other
members of the research community outside the team, as well as the diversity
and the specialization of the team members, this cannot be directly obtained by
simple querying. To obtain such kind of knowledge there is a need to introduce
a support for data analysis. Based on this scenario, we show how the expert can
be guided thanks to an adapted visualization tool to obtain such information of
interest with the help of concept lattices.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Preliminaries</title>
      <sec id="sec-3-1">
        <title>Pattern Structures</title>
        <p>
          In this section we provide a brief introduction to pattern structures [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. A pattern
structure is a triple pG; pD; q; q, where G is the set of objects, pD; q is a
meet-semilattice of descriptions D equipped with a similarity measure , and
: G Ñ D maps an object to its description. More intuitively, a pattern structure
is a set of objects with their corresponding descriptions, where similarity between
descriptions is computed thanks to . This similarity operator  is idempotent,
commutative and associative. The derivation operators can be de ned as:
Al :
¦ pgq
gPA
        </p>
        <p>
          f or A  G
dl :
tg P G|d  pgqu
f or d P D
Each element in D is referred to as a pattern. The subsumption order over these
patterns is given as: c  d ô c [ d c. The operator p:ql makes a Galois
connection. Then, a pattern concept of a pattern structure pG; pD;  ; q is a
q
pair pA; dq where A  G and d P D such that Al d and A dl, where A
is called the concept extent and d is called the concept intent. Pattern concept
lattices are de ned in the same way as concept lattices in standard FCA.
Interval Pattern Structures. Interval Pattern Structures were rst introduced
in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] for dealing with numerical data instead of binary data. Consider two
descriptions pg1q xrli1; ri1sy and pg2q xrli2; ri2sy, with i P r1::ns where n
is the number of intervals used for the description of entities. The similarity
operation [ and the associated subsumption relation  between descriptions
are de ned as the convex hull of two descriptions as follows: pg1q [ pg2q
xrminpli1; li2q; maxpri1; ri2qsy Following the de nition of a pattern concept
discussed previously a interval pattern concept lattice can be built. Pattern
structures have also been introduced to deal with graphical data [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Web of Data and its Classi cation</title>
        <p>Web of Data (WOD) is represented in the form of entity and relationships. A
standard representation of WOD represents data in the form of RDF (Resource
Description Framework) triples written as xsubject; predicate; objecty. Here,
subject can be a URI or a blank node, predicate can be a URI and object can be a
URI, a blank node or a literal. Several RDF triples connect together to form an
RDF graph. Table 1 shows an example of RDF triple store from DBLP where
each row represents one triple. The subject is the title of the paper, predicates
are the relations such as dc:subject and dc:creator (interpreted as \has
keyword" and \ has author" respectively) and the objects are the keywords and the
authors. The triple t1 is read as \paper s1 has keyword Pattern Structures ".</p>
        <p>In order to allow interactive data exploration over RDF data, an initial set
of restrictions is posed by the expert by de ning the task requirement based on
which a SPARQL query is created by the expert to obtain the speci c data. Then
the most important step for interactive data exploration is to perform classi
cation of RDF data. Finally, the expert is allowed to interact with the obtained
classi cation. In the rest of this paper, we further improve the functionalities
of the existing tools by introducing several new interactive operations in a new
tool called LatViz.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>LatViz for Interactive Exploration of Concept Lattices</title>
      <p>
        The display of LatViz resembles Conexp3, which provides basic functionalities
for building a concept lattice. LatViz implements two algorithms for building a
concept lattice from a binary context, one of which is introduced in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Another,
e cient algorithm for building a concept lattice is AddIntent [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Demo of LatViz
is available on-line through this link: http://latviz.loria.fr/latviz/.
      </p>
      <p>The concept lattice for the scenario in section 2 was created by mapping the
RDF data to a formal context K pG; M; Iq. Based on Table 1, the subjects
of the triples were considered as the set of objects G, the objects in the RDF
triples i.e., keywords and authors were considered as the set of attributes M .
In this example, the RDF triples were created from the publications of the</p>
      <sec id="sec-4-1">
        <title>3 http://conexp.sourceforge.net/</title>
        <p>
          Knowledge Discovery (KDD) team in LORIA. The number of objects in the
context are 343 and attributes are 1516. Figure 1 shows a complete concept
lattice built using LatViz. The information about a concept can be displayed
by selecting the concept. Very often huge concept lattices are obtained based
on the context size. LatViz provides several interactive operations allowing for
reduction of exploration space of the expert. To-date this is the most interactive
tool having many unique functionalities such as handling numeric data with
the help of interval pattern structures, AOC-posets, ltering concept lattice and
implications which provides support for data analysis. Other functionalities such
as annotating the lattice, level-wise display of a concept lattice etc. are discussed
in many contexts but are not yet directly implemented in the commonly used
tools. In the following we detail each of these functionalities for data analysis.
AOC-poset is a partially ordered set of the attribute and object concepts, rst
introduced in [
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]. If pG; M; Iq is a formal context then according to the de
nition in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], an object concept is de ned as pg2; g1q such that g P G, i.e. pg2; g1q
is the \lower" concept whose extent includes g. Dually, an attribute concept is
de ned as pm1; m2q where m P M , i.e. pm1; m2q is the \highest" concept whose
intent includes m. The object and attribute concept are referred to as
introducers in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Once an attribute is introduced in a concept it is inherited from
top to bottom while, dually, an introduced object is \inherited" from bottom to
top. During this study, we implement the Hermes Algorithm introduced in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
for building AOC-Poset from binary context. AOC-posets have been successfully
applied to several domain one of which is to classify linguistic data [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. In the
current study we compute AOC Posets of RDF data. Figure 2 shows the AOC
Posets of the concept lattice in Figure 1, where object and attribute concepts
are shown in green while the other concepts are translucent and the pink color
shows the selected concept.
AOC-Posets actually reduce exploration space but still a huge number of
concepts remain to be observed. LatViz allows the creation of concept lattice
levelwise by interaction. When an expert clicks on the top concept, LatViz computes
and displays the rst level. After that the expert can select the concept for
continuing the exploration, then LatViz computes the next level for that concept.
In Figure 3, the top image shows the rst level of the concept lattice built by
selecting the top concept. Then the expert can view the contents of each concept
on mouseover. In the running example, expert locates the concept with all the
papers of Amedeo Napoli (i.e., K#2), which shows that the total number of
documents written by Amedeo Napoli are 152. On selecting this concept, the next
level of the lattice originating from the selected concept is computed (shown in
the bottom image in Figure 3).
4.4
        </p>
        <sec id="sec-4-1-1">
          <title>Display Sub/Super Concepts of a Concept</title>
          <p>
            In case of huge concept lattices sometimes it is hard to keep track of the ordering
relations between the concepts. LatViz allows the expert to only highlight
sub/super concepts of a concept. For example, if the expert wants to display all the
publications along with the collaborations of the author Amedeo Napoli, (s)he
can highlight the associated sub-lattice of the attribute concept of \Amedeo
Napoli". Figure 4 shows the highlighted sub-lattice in brown. An expert can
highlight the super-concepts connected to a concept. If the expert is looking for
all the papers having some keywords common with the paper Knowledge
Organization and Information Retrieval Using Galois Lattices having one or more of
the keywords in the intent of the concept then (s)he can highlight the sub-lattice
of super concepts associated to it (see Figure 5).
This functionality was partially implemented in RV-Xplorer [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] to reduce the
interaction space of the expert. Here the expert can only show the part of the
concept lattice in which (s)he is interested. The expert can locate the interesting
concept by navigation, containing some intent or extent. If an intent is
interesting and the expert marks the concept as interesting then only the sub-concepts
of this concept are shown to the expert as the intents are inherited from top to
bottom. Dually, if an extent is interesting for the expert then all the super
concepts are shown to the expert as the extent is inherited bottom-top. Previously,
the expert highlighted the sub-lattice of the concept containing all the papers
of Amedeo Napoli, now if the expert is interested in only the papers of Amedeo
Napoli on Knowledge Representation then (s)he can navigate downwards and
only see this part of concept lattice by marking it interesting (see Figure 6).
Similarly, we previously highlighted all the super concepts of the concept
having the paper entitled Knowledge Organization and Information Retrieval Using
Galois Lattices in the extent, Figure 7 only shows the associated sub-lattice to
have a clearer view (see Figure 7).
          </p>
          <p>In the running scenario, we extracted three attributes for the papers i.e., year
of publications, rank of the conference in which the paper was published and
nally the number of pages. The ranks of the conferences were considered based
on COmputing Research and Education (CORE) rankings4. The ranks were A*,
A, B, C and other which were coded as 1, 2, 3, 4 and 5 respectively. The nal
concept lattice generated for the last ve years of publications of Knowledge
Discovery Team is shown in Figure 8.
4.7</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>Lattice Filtering Criteria</title>
          <p>There are two categories of ltering provided by LatViz; one is for the concept
lattice created with the binary data and the other one is provided for the pattern
concept lattice built with the help of interval pattern structures.
Filtering Concept Lattice. After a concept lattice is built by applying FCA,
expert is allowed to set several ltering criteria such as stability, lift, extent
size, intent size and nally speci c object or attribute names. Let us consider
that in the running example, the expert is looking for the papers published
by Amedeo Napoli on the topic of pattern structures and FCA. A lter on the
number of attributes in the intent is set to 3. The ltered concept lattice obtained
over the complete lattice in Figure 1 is shown in Figure 9. It further shows the
authors with who Amedeo Napoli has worked i.e., Sergei O. Kuznetsov and
Mehdi Kaytoue. This part of concept lattice shows the community of authors
working with Amedeo Napoli on the topic of pattern structures.
4 http://portal.core.edu.au/conf-ranks/
Filtering Pattern Concept Lattice. Interval Pattern Concept Lattices can also
be ltered by specifying the number of attributes to be considered, the upper
and the lower limits for the intervals in the intent of each attribute along with
stability, lift and extent size. Let us consider the pattern concept lattice in
Figure 8, it can be seen that the concept lattice is hard to interpret. To make it
more readable based on what an expert wants, (s)he is allowed to specify lters.
For example, if the expert is looking for a paper published in a conference of a
rank 1-4 in the year 2012 - 2015 and has the number of pages not less than 2
and no more than 42 then the respective lters can be set for the values of all
three attributes. The ltered pattern concept lattice will then only contain the
part of lattice needed by the user. Figure 8 shows the concept containing group
of papers published from 2014-2015 in conferences with rank 2 having number
of pages 2-42.
One of the many proposed visualization techniques for implications includes
table-based views. It keeps each column for rule ID, LHS and RHS of the rule,
support and con dence measures. These views were used because of the
simplicity of storage. However, while expert interaction it is not very convenient
to obtain interesting rules at a simple glance as the number of rules can be too
many. Another way of visualizing association rules are Matrix Views, where rows
represent the LHS and columns represent the RHS of the rules. Support and
condence are displayed by di erent colors in the intersection of the LHS and RHS.
In case of a formal context, the number of objects/attributes can be very big
leading to problems in displaying the matrix. By carefully taking into account
the above drawbacks, we nally settle on visualizing implications with the help
of scatter plots, where the x-axis shows the increasing support and the y-axis
shows the increasing lift (as we are considering implications the con dence of
the rule is always 100%). Such kind of display helps the expert to single-out the
rules (s)he wants to visualize based on the values of support and lift. Figure 11
shows implications of the running example, x-axis keeps the support in
percentage and y-axis keeps lift. The number on top of the circle shows the number of
rules existing in the same point in the plot. On mouse over, expert can view the
implications.</p>
          <p>
            Fig. 10: Filtered Pattern Concept
Lattice.
In [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ], the authors focus mainly on interactive data exploration over RDF data for
interactive knowledge discovery. It clusters RDF triples based on RDF Schema
and then allows interactive exploration with the help of RV-Xplorer (Rdf View
eXplorer) [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]. It is a tool for visualizing views over RDF graphs mainly for
identifying interesting parts of data and allow data analysis. It has also been extended
for clustering SPARQL query answers. To-date there have been many other tools
developed for reducing the e ort of expert in observing and interpreting a
concept lattice. Many of the tools have been developed for more speci c purposes.
CREDO [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] and FooCA [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] are the Web Clustering Engines [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ] which take
the answers from queries posed against search engines and create a concept
lattice which is then displayed to the expert for interaction. CREDO allows only
limited interaction, however, FooCA allows the expert to edit the context and
iteratively build the concept lattice. CEM [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ] is an email manager which allows
quick search through the e-mails and usually deals with smaller concept lattices.
Camelis [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ] is a system based on FCA for the organization of documents
allowing several navigation operations. Another set of tools such as Sewelis [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]
and Sparklis [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ] allows navigation/interaction over knowledge graphs. Many
other tools such as Galicia5, ConExp and ToscanaJ6 are developed for academic
purposes. LatViz takes the basic functionalities of ConExp and takes it to the
another level by providing visualization for many algorithms introduced over
time to increase the readability. Moreover, it re-uses the source-code for
building concept lattice with the help of the algorithm in [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] from ToscanaJ [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ]. It
can not only be applied to WOD but it has been extended for interpreting any
kind of data.
6
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion and Future Improvements</title>
      <p>
        LatViz is a tool built for allowing expert interaction for data analysis purposes.
It provides many new functionalities for reducing the exploration space of the
expert and enable him to interpret the results. As a future perspective, we also want
to implement other variations of pattern structures such as Pattern Structures
introduced for structured set of attributes discussed in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and Heterogeneous
Pattern Structures [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. We also want to extend the implementation of
implications to association rules. Finally, we also want to take into account matrix
factorization.
      </p>
      <sec id="sec-5-1">
        <title>5 https://sourceforge.net/projects/galicia/</title>
      </sec>
      <sec id="sec-5-2">
        <title>6 http://toscanaj.sourceforge.net/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Camarda</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mazzini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antonuccio</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Lodlive, exploring the web of data</article-title>
          .
          <source>In: I-SEMANTICS 2012 - 8th International Conference on Semantic Systems, ISEMANTICS '12</source>
          ,
          <string-name>
            <surname>Graz</surname>
          </string-name>
          , Austria, September 5-
          <issue>7</issue>
          ,
          <year>2012</year>
          . (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Heim</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lohmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stegemann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Interactive relationship discovery via the semantic web</article-title>
          .
          <source>In: The Semantic Web: Research and Applications, 7th Extended Semantic Web Conference, ESWC</source>
          <year>2010</year>
          , Heraklion, Crete, Greece, May 30 - June 3,
          <year>2010</year>
          , Proceedings,
          <string-name>
            <surname>Part I.</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <volume>303</volume>
          {
          <fpage>317</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osmuk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>RV-Xplorer</surname>
          </string-name>
          :
          <article-title>A way to navigate lattice-based views over RDF graphs</article-title>
          .
          <source>In: Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications</source>
          .
          <article-title>(</article-title>
          <year>2015</year>
          )
          <volume>23</volume>
          {
          <fpage>34</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Interactive exploration over RDF data using formal concept analysis</article-title>
          .
          <source>In: 2015 IEEE International Conference on Data Science and Advanced Analytics</source>
          , DSAA. (
          <year>2015</year>
          )
          <volume>1</volume>
          {
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Pattern structures and their projections</article-title>
          .
          <source>In: ICCS</source>
          . (
          <year>2001</year>
          )
          <volume>129</volume>
          {
          <fpage>142</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kaytoue</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Revisiting numerical pattern mining with formal concept analysis</article-title>
          .
          <source>In: Proceedings of the 22nd International Joint Conference on Arti cial Intelligence</source>
          .
          <article-title>(</article-title>
          <year>2011</year>
          )
          <volume>1342</volume>
          {
          <fpage>1347</fpage>
        </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>
          </string-name>
          , R.:
          <source>Formal Concept Analysis: Mathematical Foundations</source>
          . Springer, Berlin/Heidelberg (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>van der Merwe</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kourie</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          :
          <article-title>Addintent: A new incremental algorithm for constructing concept lattices</article-title>
          .
          <source>In: ICFCA</source>
          . (
          <year>2004</year>
          )
          <volume>372</volume>
          {
          <fpage>385</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Osswald</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petersen</surname>
            ,
            <given-names>W.:</given-names>
          </string-name>
          <article-title>A logical approach to data-driven classi cation</article-title>
          .
          <source>In: KI</source>
          . Volume
          <volume>2821</volume>
          of Lecture Notes in Computer Science., Springer (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Petersen</surname>
            ,
            <given-names>W.:</given-names>
          </string-name>
          <article-title>A set-theoretical approach for the induction of inheritance hierarchies</article-title>
          .
          <source>Electr. Notes Theor. Comput. Sci</source>
          .
          <volume>53</volume>
          (
          <year>2001</year>
          )
          <volume>296</volume>
          {
          <fpage>308</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>A.</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>Sigayret</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Hermes: a simple and e cient algorithm for building the AOC-poset of a binary relation</article-title>
          .
          <source>Ann. Math. Artif. Intell</source>
          .
          <volume>72</volume>
          (
          <issue>1-2</issue>
          ) (
          <year>2014</year>
          )
          <volume>45</volume>
          {
          <fpage>71</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romano</surname>
          </string-name>
          , G.:
          <article-title>Exploiting the potential of concept lattices for information retrieval with CREDO</article-title>
          .
          <source>J. UCS</source>
          <volume>10</volume>
          (
          <issue>8</issue>
          ) (
          <year>2004</year>
          )
          <volume>985</volume>
          {
          <fpage>1013</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Koester</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Conceptual knowledge retrieval with FooCA: Improving web search engine results with contexts and concept hierarchies</article-title>
          .
          <source>In: Advances in Data Mining</source>
          , Applications in Medicine,
          <source>Web Mining, Marketing, Image and Signal Mining, 6th Industrial Conference on Data Mining, ICDM Proceedings</source>
          .
          <article-title>(</article-title>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osinski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romano</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
          </string-name>
          , D.:
          <article-title>A survey of web clustering engines</article-title>
          .
          <source>ACM Comput. Surv</source>
          .
          <volume>41</volume>
          (
          <issue>3</issue>
          ) (
          <year>2009</year>
          )
          <volume>17</volume>
          :
          <fpage>1</fpage>
          {
          <fpage>17</fpage>
          :
          <fpage>38</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Cole</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
          </string-name>
          , G.:
          <article-title>CEM - A conceptual email manager</article-title>
          .
          <source>In: 8th International Conference on Conceptual Structures</source>
          ,
          <string-name>
            <surname>ICCS</surname>
          </string-name>
          , Proceedings. (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Ferre</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Camelis: a logical information system to organise and browse a collection of documents</article-title>
          .
          <source>Int. J. General Systems</source>
          <volume>38</volume>
          (
          <issue>4</issue>
          ) (
          <year>2009</year>
          )
          <volume>379</volume>
          {
          <fpage>403</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Ferre</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Hermann, A.:
          <article-title>Reconciling faceted search and query languages for the semantic web</article-title>
          .
          <source>IJMSO</source>
          <volume>7</volume>
          (
          <issue>1</issue>
          ) (
          <year>2012</year>
          )
          <volume>37</volume>
          {
          <fpage>54</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Ferre</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>SPARKLIS: a SPARQL endpoint explorer for expressive question answering</article-title>
          .
          <source>In: Proceedings of the Posters &amp; Demonstrations Track a track within the 13th International Semantic Web Conference</source>
          , ISWC. (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Becker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Correia</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          :
          <article-title>The ToscanaJ suite for implementing conceptual information systems</article-title>
          .
          <source>In: Formal Concept Analysis, Foundations and Applications</source>
          . (
          <year>2005</year>
          )
          <volume>324</volume>
          {
          <fpage>348</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buzmakov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sailanbayev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Revisiting pattern structures for structured attribute sets</article-title>
          .
          <source>In: Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications</source>
          .
          <article-title>(</article-title>
          <year>2015</year>
          )
          <volume>241</volume>
          {
          <fpage>252</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Codocedo</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A proposition for combining pattern structures and relational concept analysis</article-title>
          .
          <source>In: Formal Concept Analysis - 12th International Conference, ICFCA</source>
          <year>2014</year>
          ,
          <article-title>Proceedings</article-title>
          . (
          <year>2014</year>
          )
          <volume>96</volume>
          {
          <fpage>111</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>