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”

A lattice-free concept lattice update algorithm based on *CbO

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F13%3A33147061" target="_blank" >RIV/61989592:15310/13:33147061 - isvavai.cz</a>

  • Result on the web

    <a href="http://cla.inf.upol.cz/papers/cla2013/paper22.pdf" target="_blank" >http://cla.inf.upol.cz/papers/cla2013/paper22.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    A lattice-free concept lattice update algorithm based on *CbO

  • Original language description

    Updating a concept lattice when introducing new objects to input data can be done by any of the so-called incremental algorithms for computing concept lattice of the data. The algorithms use and update the lattice while introducing new objects one by one. The present concept lattice of input data without the new objects is thus required before the update. In this paper we propose an efficient algorithm for updating the lattice from the present and new objects only, not requiring the possibly large concept lattice of present objects. The algorithm results as a modification of the CbO algorithm for computing the set of all formal concepts, or its modifications like FCbO, PCbO or PFCbO, to compute new and modified formal concepts only and the changes of the lattice order relation when input data changes. We describe the algorithm and present an experimental evaluation of its performance and a comparison with AddIntent incremental algorithm for computing concept lattice.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegration of Czech Scientist and Creation of Top Level Team in Information Sciences</a><br>

  • Continuities

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

Others

  • Publication year

    2013

  • 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

    CLA 2013: Proceedings of the 10th International Conference on Concept Lattices and Their Applications

  • ISBN

    978-2-7466-6566-8

  • ISSN

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    261-274

  • Publisher name

    Laboratory L3i, University of La Rochelle

  • Place of publication

    La Rochelle

  • Event location

    La Rochelle, Francie

  • Event date

    Oct 15, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article