Repository logo
  • English
  • Deutsch
  • Français
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. CRIS
  3. Publication
  4. Triadic data: Representation and reduction
 

Triadic data: Representation and reduction

URI
https://arbor.bfh.ch/handle/arbor/45775
Version
Published
Identifiers
10.1016/j.ijar.2025.109532
Date Issued
2025-12
Author(s)
Kouankam Djouohou, Aubin Léa
Koguep Njionou, Blaise Blériot
Kwuida, Léonard  
Type
Article
Language
English
Abstract
Triadic Concept Analysis (TCA) is an extension of Formal Concept Analysis (FCA) for handling data represented as a set of objects described by attributes and conditions via a ternary relation. However, the intuition to go from FCA to TCA is not always straightforward. In this paper we discuss some FCA notions from dyadic to triadic. Although some ideas admit straightforward adaptation, most do not. In particular, we address the representation problem, the notion of redundant attributes and subcontexts in the triadic setting.
DOI
https://doi.org/10.24451/dspace/12272
Publisher DOI
10.1016/j.ijar.2025.109532
Journal or Serie
International Journal of Approximate Reasoning
ISSN
0888-613X
Publisher URL
https://www.sciencedirect.com/science/article/pii/S0888613X25001732
Organization
Wirtschaft  
Volume
187
Publisher
Elsevier
Submitter
Kwuida, Léonard
Citation apa
Kouankam Djouohou, A. L., Koguep Njionou, B. B., & Kwuida, L. (2025). Triadic data: Representation and reduction. In International Journal of Approximate Reasoning (Vol. 187). Elsevier. https://doi.org/10.24451/dspace/12272
File(s)
Loading...
Thumbnail Image
Download

open access

Name

1-s2.0-S0888613X25001732-main (1).pdf

License
Attribution 4.0 International
Version
published
Size

1016.45 KB

Format

Adobe PDF

Checksum (MD5)

41984b52197016be36651902bead911d

About ARBOR

Built with DSpace-CRIS software - System hosted and mantained by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Our institution