scholarly journals Rule induction based on rough sets from information tables having continuous domains

2019 ◽  
Vol 4 (4) ◽  
pp. 237-244 ◽  
Author(s):  
Michinori Nakata ◽  
Hiroshi Sakai ◽  
Keitarou Hara
Keyword(s):  
Rough Sets ◽  
Rule Induction ◽  
Continuous Domains ◽  
Information Tables

A Family of Polymodal Systems and its Application to Generalized Possibility Measures and Multi-Rough Sets

2006 ◽  
Vol 10 (5) ◽  
pp. 625-632 ◽  
Author(s):  
Sadaaki Miyamoto ◽  
◽  
Tetsuya Murai ◽  
Yasuo Kudo ◽  
◽  
...  
Keyword(s):  
Information System ◽  
Computer Science ◽  
Relational Database ◽  
Rough Sets ◽  
Theoretical Computer Science ◽  
Theoretical Frameworks ◽  
Theoretical Computer ◽  
The One ◽  
Information Tables ◽  
Polymodal Logic

Polymodal systems generally have large areas of applications to theoretical computer science including the theory of programming, while other applications are not yet fully explored. In this paper we consider a family of polymodal systems with the structure of lattices on the polymodal indices. After investigating theory of the polymodal systems such as the completeness, we study two applications. One is generalized possibility measures in which lattice-valued measures are proposed and relations with the ordinary possibility and necessity measures are uncovered. Second application is consideration of an information system as a table such as the one in the relational database. It is known that rough sets are used to discover regularities from such information tables. Applying polymodal logic concept, we generalize rough sets which are called multi-rough sets here. Our consideration is mainly to establish theoretical frameworks in these two application areas and hence no real examples are shown here.

Sign in / Sign up

Export Citation Format

Share Document