Abstract. In this paper we discuss the problem of constructing the representation context of a pattern structure. First, we present a naive algorithm that ...
Building a Representation Context Based on Attribute Exploration ...
inria.hal.science › hal-03122343
In this paper we discuss the problem of constructing the representation context of a pattern structure. First, we present a naive algorithm that computes ...
... 2729/paper14. Jaume Baixeries Mehdi Kaytoue-Uberall Amedeo Napoli Víctor Codocedo. Building a Representation Context Based on Attribute Exploration Algorithms.
Oct 10, 2020 · Algorithm 1 starts by building the RC K: the set of objects is the same as in the pattern structure, and the set of attributes and the incidence.
This work presents a naive algorithm that computes the representation context a pattern structure, and adds a sampling technique in order to reduce the size ...
First, we present a naive algorithm that computes the representation context a pattern structure. Then, we add a sampling technique in order to reduce the size ...
Missing: Building | Show results with:Building
Dur- ing the attribute exploration process, an implication between attributes can be checked by querying the knowledge base with an appropriate SPARQL query.
The algorithm produces the closed sets in some lexicographic order; it can also be used to compute the pseudoclosed sets. 3. Attribute exploration. A Jtirmal ...
Missing: Building | Show results with:Building
The context representation can be used both for universal and existential clau- ses; the existential ones (\attribute combinations that we know to occur") are.
Abstract. Attribute exploration in FCA is proposed by Baader etc. in the past decade and it is an effective tool applying to description logics to construct.