Two basic algorithms in concept analysis
From MaRDI portal
Recommendations
Cited in
(75)- Enumeration aspects of maximal cliques and bicliques
- An incremental concept formation approach for learning from databases
- A formal method for inheritance graph hierarchy construction
- Finite hull systems and their implication bases.
- Computing sets of graded attribute implications with witnessed non-redundancy
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Closure structures parameterized by systems of isotone Galois connections
- On sets of graded attribute implications with witnessed non-redundancy
- Using congruence relations to extract knowledge from concept lattices
- Representing a concept lattice by a graph
- Associative models for storing and retrieving concept lattices
- LCM from FCA point of view: a CbO-style algorithm with speed-up features
- Approximate computation of exact association rules
- Triadic exploration and exploration with multiple experts
- Knowledge cores in large formal contexts
- 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.
- Concept lattices with negative information: a characterization theorem
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- Logic of temporal attribute implications
- A local approach to concept generation
- Representing lattices using many-valued relations
- Dichotomic lattices and local discretization for Galois lattices
- Parallel algorithm for computing fixpoints of Galois connections
- Generalized domination in closure systems
- From equivalence queries to PAC learning: the case of implication theories
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- 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
- Some complexity results about essential closed sets
- scientific article; zbMATH DE number 2177622 (Why is no real title available?)
- Fast Detection of Stable and Count Predicates in Parallel Computations
- On links between concept lattices and related complexity problems
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- A fast incremental algorithm for building lattices
- Axiomatisation of general concept inclusions from finite interpretations
- scientific article; zbMATH DE number 1898282 (Why is no real title available?)
- Extensional confluences and local closure operators
- Exploring faulty data
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- Actionability and Formal Concepts: A Data Mining Perspective
- On the Complexity of Computing Generators of Closed Sets
- On the Merge of Factor Canonical Bases
- On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Attribute exploration with multiple contradicting partial experts
- Lattice point of view for argumentation framework
- Systematic categorization and evaluation of CbO-based algorithms in FCA
- Maximal closed set and half-space separations in finite closure systems
- Lexicon-based sentiment analysis in texts using formal concept analysis
- 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
- Doubly-lexical order supports standardisation and recursive partitioning of formal context
- On the complexity of enumerating pseudo-intents
- Computing stable extensions of argumentation frameworks using formal concept analysis
- Comparing machine learning algorithms by union-free generic depth
- Formal concept analysis: from knowledge discovery to knowledge processing
- Extracting attribute implications from a formal context: unifying the basic approaches
- Tropical compactification via Ganter's algorithm
- Mathematical aspects of concept analysis
- Theories, models and bases of attribute implications in multi-adjoint concept lattices with hedges
- Pac learning of concept inclusions for ontology-mediated query answering
- Minimal bases of temporal attribute implications
- A construction of an optimal base for conditional attribute and attributional condition implications in triadic contexts
- Exploring the closure operator for minimal a, b-separators: insights from Galois connections
- Decision implication canonical basis: a logical perspective
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
- Relation-algebraic computation of fixed points with applications
- Interactive error correction in implicative theories
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Size of random Galois lattices and number of closed frequent itemsets
This page was built for publication: Two basic algorithms in concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552300)
