A new symbolic method for discernibility matrix in rough set

作者：Wei Qianjin^*; Gu Tianlong

来源：International Journal of Hybrid Information Technology, 2014, 7(6): 199-210.

DOI：10.14257/ijhit.2014.7.6.17

• Attribute reduction
• Binary discernibility matrix
• Discernibility matrix
• Information table
• OBDD
• Ordered binary decision diagrams
• Storage performance
• Zero-Suppressed BDDs

Generating discernibility matrix consumes huge time and space. To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Zero-Suppressed BDDs (ZBDD) and Ordered binary decision diagrams (OBDD) is proposed in this paper, experiment is carried to compare the storage space of discernibility matrix with that of ZBDD and OBDD, results show that the new method has better storage performance and improve the attribute reduction for those information systems with more objects and features.

• 出版日期2014
• 单位西安电子科技大学