All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Bisection-based Merging Algorithm for Creation of One-Sided Concept Lattices

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33151398" target="_blank" >RIV/61989592:15310/14:33151398 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/SAMI.2014.6822386" target="_blank" >http://dx.doi.org/10.1109/SAMI.2014.6822386</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/SAMI.2014.6822386" target="_blank" >10.1109/SAMI.2014.6822386</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bisection-based Merging Algorithm for Creation of One-Sided Concept Lattices

  • Original language description

    In this paper we provide the new version of algorithm for creation model called Generalized One-Sided Concept Lattice (GOSCL). This model provides the specific fuzzy version of data analytical method based on the approach known as Formal Concept Analysis(FCA), which supports data tables containing the multiple types of attributes defined as fuzzy sets. The acquisition of the FCA models is computationally complex task and it is important to find more effective algorithms for their creation. Therefore, we have designed the algorithm for the reduction of the computation times, which is based on the simple division of input data table using bisection-based approach and then merging procedure compose the local models into one finally merged concept latticefor the complete input data. We present the illustrative experiments which prove the applicability of the presented algorithm for sparse data inputs, where it is possible to get significant decrease of computation times. More effective a

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/EE2.3.30.0041" target="_blank" >EE2.3.30.0041: POST-UP II.</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the IEEE 12th International Symposium on Applied Machine Intelligence and Informatics (SAMI 2014)

  • ISBN

    978-1-4799-3442-3

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    103-108

  • Publisher name

    IEEE Computer Society Press

  • Place of publication

    New York

  • Event location

    Herl'any, Slovensko

  • Event date

    Jan 23, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article