[HTML][HTML] Using congruence relations to extract knowledge from concept lattices
It is well-known inside the Formal Concept Analysis (FCA) community that a concept lattice
could have an exponential size with respect to the input data. Hence, the size of concept …
could have an exponential size with respect to the input data. Hence, the size of concept …
The reverse doubling construction
It is well known inside the Formal Concept Analysis (FCA) community that a concept lattice
could have an exponential size in the data. Hence, the size of concept lattices is a critical …
could have an exponential size in the data. Hence, the size of concept lattices is a critical …
Subdirect decomposition of contexts into subdirectly irreducible factors
The size of a concept lattice may increase exponentially with the size of the context. When
the number of nodes is too large, it becomes very difficult to generate and study such a …
the number of nodes is too large, it becomes very difficult to generate and study such a …
[PDF][PDF] Generalized total colorings of graphs
M Borowiecki, A Kemnitz, M Marangio… - Discussiones …, 2011 - bibliotekanauki.pl
An additive hereditary property of graphs is a class of simple graphs which is closed under
unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of …
unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of …
[PDF][PDF] On infinite uniquely partitionable graphs and graph properties of finite character
J Bucko, P Mihók - Discussiones Mathematicae Graph Theory, 2009 - bibliotekanauki.pl
A graph property is any nonempty isomorphism-closed class of simple (finite or infinite)
graphs. A graph property is of finite character if a graph G has a property if and only if every …
graphs. A graph property is of finite character if a graph G has a property if and only if every …
Cadre général pour la recherche d'information et l'extraction de connaissances par l'exploration de treillis
JF Viaud - 2017 - theses.hal.science
Au cours des deux dernières décennies, nous avons été littéralement submergés par les
données. Nous recevons, rapidement, un flux colossal de données hétérogènes. Les …
données. Nous recevons, rapidement, un flux colossal de données hétérogènes. Les …
Lattice decompositions through methods using congruence relations
It is well known by analysts that a concept lattice has an exponential size in the data. Thus,
as soon as he works with real data, the size of the concept lattice is a fundamental problem …
as soon as he works with real data, the size of the concept lattice is a fundamental problem …
Décomposition sous-directe d'un treillis en facteurs irréductibles
La taille d'un treillis de concepts peut augmenter de façon exponentielle avec la taille du
contexte. Lorsque le nombre de noeuds devient important, l'´ etude et la génération d'un tel …
contexte. Lorsque le nombre de noeuds devient important, l'´ etude et la génération d'un tel …