Pages that link to "Item:Q3552300"
From MaRDI portal
The following pages link to Two Basic Algorithms in Concept Analysis (Q3552300):
Displaying 50 items.
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Minimal bases of temporal attribute implications (Q722104) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
- Relation-algebraic computation of fixed points with applications (Q817578) (← links)
- Interactive error correction in implicative theories (Q899138) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- Size of random Galois lattices and number of closed frequent itemsets (Q967342) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- An incremental concept formation approach for learning from databases (Q1341713) (← links)
- A formal method for inheritance graph hierarchy construction (Q1394885) (← links)
- Computing sets of graded attribute implications with witnessed non-redundancy (Q1615669) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Closure structures parameterized by systems of isotone Galois connections (Q1679638) (← links)
- On sets of graded attribute implications with witnessed non-redundancy (Q1750536) (← links)
- Using congruence relations to extract knowledge from concept lattices (Q1800395) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Associative models for storing and retrieving concept lattices (Q1958821) (← links)
- Approximate computation of exact association rules (Q2117123) (← links)
- Triadic exploration and exploration with multiple experts (Q2117131) (← links)
- Knowledge cores in large formal contexts (Q2149803) (← links)
- Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Recursive decomposition tree of a Moore co-family and closure algorithm. (Q2248537) (← links)
- Concept lattices with negative information: a characterization theorem (Q2282052) (← links)
- Conjunctive query pattern structures: a relational database model for formal concept analysis (Q2286397) (← links)
- Logic of temporal attribute implications (Q2364366) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Representing lattices using many-valued relations (Q2390385) (← links)
- Dichotomic lattices and local discretization for Galois lattices (Q2418288) (← links)
- Parallel algorithm for computing fixpoints of Galois connections (Q2430355) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- From equivalence queries to PAC learning: the case of implication theories (Q2658016) (← links)
- On the preferred extensions of argumentation frameworks: bijections with naive sets (Q2681398) (← links)
- Computing the Duquenne–Guigues basis: an algorithm for choosing the order (Q2817077) (← links)
- A lattice-free concept lattice update algorithm (Q2817085) (← links)
- Knowledge discovery in data sets with graded attributes (Q2817086) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)
- A fast incremental algorithm for building lattices (Q4409027) (← links)
- Axiomatisation of general concept inclusions from finite interpretations (Q4586152) (← links)
- Exploring Faulty Data (Q5255659) (← links)
- Actionability and Formal Concepts: A Data Mining Perspective (Q5445320) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
- On the Merge of Factor Canonical Bases (Q5445333) (← links)
- On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts (Q5853137) (← links)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7 (Q6040344) (← links)
- Lattice point of view for argumentation framework (Q6059223) (← links)
