This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n8http://purl.org/net/nknouf/ns/bibtex#
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n11https://schema.org/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n23http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F13%3A33147061%21RIV14-MSM-15310___/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F13%3A33147061%21RIV14-MSM-15310___
rdf:type
skos:Concept n18:Vysledek
rdfs:seeAlso
http://cla.inf.upol.cz/papers/cla2013/paper22.pdf
dcterms: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. 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.
dcterms:title
A lattice-free concept lattice update algorithm based on *CbO A lattice-free concept lattice update algorithm based on *CbO
skos:prefLabel
A lattice-free concept lattice update algorithm based on *CbO A lattice-free concept lattice update algorithm based on *CbO
skos:notation
RIV/61989592:15310/13:33147061!RIV14-MSM-15310___
n18:predkladatel
n19:orjk%3A15310
n3:aktivita
n21:P
n3:aktivity
P(EE2.3.20.0059)
n3:dodaniDat
n16:2014
n3:domaciTvurceVysledku
n13:1865994
n3:druhVysledku
n20:D
n3:duvernostUdaju
n6:S
n3:entitaPredkladatele
n23:predkladatel
n3:idSjednocenehoVysledku
58681
n3:idVysledku
RIV/61989592:15310/13:33147061
n3:jazykVysledku
n14:eng
n3:klicovaSlova
*CbO; algorithm; concept lattice; lattice-free
n3:klicoveSlovo
n4:%2ACbO n4:concept%20lattice n4:lattice-free n4:algorithm
n3:kontrolniKodProRIV
[135F8AEEDC76]
n3:mistoKonaniAkce
La Rochelle, Francie
n3:mistoVydani
La Rochelle
n3:nazevZdroje
CLA 2013: Proceedings of the 10th International Conference on Concept Lattices and Their Applications
n3:obor
n22:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n7:EE2.3.20.0059
n3:rokUplatneniVysledku
n16:2013
n3:tvurceVysledku
Outrata, Jan
n3:typAkce
n15:WRD
n3:zahajeniAkce
2013-10-15+02:00
s:numberOfPages
14
n8:hasPublisher
Laboratory L3i, University of La Rochelle
n11:isbn
978-2-7466-6566-8
n17:organizacniJednotka
15310