A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A New Symbolic Method for Discernibility Matrix in Rough Set
2014
International Journal of Hybrid Information Technology
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,
doi:10.14257/ijhit.2014.7.6.17
fatcat:acwxrx3xjbelpdqrkmfgmmckeq