scientific article; zbMATH DE number 3604894
From MaRDI portal
Publication:4170725
zbMath0389.05003MaRDI QIDQ4170725
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (17)
Complexity of learning in concept lattices from positive and negative examples ⋮ An incremental concept formation approach for learning from databases ⋮ Attribute-incremental construction of the canonical implication basis ⋮ A local approach to concept generation ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ A formal method for inheritance graph hierarchy construction ⋮ The rectangle complex of a relation ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Closure-based constraints in formal concept analysis ⋮ Mathematical aspects of concept analysis ⋮ Foliated semantic networks: Concepts, facts, qualities ⋮ A framework for incremental generation of closed itemsets ⋮ Link key candidate extraction with relational concept analysis ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
This page was built for publication:
