Pages that link to "Item:Q2385433"
From MaRDI portal
The following pages link to Attribute-incremental construction of the canonical implication basis (Q2385433):
Displaying 20 items.
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- Interactive error correction in implicative theories (Q899138) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Using congruence relations to extract knowledge from concept lattices (Q1800395) (← links)
- Parallel attribute exploration (Q1990469) (← links)
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis (Q2117120) (← links)
- Approximate computation of exact association rules (Q2117123) (← 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)
- Computing the Duquenne–Guigues basis: an algorithm for choosing the order (Q2817077) (← links)
- Construction of multi-attributes decrement for concept lattice (Q2993247) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Axiomatisation of general concept inclusions from finite interpretations (Q4586152) (← links)
- ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS (Q5151065) (← links)
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis (Q6071284) (← links)
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis (Q6125182) (← links)
- Mining ℰℒ⊥ Bases with Adaptable Role Depth (Q6135964) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
- Formal concept analysis: from knowledge discovery to knowledge processing (Q6602260) (← links)
