<!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>Information Retrieval and Knowledge Discovery with FCART</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A.A. Neznanov</string-name>
          <email>ANeznanov@hse.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>S.O. Kuznetsov</string-name>
          <email>SKuznetsov@hse.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>Pokrovskiy bd., 11, 109028, Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>74</fpage>
      <lpage>82</lpage>
      <abstract>
        <p>We describe FCART software system, a universal integrated environment for knowledge and data engineers with a set of research tools based on Formal Concept Analysis. The system is intended for knowledge discovery from big dynamic data collections, including text collections. FCART allows the user to load structured and unstructured data (texts and various metainformation) from heterogeneous data sources, build data snapshots, compose queries, generate and visualize concept lattices, clusters, attribute dependencies, and other useful analytical artifacts. Full preprocessing scenario is considered.</p>
      </abstract>
      <kwd-group>
        <kwd>Data Analysis</kwd>
        <kwd>Knowledge Extraction</kwd>
        <kwd>Text Mining</kwd>
        <kwd>Formal Concept Analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        We introduce a new software system for information retrieval and knowledge
discovery from various data sources (textual data, structured databases, etc.). Formal
Concept Analysis Research Toolbox (FCART) was designed especially for the analysis of
unstructured (textual) data. The core of the system supports knowledge discovery
techniques, including those based on Formal Concept Analysis [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], clustering [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
multimodal clustering [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], pattern structures [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] and others. In case studies we
applied FCART for analyzing data in medicine, criminalistics, and trend detection.
      </p>
      <p>FCART is based on DOD-DMS (The Dynamic Ontology-driven Data Mining
System) software platform. In case studies we applied DOD-DMS for analyzing data in
the fields of medical informatics and trends detection. The core of the system
complements a traditional knowledge extraction process with methods of clustering,
multimodal clustering, Formal Concept Analysis, Hidden Markov chains, pattern
structures and others.</p>
      <p>
        Currently, there are several well-known open source FCA-based tools, such as
ConExp [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], Conexp-clj [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], Galicia [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], Tockit [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], ToscanaJ [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], FCAStone [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
Lattice Miner [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], OpenFCA [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Coron [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. These tools have many advantages.
However, they cannot completely satisfy the growing demands of the scientific
community. One of the common drawbacks of these systems is poor data preprocessing. It
prevents researchers from using the programs for analyzing complex big data without
additional third party preprocessing tools.
      </p>
      <p>For example, Coron has some tools for filtering objects and attributes, merging and
transforming contexts (http://coron.wikidot.com/pre:filterdb), but Coron does not
provide flexible tools for importing external data.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>
        The DOD-DMS is a universal and extensible software platform intended for building
data mining and knowledge discovery tools for various application fields. The
creation of this platform was inspired by the CORDIET methodology (abbreviation of
Concept Relation Discovery and Innovation Enabling Technology) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] developed by
J. Poelmans at K.U. Leuven and P. Elzinga at the Amsterdam-Amstelland police. The
methodology allows one to obtain new knowledge from data in an iterative
ontologydriven process. The software is based on modern methods and algorithms of data
analysis, technologies for processing big data collections, data visualization,
reporting, and interactive processing techniques. It implements several basic principles:
1. Iterative process of data analysis using ontology-driven queries and interactive
artifacts (such as concept lattice, clusters, etc.).
2. Separation of processes of data querying (from various data sources), data
preprocessing (of locally saved immutable snapshots), data analysis (in interactive
visualizers of immutable analytic artifacts), and results presentation (in report editor).
3. Extendibility on three levels: customizing settings of data access components,
query builders, solvers and visualizers; writing scripts (macros); developing
components (add-ins).
4. Explicit definition of analytic artifacts and their types. It allows one to check the
integrity of session data and provides links between artifacts for end-user.
5. Realization of integrated performance estimation tools.
6. Integrated documentation of software tools and methods of data analysis.
FCART uses all these principles, but does not have an ontology editor and does not
support the full C-K cycle. The current version consists of the following components.
─ Core component including
 multidocument user interface of research environment with session manager,
 snapshot profiles editor (SHPE),
 snapshot query editor (SHQE),
 query rules database (RDB),
 session database (SDB),
 main part of report builder;
─ Local XML-storage for preprocessed data;
─ Internal solvers and visualizers;
─ Additional plugins and scripts.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Current software properties and future work</title>
      <p>Now we introduce version 0.8 of DOD-DMS as a local Windows application and
version 0.4 as a distributed Web-based application. Those versions use local
XMLstorage for accumulating snapshots and integrated research environment with
snapshot profiles editor, query builder, ontology editor, and some set of solvers (artifact
builders) and visualizers (artifact browsers). The main solvers for this time can
produce clusters, biclusters, concept lattice, sublattices, association rules, and
implications, calculate stability indexes, similarity measures for contexts and concepts, etc.
The set of solvers, visualizers, and scripts specifies a subject field of DOD-DMS
edition.</p>
      <p>
        We use Microsoft and Embarcadero programing environments and different
programing languages (C++, C#, Delphi, Python and others). For scripting we use Delphi
Web Script [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and Python [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
4
4.1
      </p>
    </sec>
    <sec id="sec-4">
      <title>Data preprocessing in FCART</title>
      <sec id="sec-4-1">
        <title>Obtaining initial artifacts</title>
        <p>There are several ways to obtain a binary context, the basic FCA artifact:
─ Load from ready data files of supported formats like CXT or CSV,
─ Generate by plugin or script,
─ Query from data snapshots.</p>
        <p>Loading contexts from ready data files is supported by most FCA-tools. The most
interesting way to obtain a context is querying from snapshots. Let us look to all steps
needed to convert external data into some set of objects with binary attributes.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Access to external data sources and generating snapshots</title>
        <p>Local storage of FCART can be filled from various data sources. System supports
SQL, XML and JSON sources, so it can load data from most databases and
Webservices.</p>
        <p>Data snapshot (or snapshot) is a data table with structured and text attributes,
loaded in the local storage by accessing external data sources. Snapshot is described by a
set of metadata: snapshot profile, local path, link to external data source, time stamp,
author, and comment. FCART provides one with a snapshot profile editor (SHPE).
Profile consists of definitions of fields. Each element of a snapshot is a record: array
of values of fields. Each field is defined by the following main properties:
─ Id (identifier of field)
─ Path (path in initial XML or JSON – may be empty)
─ Name (user-friendly name of field)
─ Group (for visual grouping of fields)
─ Comment
─ Data type (Boolean / Integer / Float / Text / Binary / DateTime)
─ Is Unstructured? (field can be interpreted as unstructured text)
─ Is Multivalued? (for sets / arrays)
─ Type of multivalued presentation (delimited content / same path / path in form of
“name + number”)</p>
        <p>Consider the following example of XML file:
&lt;?xml version="1.0" encoding="utf-8"?&gt;
&lt;Data&gt;</p>
        <p>// ...
&lt;Genre&gt;Lounge&lt;/Genre&gt;
&lt;Genre&gt;Easy listening&lt;/Genre&gt;</p>
        <p>// ...
&lt;/Data&gt;</p>
        <p>In this example field “Genre” is multivalued and have multivalued presentation
type “same path” (Path = “&lt;Data&gt;/&lt;Genre&gt;”). But in other source we can have
type “name + number” (Path = “&lt;Data&gt;/&lt;Genre%d&gt;”):
&lt;Data&gt;</p>
        <p>// ...
&lt;Genre01&gt;Lounge&lt;/Genre01&gt;
&lt;Genre02&gt;Easy listening&lt;/Genre02&gt;</p>
        <p>// ...
&lt;/Data&gt;</p>
        <p>Unstructured field definition additionally contains the following properties:
─ Language (main language of text)
─ SW (list of stop words)
─ Stemmer (not required now because we use snowball stemmer from Lucene).</p>
        <p>It is very useful for dealing with dynamic data collections, including texts in
natural language, and helps to query full-text data more effectively. There is a sample of
unstructured and multivalued field description in JSON format:
{ "Id": "02",
"Path": "object\/author",
"Caption": "Artwork Creators",
"Group": "Common",
"Comment": "The sequence of authors",
"DataType": "Text",
"Unstruct": {
"Is": true,
"Language": "English",
"StopWords": [ ],
"Stemmer": "Snowball" },
"MV": { "Is": true,
"MVType": "Vector",
"MVRepresentation": "NameNumber",
"MVFormat": "author%d" }
}</p>
        <p>Fig. 1 shows a variant of snapshot profile editor (SHPE) for XML filtering. The
left pane “XML Structure” displays a sample of an XML-document from a dataset. A
user can select any element from the document, add it to profile as a new field and set
properties of the field.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Queries to snapshots and constructing binary contexts</title>
        <p>The system has query language for transforming snapshots into binary formal context.
This language describes so-called rules. Main rule types are the following:
─ Simple rule generates one attribute from atomic fields of a snapshot. This rule type
has syntax very similar to SQL WHERE clause
─ Scaling rule generates several attributes from atomic fields based on nominal or
ordinal scale
─ Text mining rule generates one attribute from unstructured text fields.
─ Multivalued rule generates one or many attributes from multivalued field (arrays
and sets)
─ Compound rule merges rules of all types into a single rule. This rule uses standard
logical operations and brackets to combine elements.</p>
        <p>We have also implemented additional rule types: Temporal rules are used for
manipulating date and time intervals and Filters are used for removing objects with their
intents from contexts.</p>
        <p>In most cases, it is not necessary to write a query from scratch. One can select
some entities in rules DB (RDB) and automatically generate a query. It is possible
because the RDB is aware of dependencies between rules. Each rule type has XML
presentation, so every query (or full RDB) can be imported and exported as an
XMLfile.</p>
        <p>The following XML file is a sample of the scaling rule:
&lt;scale name="Age" ScaleType="Order" DataType="Integer"
Ends="Open" id="t34"&gt;
&lt;Offset1&gt;8&lt;/Offset1&gt;
&lt;Offset2&gt;16&lt;/Offset2&gt;
&lt;Offset3&gt;35&lt;/Offset3&gt;
&lt;Offset4&gt;60&lt;/Offset4&gt;
&lt;/scale&gt;</p>
        <p>The application of this rule to snapshot generates 5 binary attributes: “Age &lt; 8”,
“8 &lt;= Age &lt; 16”, …, “60 &lt;= Age”.</p>
        <p>
          FCART uses Lucene full text search engine [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] to index the content of
unstructured text fields in snapshots. The resulting index is later used to validate quickly
whether the text mining or compound rule returns true or false.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Interactive visualization of concept lattice</title>
      <p>The concept lattice visualizer is an example of interactive visualizer. It can be used to
browse the collection of objects with binary attributes given as a result of query to
snapshot (with structured and text attributes). The user can select and deselect objects
and attributes and the lattice diagram is modified accordingly. The user can click on a
concept. In a special window the screen shows names of objects in the extent and
names of attributes in the intent. Names of objects and attributes are linked with initial
snapshot records and fields. If the user clicks on the name of an object or an attribute,
the content of the object or attribute description is shown in a special window
according to the snapshot profile.</p>
      <p>Fig. 2 demonstrates the result of building a sublattice from a concept lattice. The
multi-document interface allows us to inspect several artifacts, so a sublattice will be
opened in a new window.</p>
      <p>The user can customize settings of lattice browsing in various ways. The user can
specify whether nodes corresponding to concepts show numbers of all (or only new)
objects and all (or only new) attributes in extent and intent respectively, or names of
all (or only new) objects and all (or only new) attributes. Separate settings can be
specified for the selected concept, concepts in the order filter, and the remainder of
the lattice. The visual appearance can be changed: zooming, coloring, and other tools
are available.</p>
      <p>Right clicking on the name of an attribute user can choose several options: one can
build a sublattice containing only objects with selected attribute; build a sublattice
containing only objects without selected attribute; or find the highest concept with a
selected attribute. Right clicking on the name of an object allows one the same
actions.</p>
      <p>If we built a formal context using a query to a snapshot then we can simply look
for a definition of each attribute (in form of a query rule from RDB) and a source of
each object (in form of XML- or JSON-file) in left part of the visualizer window. If a
filter rule is present in query then we can see comparison between sets of objects in
the context and records in the snapshot.</p>
      <p>Linking analytic artifacts with snapshots are very important for subsequent analysis
of the same data collection. Researcher can simply interpret results of the analysis by
viewing initial pieces of data.</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and future work</title>
      <p>FCART is a powerful environment being in active development. The next major
release of the local version 0.8 is planned for March 2013 and after that the system will
be freely available to the FCA community. In this article we considered in details the
powerful preprocessing tools of the system.</p>
      <p>
        We intend to improve methodology, extend the set of solvers, optimize some
algorithms, and use the proposed system for solving various knowledge discovery
problems. We already have tested new solvers based on concept stability [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ] and
other indices [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. In the preprocessing queue we will try to simplify writing queries
to external data sources by introducing SQL- and XML-explorer of databases and
web-services.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>This work was carried out by the authors within the project “Mathematical Models,
Algorithms, and Software Tools for Intelligent Analysis of Structural and Textual
Data” supported by the Basic Research Program of the National Research University
Higher School of Economics.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
            <given-names>R</given-names>
          </string-name>
          . Formal
          <source>Concept Analysis: Mathematical Foundations</source>
          , Springer,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Mirkin</surname>
          </string-name>
          , B.
          <source>Mathematical Classification and Clustering</source>
          , Springer,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magizov</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhukov</surname>
            ,
            <given-names>L.E.</given-names>
          </string-name>
          <string-name>
            <surname>From</surname>
          </string-name>
          <article-title>Triconcepts to Triclusters</article-title>
          .
          <source>Proc. of 13th International Conference on rough sets</source>
          ,
          <article-title>fuzzy sets, data mining and granular computing (RSFDGrC-</article-title>
          <year>2011</year>
          ),
          <source>LNCS/LNAI Volume 6743/2011</source>
          , Springer (
          <year>2011</year>
          ), pp.
          <fpage>257</fpage>
          -
          <lpage>264</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O. Pattern</given-names>
          </string-name>
          <string-name>
            <surname>Structures</surname>
            and
            <given-names>Their</given-names>
          </string-name>
          <string-name>
            <surname>Projections</surname>
          </string-name>
          .
          <source>Proc. of 9th International Conference on Conceptual Structures (ICCS-2001)</source>
          ,
          <year>2001</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          <article-title>Pattern Structures for Analyzing Complex Data</article-title>
          .
          <source>Proc. of 12th International conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, Conference (RSFDGrC-2009)</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Yevtushenko</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          <article-title>System of data analysis "Concept Explorer". (In Russian)</article-title>
          .
          <source>Proceedings of the 7th national conference on Artificial Intelligence KII-2000</source>
          , p.
          <fpage>127</fpage>
          -
          <lpage>134</lpage>
          , Russia,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>7. Conexp-clj (http://daniel.kxpq.de/math/conexp-clj/)</mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Valtchev</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grosser</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roume</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Mohamed Rouane Hacene</article-title>
          .
          <article-title>GALICIA: an open platform for lattices, in Using Conceptual Structures: Contributions to the 11th Intl</article-title>
          .
          <source>Conference on Conceptual Structures (ICCS'03)</source>
          , pp.
          <fpage>241</fpage>
          -
          <lpage>254</lpage>
          , Shaker Verlag,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. Tockit:
          <article-title>Framework for Conceptual Knowledge Processing (http://www</article-title>
          .tockit.org)
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Becker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hereth</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>ToscanaJ: An Open Source Tool for Qualitative Data Analysis</article-title>
          ,
          <source>Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI</source>
          <year>2002</year>
          ). Lyon, France,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Priss</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <article-title>FcaStone - FCA file format conversion and interoperability software</article-title>
          ,
          <source>Conceptual Structures Tool Interoperability Workshop (CS-TIW)</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lahcen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwuida</surname>
            ,
            <given-names>L. Lattice</given-names>
          </string-name>
          <article-title>Miner: A Tool for Concept Lattice Construction and Exploration</article-title>
          .
          <source>In Suplementary Proceeding of International Conference on Formal concept analysis (ICFCA'10)</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Borza</surname>
            ,
            <given-names>P.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sabou</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sacarea</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>OpenFCA, an open source formal concept analysis toolbox</article-title>
          .
          <source>Proc. of IEEE International Conference on Automation Quality and Testing Robotics (AQTR)</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Szathmary</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaytoue</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcuola</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>The Coron Data Mining Platform (http://coron</article-title>
          .loria.fr)
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elzinga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neznanov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viaene</surname>
          </string-name>
          . S.,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            <given-names>D.</given-names>
          </string-name>
          , Dedene G.:
          <article-title>Concept Relation Discovery and Innovation Enabling Technology</article-title>
          (CORDIET) // CEUR Workshop proceedings Vol-
          <volume>757</volume>
          , Concept Discovery in Unstructured Data,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Grange</surname>
          </string-name>
          , E. DelphiWebScript Project (http://delphitools.info/dwscript)
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Python Programming Language - Official Website</surname>
          </string-name>
          (http://www.python.org)
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>18. Apache Lucene (http://lucene.apache.org)</mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Stability as an Estimate of the Degree of Substantiation of Hypotheses on the Basis of Operational Similarity</article-title>
          . In:
          <string-name>
            <surname>Nauchno-Tekhnicheskaya</surname>
            <given-names>Informatsiya</given-names>
          </string-name>
          ,
          <source>Ser. 2</source>
          , Vol.
          <volume>24</volume>
          , No.
          <volume>12</volume>
          , pp.
          <fpage>21</fpage>
          -
          <lpage>29</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <article-title>Reducing the Representation Complexity of Lattice-Based Taxonomies</article-title>
          . In: U. Priss,
          <string-name>
            <given-names>S.</given-names>
            <surname>Polovina</surname>
          </string-name>
          , R. Hill, Eds.,
          <source>Proc. 15th International Conference on Conceptual Structures (ICCS 2007), Lecture Notes in Artificial Intelligence (Springer)</source>
          , Vol.
          <volume>4604</volume>
          , pp.
          <fpage>241</fpage>
          -
          <lpage>254</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Klimushkin</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Approaches to the Selection of Relevant Concepts in the</article-title>
          <source>Case of Noisy Data // 8th International Conference on Formal Concept Analysis (ICFCA</source>
          <year>2010</year>
          ), pp.
          <fpage>255</fpage>
          -
          <lpage>266</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>