Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
From MaRDI portal
Publication:3630242
DOI10.1007/978-3-642-01815-2_13zbMath1248.68473OpenAlexW1554401943MaRDI QIDQ3630242
Petko Valtchev, Laszlo Szathmary, Robert Godin, Jaume Baixeries
Publication date: 3 June 2009
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01815-2_13
Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Lattices (06B99)
Related Items
Triadic concept approximation, Generalization of association rules through disjunction, Partially ordered sets and stratification, Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices, Mining Triadic Association Rules from Ternary Relations, A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes, Algorithms for computing the Shapley value of cooperative games on lattices, Computing triadic generators and association rules from triadic contexts
Uses Software