Pages that link to "Item:Q3630242"
From MaRDI portal
The following pages link to Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice (Q3630242):
Displayed 8 items.
- Partially ordered sets and stratification (Q459398) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- Computing triadic generators and association rules from triadic contexts (Q2107481) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- Generalization of association rules through disjunction (Q2430351) (← links)
- Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices (Q3003408) (← links)
- Mining Triadic Association Rules from Ternary Relations (Q3003418) (← links)
- Triadic concept approximation (Q6071277) (← links)