On the connection of hypergraph theory with formal concept analysis and rough set theory

被引：36

作者：

Cattaneo, Gianpiero ^{[1
]}

Chiaselotti, Giampiero ^{[2
]}

Ciucci, Davide ^{[1
]}

Gentile, Tommaso ^{[2
]}

机构：

[1] Univ Milano Bicocca, Dept Informat Syst & Commun, I-20126 Milan, Italy

[2] Univ Calabria, Dept Math & Informat, I-87036 Arcavacata Di Rende, CS, Italy

来源：

INFORMATION SCIENCES | 2016年 / 330卷

关键词：

Rough sets; Formal concept analysis; Hypergraphs; CO-ENTROPY; DEPENDENCIES; PARTITIONS; COVERINGS;

D O I：

10.1016/j.ins.2015.09.054

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2015 Elsevier Inc. All rights reserved.

引用

页码：342 / 357

页数：16

共 50 条

[21] Possibility theory and formal concept analysis in information systems
Dubois, Didier
Prade, Henri
PROCEEDINGS OF THE JOINT 2009 INTERNATIONAL FUZZY SYSTEMS ASSOCIATION WORLD CONGRESS AND 2009 EUROPEAN SOCIETY OF FUZZY LOGIC AND TECHNOLOGY CONFERENCE, 2009, : 1021 - 1026
[22] Extension of formal concept theory for organization structure analysis
Kozusznik, Jan
Vondrak, Ivo
15TH EUROPEAN CONCURRENT ENGINEERING CONFERENCE/5TH FUTURE BUSINESS TECHNOLOGY CONFERENCE, 2008, : 71 - 73
[23] A Rough Set Multi-Knowledge Extraction Algorithm and Its Formal Concept Analysis
Zhu, Zhengqiong
Li, Hui
Dai, Guangyao
Abraham, Ajith
Yang, Wanqing
2014 14TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2014), 2014,
[24] Measuring uncertainty in rough set theory
Wierman, MJ
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 1999, 28 (4-5) : 283 - 297
[25] Extensions and intentions in the rough set theory
Bonikowski, Z
Bryniarski, E
Wybraniec-Skardowska, U
INFORMATION SCIENCES, 1998, 107 (1-4) : 149 - 167
[26] An Approach of Proximity in Rough Set Theory
Tiwari, Surabhi
Singh, Pankaj Kumar
FUNDAMENTA INFORMATICAE, 2019, 166 (03) : 251 - 271
[27] Equivalence relations and rough set theory
Guan, JW
Bell, DA
Liu, DY
PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 104 - 107
[28] Efficient Rough Set Theory Merging
Grabowski, Adam
FUNDAMENTA INFORMATICAE, 2014, 135 (04) : 371 - 385
[29] Research on rough set theory extension and rough reasoning
Jiang, YL
Xu, CF
Gou, J
Li, ZX
2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 5888 - 5893
[30] Sampling aspects of rough set theory
Bruce Curry
Computational Management Science, 2004, 1 (2) : 151 - 178

← 1 2 3 4 5 →