2016
DOI: 10.1016/j.ins.2015.09.054
|View full text |Cite
|
Sign up to set email alerts
|

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 Roug… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(10 citation statements)
references
References 28 publications
0
10
0
Order By: Relevance
“…Information map F meets the condition F : U × E → V and specifies the attribute values of each object in the discourse domain U . For every subset of the attributes A ⊆ E , A ‐indiscernibility relation, expressed as IND( A ), is defined by the formula () 18 . In the decision table, S , x , and y are equivalent concerning B ; that is, x and y cannot be distinguished by the attributes in A . IND()A={}()x,yU×UaA,F()x,a=F()y,a. …”
Section: Methodsmentioning
confidence: 99%
“…Information map F meets the condition F : U × E → V and specifies the attribute values of each object in the discourse domain U . For every subset of the attributes A ⊆ E , A ‐indiscernibility relation, expressed as IND( A ), is defined by the formula () 18 . In the decision table, S , x , and y are equivalent concerning B ; that is, x and y cannot be distinguished by the attributes in A . IND()A={}()x,yU×UaA,F()x,a=F()y,a. …”
Section: Methodsmentioning
confidence: 99%
“…(4) Rough set technology: in the process of theory application, it is not necessary to grasp the prior conditions of the problem to determine the inherent law of the problem. Rough set technology theory is mainly applied in fuzzy recognition and decision analysis [25]. faced by enterprises, and logistics has gradually become the third source of profit for enterprises and an important area to cultivate their core competitiveness.…”
Section: System Constructionmentioning
confidence: 99%
“…in fields, such as medicine, economy, finance, business, environment, electrical and computer engineering. Granular computing and rough sets have been studied in context of graphs [4,5], digraph [13] and hyper graphs [2]. The reader is referred to the following [3,20,21,23] for further reading in this area of study.…”
Section: Introductionmentioning
confidence: 99%