In this paper, we introduce a notion of generalized dependency relation between subsets of an arbitrary (not necessarily finite) set $Omega$ starting with the classical Armstrong's rule. More specifically, we fix a given set system $mcF$ on $Omega$ and call any transitive binary relation $Lar$ on the power set $mcP(Omega)$ such that egin{itemize} item $Bsubseteq A in mcF$ implies $BLar A$; item $B Lar A$ if and only if $b Lar A,,, orall bin B$; end{itemize} a $[mcF]$-{em dependency relation} on $Omega$. We use the generality of such a notion to investigate some common analogies between rough set theory on information tables, formal context analysis, Scott's information systems and possibility theory. More specifically, taking as inspirational models some classical notions derived by rough set theory on attribute set of an information table, we first generalize and study such notions for any $[mcF]$-dependency relation. Next, we interpret such general results relatively to natural dependency relations derived by rough set theory on objects of an information table, formal context analysis, Scott's information systems and possibility theory. Finally, we study the generation of $[mcF]$-dependency relations by starting from a fixed set $mcD$ of subset ordered pairs of $Omega$.

Notions from rough set theory in a generalized dependency relation context

CHIASELOTTI GIAMPIERO
;
INFUSINO FEDERICO
2018

Abstract

In this paper, we introduce a notion of generalized dependency relation between subsets of an arbitrary (not necessarily finite) set $Omega$ starting with the classical Armstrong's rule. More specifically, we fix a given set system $mcF$ on $Omega$ and call any transitive binary relation $Lar$ on the power set $mcP(Omega)$ such that egin{itemize} item $Bsubseteq A in mcF$ implies $BLar A$; item $B Lar A$ if and only if $b Lar A,,, orall bin B$; end{itemize} a $[mcF]$-{em dependency relation} on $Omega$. We use the generality of such a notion to investigate some common analogies between rough set theory on information tables, formal context analysis, Scott's information systems and possibility theory. More specifically, taking as inspirational models some classical notions derived by rough set theory on attribute set of an information table, we first generalize and study such notions for any $[mcF]$-dependency relation. Next, we interpret such general results relatively to natural dependency relations derived by rough set theory on objects of an information table, formal context analysis, Scott's information systems and possibility theory. Finally, we study the generation of $[mcF]$-dependency relations by starting from a fixed set $mcD$ of subset ordered pairs of $Omega$.
Closure Systems; Dependency; Rough Set Theory; Formal Context Analysis; Scott Systems; Possibility Measures
File in questo prodotto:
File Dimensione Formato  
JAR2.pdf

accesso aperto

Descrizione: The published article is available at https://www.sciencedirect.com/science/article/pii/S0888613X17306011?via=ihub;DOI: 10.1016/j.ijar.2018.04.002
Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 500.49 kB
Formato Adobe PDF
500.49 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/280363
 Attenzione

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

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