Two Basic Algorithms in Concept Analysis
From MaRDI portal
Publication:3552300
DOI10.1007/978-3-642-11928-6_22zbMath1274.68484OpenAlexW1711140305MaRDI QIDQ3552300
Publication date: 14 April 2010
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11928-6_22
Knowledge representation (68T30) Graph algorithms (graph-theoretic aspects) (05C85) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (56)
Computing sets of graded attribute implications with witnessed non-redundancy ⋮ Logic of temporal attribute implications ⋮ Representing a concept lattice by a graph ⋮ An incremental concept formation approach for learning from databases ⋮ Knowledge cores in large formal contexts ⋮ A local approach to concept generation ⋮ Representing lattices using many-valued relations ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ Axiomatisation of general concept inclusions from finite interpretations ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Attribute exploration with multiple contradicting partial experts ⋮ A formal method for inheritance graph hierarchy construction ⋮ Lattice point of view for argumentation framework ⋮ Lexicon-based sentiment analysis in texts using formal concept analysis ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ Representations for the largest extension of a closure system ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Interactive error correction in implicative theories ⋮ Doubly-lexical order supports standardisation and recursive partitioning of formal context ⋮ On the complexity of enumerating pseudo-intents ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Associative models for storing and retrieving concept lattices ⋮ Some Complexity Results about Essential Closed Sets ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ Mathematical aspects of concept analysis ⋮ On sets of graded attribute implications with witnessed non-redundancy ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Size of random Galois lattices and number of closed frequent itemsets ⋮ Generalized domination in closure systems ⋮ A fast incremental algorithm for building lattices ⋮ Minimal bases of temporal attribute implications ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the Merge of Factor Canonical Bases ⋮ Concept lattices with negative information: a characterization theorem ⋮ Conjunctive query pattern structures: a relational database model for formal concept analysis ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Decision implication canonical basis: a logical perspective ⋮ Computing the Duquenne–Guigues basis: an algorithm for choosing the order ⋮ A lattice-free concept lattice update algorithm ⋮ Knowledge discovery in data sets with graded attributes ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams ⋮ On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts ⋮ Exploring Faulty Data ⋮ Approximate computation of exact association rules ⋮ Triadic exploration and exploration with multiple experts ⋮ Relation-algebraic computation of fixed points with applications
This page was built for publication: Two Basic Algorithms in Concept Analysis
