scientific article; zbMATH DE number 3604894

MaRDI QIDQ4170725zbMATH OpenFDO

Authors Eugene M. Norris

Publication date 1978

Mathematics Subject Classification ID

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)

Cited in

(18)

• Attribute-incremental construction of the canonical implication basis
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• The rectangle complex of a relation
• A framework for incremental generation of closed itemsets
• An incremental concept formation approach for learning from databases
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Closure-based constraints in formal concept analysis
• An incremental algorithm to construct a lattice of set intersections
• Complexity of learning in concept lattices from positive and negative examples
• Parallel algorithm for computing fixpoints of Galois connections
• Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
• Foliated semantic networks: Concepts, facts, qualities
• A local approach to concept generation
• Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
• Mathematical aspects of concept analysis
• A formal method for inheritance graph hierarchy construction
• Link key candidate extraction with relational concept analysis
• Computing stable extensions of argumentation frameworks using formal concept analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170725)