The Representation of Indiscernibility Relation Using ZBDDs

The indiscernibility relation is the basic concept in Rough set theory, a novel representation of indiscernibility relation using Zero-Suppressed BDDs is proposed in this paper. Through introducing the indiscernibility matrix and the indiscernibility graph, we put forward the encoding of the variable and give the characteristic function. Once the characteristic function is constructed, it can be represented using ZBDDs.And further, combined with an example, we analyze the effectiveness of this method. It provides a basis for deal with rough set computing.

[1]  Z. Pawlak,et al.  Rough set approach to multi-attribute decision analysis , 1994 .

[2]  Chen Zhao-jiong,et al.  A New Discernibility Matrix and the Computation of a Core , 2002 .

[3]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  XU Feng-sheng,et al.  New discernibility matrix and computation of core , 2007 .

[6]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[7]  XIAOHUA Hu,et al.  LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..

[8]  Zhou Jia-qing.  A new discernibility matrix and the computation of a core , 2007 .

[9]  K. Thangavel,et al.  Dimensionality reduction based on rough set theory: A review , 2009, Appl. Soft Comput..

[10]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[11]  Chen Yu.  Searching Algorithm for Attribute Reduction Based on Power Graph , 2009 .

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

[13]  Yiyu Yao,et al.  On Reduct Construction Algorithms , 2006, RSKT.

[14]  Yiyu Yao,et al.  Discernibility matrix simplification for constructing attribute reducts , 2009, Inf. Sci..

[15]  R. Słowiński.  Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory , 1992 .

[16]  Wang Guo.  Calculation Methods for Core Attributes of Decision Table , 2003 .

[17]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[18]  A. Muir.  Rough set data representation using binary decision diagrams. , 2004 .

[19]  Tianlong Gu,et al.  Symbolic OBDD representations for mechanical assembly sequences , 2008, Comput. Aided Des..

[20]  Masahiro Fujita,et al.  Multi-level logic optimization using binary decision diagrams , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[21]  Ivana Berkovic,et al.  The representation of indiscernibility relation by graph , 2011, 2011 IEEE 9th International Symposium on Intelligent Systems and Informatics.