Rough Set Approximations in Formal Concept Analysis

Conventional set approximations are based on a set of attributes; however, these approximations cannot relate an object to the corresponding attribute. In this study, a new model for set approximation based on individual attributes is proposed for interval-valued data. Defining an indiscernibility relation is omitted since each attribute value itself has a set of values. Two types of approximations, single- and multiattribute approximations, are presented. A multi-attribute approximation has two solutions: a maximum and a minimum solution. A maximum solution is a set of objects that satisfy the condition of approximation for at least one attribute. A minimum solution is a set of objects that satisfy the condition for all attributes. The proposed set approximation is helpful in finding the features of objects relating to condition attributes when interval-valued data are given. The proposed model contributes to feature extraction in interval-valued information systems.

[1]  Witold Lipski,et al.  On semantic issues connected with incomplete information databases , 1979, ACM Trans. Database Syst..

[2]  J. Taylor.  An Introduction to Error Analysis , 1982 .

[3]  Ewa Orlowska,et al.  Representation of Nondeterministic Information , 1984, Theor. Comput. Sci..

[4]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[5]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[6]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[7]  Yiyu Yao,et al.  Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[8]  Akira Nakamura,et al.  A rough logic based on incomplete information and its application , 1996, Int. J. Approx. Reason..

[9]  Marzena Kryszkiewicz,et al.  Rough Set Approach to Incomplete Information Systems , 1998, Inf. Sci..

[10]  Marzena Kryszkiewicz,et al.  Rules in Incomplete Information Systems , 1999, Inf. Sci..

[11]  Edwin Diday,et al.  Symbolic Data Analysis: A Mathematical Framework and Tool for Data Mining , 1999, Electron. Notes Discret. Math..

[12]  Yee Leung,et al.  Maximal consistent block technique for rule acquisition in incomplete information systems , 2003, Inf. Sci..

[13]  Edwin Diday,et al.  An introduction to symbolic data analysis and the SODAS software , 2003, Intell. Data Anal..

[14]  Hiroshi Sakai,et al.  Basic Algorithms and Tools for Rough Non-deterministic Information Analysis , 2004, Trans. Rough Sets.

[15]  Yanyong Guan,et al.  Set-valued information systems , 2006, Inf. Sci..

[16]  Daisuke Yamaguchi,et al.  On the Combination of Rough Set Theory and Grey Theory Based on Grey Lattice Operations , 2006, RSCTC.

[17]  Masatake Nagai,et al.  Application of grey-based rough decision-making approach to suppliers selection , 2007 .

[18]  GuoDong Li,et al.  A grey-based decision-making approach to the supplier selection problem , 2007, Math. Comput. Model..

[19]  GuoDong Li,et al.  A Grey-Rough Set Approach for Interval Data Reduction of Attributes , 2007, RSEISP.

[20]  D. Yamaguchi,et al.  A grey-based rough decision-making approach to supplier selection , 2008 .

[21]  Manfred M. Fischer,et al.  A Rough Set Approach for the Discovery of Classification Rules in Interval-Valued Information Systems , 2008, Int. J. Approx. Reason..