Formal Equivalence Analysis

DOI

10.2991/eusflat-19.2019.109How to use a DOI?

Keywords

Formal Concept Analysis. Partition lattices. Neighbourhood lattices Formal Equivalence Analysis

Abstract

Following R. Wille's lead and suggestion we set out to design a new kind of view onto a formal context analogous but different to Formal Concept Analysis (FCA) and Formal Independent Analysis (FIA). In this instance, we choose to analyse the information in the incidence table in terms of the partitions induced on the sets of objects and attributes by the some functions of single attributes and objects of the context. These functions constitute a left adjunction between sets of objects and attributes and we later lift this left adjunction to partitions of the objects and attributes. Therefore we refer to this new view onto the formal context as Formal Equivalence Analysis (FEA). Rather than looking on the effect of these partitions on set representation, as in Rough Sets, we try to make explicit the information in the context.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Francisco José Valverde Albacete
AU  - Carmen Peláez-Moreno
AU  - Pablo Cordero
AU  - Manuel Ojeda-Aciego
PY  - 2019/08
DA  - 2019/08
TI  - Formal Equivalence Analysis
BT  - Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2019)
PB  - Atlantis Press
SP  - 797
EP  - 804
SN  - 2589-6644
UR  - https://doi.org/10.2991/eusflat-19.2019.109
DO  - 10.2991/eusflat-19.2019.109
ID  - ValverdeAlbacete2019/08
ER  -