In Pawlak’s theory of information systems, one has a collection of objects and knows the values of any object with respect a certain class of properties, usually called attributes. An implicit assumption of this theory is that the difference between the nature of objects and attributes is well outlined. In our paper we generalize the concept of information system by analyzing the case in which there is no a priori dis- tinction in the nature of objects and attributes and, hence, both the interpretations are admissible. We call the structure arising in the previous context knowledge pairing system. We study the indiscernibility relations induced in both the admissible interpretations by means of up-down operators, in such a way to have a direct analogy with the extent and intent operators used in Formal Context Analysis. In partic- ular, we investigate three models of knowledge pairing systems arising from real contexts and modeled respectively by graphs, digraphs and hypergraphs. We show the real convenience to use the notion of knowledge pairing system focusing on interpretation of this structure and discussing the two admissible perspectives obtained by avoiding the difference between the roles of objects and attributes.

Knowledge pairing systems in granular computing

Giampiero Chiaselotti
;
Tommaso Gentile;Federico G. Infusino
2017-01-01

Abstract

In Pawlak’s theory of information systems, one has a collection of objects and knows the values of any object with respect a certain class of properties, usually called attributes. An implicit assumption of this theory is that the difference between the nature of objects and attributes is well outlined. In our paper we generalize the concept of information system by analyzing the case in which there is no a priori dis- tinction in the nature of objects and attributes and, hence, both the interpretations are admissible. We call the structure arising in the previous context knowledge pairing system. We study the indiscernibility relations induced in both the admissible interpretations by means of up-down operators, in such a way to have a direct analogy with the extent and intent operators used in Formal Context Analysis. In partic- ular, we investigate three models of knowledge pairing systems arising from real contexts and modeled respectively by graphs, digraphs and hypergraphs. We show the real convenience to use the notion of knowledge pairing system focusing on interpretation of this structure and discussing the two admissible perspectives obtained by avoiding the difference between the roles of objects and attributes.
2017
Hypergraphs; Granular Computing; Lattices
File in questo prodotto:
File Dimensione Formato  
KBS.pdf

accesso aperto

Descrizione: DOI: https://doi.org/10.1016/j.knosys.2017.03.008
Tipologia: Documento in Pre-print
Licenza: Non specificato
Dimensione 429.74 kB
Formato Adobe PDF
429.74 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/144992
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 17
social impact