Paper Info
Title
On the connection of hypergraph theory with formal concept analysis and rough set theory
Abstract
We present a unique framework for connecting different topics: hypergraphs from one side and Formal Concept Analysis and Rough Set Theory from the other. This is done through the formal equivalence among Boolean information tables, formal contexts and hypergraphs. Links with generic (i.e., not Boolean) information tables are established, through so-called nominal scaling. The particular case of k-uniform complete hypergraphs will then be studied. In this framework, we are able to solve typical problems of Rough Set Theory and Formal Concept Analysis using combinatorial techniques. More in detail, we will give a formula to compute the degree of dependency and the partial implication between two sets of attributes, compute the set of reducts and define the structure of the partitions generated by all the definable indiscernibility relations.
Year
DOI
Venue
2016
10.1016/j.ins.2015.09.054
Information Sciences
Keywords
Field
DocType
Rough sets,Formal concept analysis,Hypergraphs
Discrete mathematics,Constraint graph,Hypergraph,Rough set,Dynamic and formal equivalence,Formal concept analysis,Scaling,Mathematics
Journal
Volume
Issue
ISSN
330
C
0020-0255
Citations 
PageRank 
References 
12
0.49
20
Authors
4
Name
Order
Citations
PageRank
Gianpiero Cattaneo156658.22
G. Chiaselotti215716.21
Davide Ciucci367253.74
Tommaso Gentile4938.13