Triadic concept approximation
From MaRDI portal
Publication:6071277
DOI10.1016/j.ins.2021.04.064zbMath1528.68368OpenAlexW3157627716MaRDI QIDQ6071277
Kaio H. A. Ananias, Luis E. Zárate, Pedro H. B. Ruas, Rokia Missaoui, Mark A. J. Song
Publication date: 23 November 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.04.064
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice model of browsable data spaces
- The basic theorem of triadic concept analysis
- Pattern discovery in triadic contexts
- Approximation operators based on preconcepts
- Mining Triadic Association Rules from Ternary Relations
- Approximations in Concept Lattices
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- Tri-ordinal Factor Analysis
- Towards a Navigation Paradigm for Triadic Concepts
- Fuzzy and rough formal concept analysis: a survey
- Rough Set Approximations in Formal Concept Analysis
- Formal Concept Analysis
- Concept Lattices
This page was built for publication: Triadic concept approximation