Applying Rough Sets to Information Tables Containing Possibilistic Values

Author(s):  
Michinori Nakata ◽  
Hiroshi Sakai
Author(s):  
Sadaaki Miyamoto ◽  
◽  
Tetsuya Murai ◽  
Yasuo Kudo ◽  
◽  
...  

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.


Author(s):  
Vicenç Torra ◽  
Yasuo Narukawa ◽  
Masahiro Inuiguchi

The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI) was held at Awaji Island, Japan, from November 30 to December 2, 2009 and was the inspiration for this special issue. The nine selected papers concern soft computing tool applications. The first, by Yoshida, studies the risk analysis of portfolios under uncertainty and gives expressions showing explicit relationships among parameters in a portfolio. The second, by Entani, proposes an efficiency-interval-based measure based on interval data envelopment analysis. The third, by Hamasuna, Endo, and Miyamoto, concerns clustering for data with tolerance and proposes algorithms for this type of data. The fourth, by Endo, Hasegawa, Hamasuna, and Kanzawa, focuses on fuzzy c-means clustering for uncertain data using quadratic regularization. The fifth, by Honda, Notsu, and Ichihashi, also involves clustering, focusing on variable selection/weighting in PCA-guided k-means. The sixth, by Hwang and Miyamoto, covers clustering focusing on kernel fuzzy c-means and some interesting new results. The seventh, by Kanzawa, Endo, and Miyamoto, uses fuzzy c-means in semisupervised fuzzy c-means. The eighth, by Kudo and Murai, is devoted to rough sets, proposing a heuristic algorithm for calculating a relative reduct candidate. The closing contribution, by Kusunoki and Inuiguchi, is also devoted to rough sets, with the authors studying rough set models in information tables with missing values. We thank the referees for their review work, and the Fuji Technology Press Ltd. staff for its encouragement and advice.


Author(s):  
Jun Meng ◽  
Tsauyoung Li ◽  
Zehua Chen ◽  
Xiukun Wang ◽  
Peng Wang

Sign in / Sign up

Export Citation Format

Share Document