Mining Triadic Association Rules from Ternary Relations

DOI10.1007/978-3-642-20514-9_16zbMath1326.68287OpenAlexW1578357123MaRDI QIDQ3003418

Léonard Kwuida, Rokia Missaoui

Publication date: 27 May 2011

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20514-9_16

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (4)

A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Triadic concept approximation ⋮ On implication bases in \(n\)-lattices ⋮ Computing triadic generators and association rules from triadic contexts

Cites Work

• Polyadic concept analysis
• The basic theorem of triadic concept analysis
• About the Lossless Reduction of the Minimal Generator Family of a Context
• Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
• A fast incremental algorithm for building lattices
• Conceptual Structures at Work
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mining Triadic Association Rules from Ternary Relations