<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3897/jucs.67953</article-id>
      <article-id pub-id-type="publisher-id">67953</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>E.1 - DATA STRUCTURES</subject>
          <subject>G.0 - GENERAL</subject>
          <subject>H.3.1 - Content Analysis and Indexing</subject>
          <subject>H.3.2 - Information Storage</subject>
          <subject>H.3.3 - Information Search and Retrieval</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Extracting concepts from triadic contexts using Binary Decision Diagram</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Neves</surname>
            <given-names>Julio Cesar Vale</given-names>
          </name>
          <email xlink:type="simple">juliocesar.neves@gmail.com</email>
          <uri content-type="orcid">https://orcid.org/0000-0002-0520-9976</uri>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Zarate</surname>
            <given-names>Luiz Enrique</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Song</surname>
            <given-names>Mark Alan Junho</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Pontificia Universidade Catolica de Minas Gerais (PUC Minas), Belo Horizonte, Brazil</addr-line>
        <institution>Pontificia Universidade Catolica de Minas Gerais (PUC Minas)</institution>
        <addr-line content-type="city">Belo Horizonte</addr-line>
        <country>Brazil</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Julio Cesar Vale Neves (<email xlink:type="simple">juliocesar.neves@gmail.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2022</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>06</month>
        <year>2022</year>
      </pub-date>
      <volume>28</volume>
      <issue>6</issue>
      <fpage>591</fpage>
      <lpage>619</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/80FC3B10-AE44-5729-98A5-EE803A4A0FD8">80FC3B10-AE44-5729-98A5-EE803A4A0FD8</uri>
      <history>
        <date date-type="received">
          <day>27</day>
          <month>04</month>
          <year>2021</year>
        </date>
        <date date-type="accepted">
          <day>04</day>
          <month>04</month>
          <year>2022</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Julio Cesar Vale Neves, Luiz Enrique Zarate, Mark Alan Junho Song</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by-nd/4.0/" xlink:type="simple">
          <license-p>This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY-ND 4.0). This license allows reusers to copy and distribute the material in any medium or format in unadapted form only, and only so long as attribution is given to the creator. The license allows for commercial use.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Due to the high complexity of real problems, a considerable amount of research that deals with high volumes of information has emerged. The literature has considered new applications of data analysis for high dimensional environments in order to manage the difficulty in extracting knowledge from a database, especially with the increase in social and professional networks. Tri- adic Concept Analysis (TCA) is a technique used in the applied mathematical area of data analysis. Its main purpose is to enable knowledge extraction from a context that contains objects, attributes, and conditions in a hierarchical and systematized representation. There are several algorithms that can extract concepts, but they are inefficient when applied to large datasets because the compu- tational costs are exponential. The objective of this paper is to add a new data structure, binary decision diagrams (BDD), in the TRIAS algorithm and retrieve triadic concepts for high dimen- sional contexts. BDD was used to characterize formal contexts, objects, attributes, and conditions. Moreover, to reduce the computational resources needed to manipulate a high-volume of data, the usage of BDD was implemented to simplify and represent data. The results show that this method has a considerably better speedup when compared to the original algorithm. Also, our approach discovered concepts that were previously unachievable when addressing high dimensional contexts.</p>
      </abstract>
    </article-meta>
  </front>
</article>
